@article{ARM_1996_32_2_a0,
author = {Novotn\'y, Pavel},
title = {On packing of squares into a rectangle},
journal = {Archivum mathematicum},
pages = {75--83},
year = {1996},
volume = {32},
number = {2},
mrnumber = {1407340},
zbl = {0905.52003},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ARM_1996_32_2_a0/}
}
Novotný, Pavel. On packing of squares into a rectangle. Archivum mathematicum, Tome 32 (1996) no. 2, pp. 75-83. http://geodesic.mathdoc.fr/item/ARM_1996_32_2_a0/
[1] Kleitman D., Krieger M.: An optimal bound for two dimensional bin packing. Proc. 16-th Annual Symposium on Foundations of Comp. Sci., Berkeley, 1975, 163–168. IEEE Computer Society, Long Beach, Calif. | MR
[2] Meir A., Moser L.: On packing of squares and cubes. J. Combin Theory 5 (1968), 126–134. | MR
[3] Moon J.W., Moser L.: Some packing and covering theorems. Colloq. Math. 17 (1967),103–110. | MR | Zbl
[4] Moser L.: Poorly formulated unsolved problems of combinatorial geometry. mimeographed.
[5] Moser W.: Research Problems in Discrete Geometry 1981, # 23. | Zbl
[6] Moser W., Pach J.: Research Problems in Discrete Geometry 1986, # 59.
[7] Moser W., Pach J.: Research Problems in Discrete Geometry 1989, # 108.
[8] Novotný P.: A note on packing of squares. Studies of University of Transport and Communications in Žilina, Math.-Phys. series, vol. 10 (1995). | MR