Packing graphs: The packing problem solved.
Parabolic networks and polynomial growth
Periodic solutions in systems at resonances with small relay hysteresis
Polyabelian loops and Boolean completeness
We consider the question of which loops are capable of expressing arbitrary Boolean functions through expressions of constants and variables. We call this property Boolean completeness. It is a generalization of functional completeness, and is intimately connected to the computational complexity of various questions about expressions, circuits, and equations defined over the loop. We say that a loop is polyabelian if it is an iterated affine quasidirect product of Abelian groups; polyabelianness...
Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites