Janusz Januszewski

Discret. Math., January, 2024

2023

Packing batches of cubes into a single bin.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

2022

Packing batches of items into a single bin.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

2020

Online packing of d-dimensional boxes into the unit cube.

[BibT_eX]

[DOI]

Period. Math. Hung., 2020

Efficient 1-Space Bounded Hypercube Packing Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

A note on three Moser's problems and two Paulhus' lemmas.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Drawer algorithms for 1-space bounded multidimensional hyperbox packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

2017

Online Packing of Rectangular Items into Square Bins.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

2016

Packing rectangles into a large square.

[BibT_eX]

[DOI]

Period. Math. Hung., 2016

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

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

2015

An Upper Bound for Some Coloring Problem.

[BibT_eX]

[DOI]

Am. Math. Mon., 2015

A note on one-space bounded square packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

2012

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Translative Packing of Unit Squares into Squares.

[BibT_eX]

[DOI]

Int. J. Math. Math. Sci., 2012

2010

Covering the Plane with Translates of a Triangle.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

2009

A Note on Covering a Square of Side Length 2 + with Unit Squares.

[BibT_eX]

[DOI]

Am. Math. Mon., 2009

2006

A note on translative packing a triangle by sequences of its homothetic copies.

[BibT_eX]

[DOI]

Period. Math. Hung., 2006

2003

Packing similar triangles into a triangle.

[BibT_eX]

[DOI]

Period. Math. Hung., 2003

1994

On-line Covering the Unit Cube by Cubes.

[BibT_eX]

[DOI]