On the Covering Multiplicity of Lattices.
On the lattice packing--covering ratio of finite-dimensional normed spaces
On the Maximum of the Minimum of a Sum.
On the packing densities of superballs and other bodies.
On the section of a lattice–covering of balls
On the shortest curve which meets all the lines which meet a circle
On Two Finite Covering Problems of Bambah, Rogers, Woods and Zassenhaus.
On-line algorithms for the -adic covering of the unit interval and for covering a cube by cubes.
On-line covering a box by cubes.
On-Line Covering a Cube by a Sequence of Cubes.
On-Line Covering the Unit Cube by Cubes.
On-line packing regular boxes in the unit cube
We describe a class of boxes such that every sequence of boxes from this class of total volume smaller than or equal to 1 can be on-line packed in the unit cube.
On-line packing sequences of segments, cubes and boxes.
On-line -adic covering by the method of the -th segment and its application to on-line covering by cubes.
Optimal Spherical Packing of Circles and Hilbert's 14th Problem
Optimal substructures in optimal and approximate circle packings.