On random greedy triangle packing.
On the Covering Multiplicity of Lattices.
On the local linear independence of translates of a box spline
On-line Covering the Unit Square with Squares
The unit square can be on-line covered with any sequence of squares whose total area is not smaller than 4.
On-line Packing Squares into n Unit Squares
If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.
Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
Nous nous intéressons dans cet article au problème de découpe guillotine en deux dimensions noté 2BP/O/G. Il s'agit de découper un certain nombre de pièces rectangulaires dans un ensemble de plaques de matière première, elles même rectangulaires et identiques. Celles-ci sont disponibles en quantité illimitée. L'objectif est de minimiser le nombre de plaques utilisées pour satisfaire la demande, en appliquant une succession de coupes, dites guillotines, allant de bout en bout. Nous proposons une approche...
Orthogonal double covers of complete graphs by fat caterpillars
An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spanning subgraphs of Kₙ, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kₙ is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n-1 edges. We show that for any given positive integer d, almost all caterpillars of diameter d admit an ODC of the corresponding complete graph.
Packing 10 or 11 unit squares in a square.
Packing graphs: The packing problem solved.
Packing of 180 equal circles on a sphere.
Packing unit squares in squares: A survey and new results.
Packings of pairs with a minimum known number of quadruples
Let be an -set. The problem of packing of pairs on with a minimum number of quadruples on is settled for and also for , , , , , where is any positive integer. In the other cases of methods have been presented for constructing the packings having a minimum known number of quadruples.
Packungen kongruenter Stäbchen mit konstanter Nachbarnzahl.
Penny-Packing and Two-Dimensional Codes.
Quasicrystallography: some interesting new patterns
Real time asymptotic packing.
Repeated patterns of dense packings of equal disks in a square.
Rigidité des empilements infinis immergés proprement dans le plan et dans le disque
Simulated factorizations II.
Some Basic Properties of Packing and Covering Constants.