Janusz Januszewski

On-Line Packing Sequences of Cubes in the Unit Cube

AbstractAlmost thirty years ago Meir and Moser proved that every sequence of d -dimensional cubes of total volume 2

Packing Rectangles into the Unit Square

\frac{1}{2}

On Volterra integral equations with weakly singular kernels in Banach spaces

)d can be packed in the unit cube. We show that if d≥ 5, then this property holds true also for the on-line packing.

On-line algorithms for 2-space bounded 2-dimensional bin packing

AbstractThe minimum density of a covering of the plane with translates of a triangle is

ON-LINE COVERING THE UNIT SQUARE BY SQUARES AND THE THREE-DIMENSIONAL UNIT CUBE BY CUBES

\frac{3}{2}

On-line covering the unit cube by cubes

.

Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing

AbstractEvery sequence of rectangles of side lengths not greater than 1, whose total area is smaller than or equal to