Packing unit squares in a rectangle.
Packing unit squares in squares: A survey and new results.
Perfekte Rechteckzerlegung.
Pflasterungen von Rechtecken mit Steinen vom Typ 1 x j.
Protecting regular polygons.
Rangements optimaux de carrés unité dans une bande infinie
Rareté des intervalles recouvrant un point dans un recouvrement aléatoire
Relative Newton Numbers.
Repeated patterns of dense packings of equal disks in a square.
Residual Finiteness of Surface Groups via Tessellations.
Self-Packing of Centrally Symmetric Convex Bodies in R2 .
Solid Circle-Packings in the Euclidean Plane.
Solving the sensor cover energy problem via integer linear programming
This paper demonstrates that the sensor cover energy problem in wireless communication can be transformed into a linear programming problem with max-plus linear inequality constraints. Consequently, by a well-developed preprocessing procedure, it can be further reformulated as a 0-1 integer linear programming problem and hence tackled by the routine techniques developed in linear and integer optimization. The performance of this two-stage solution approach is evaluated on a set of randomly generated...
The densest lattice in twenty-four dimensions.
The densest packing of 12 congruent circles in a circle.
The densest packing of 13 congruent circles in a circle.
The Densest Packing of Equal Circles into a Parallel Strip.
The Disk-Packing Constant
Tile-transitive partial tilings of the plane.
Translative packing of a convex body by sequences of its homothetic copies
Every sequence of positive or negative homothetic copies of a planar convex body whose total area does not exceed times the area of can be translatively packed in .