[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 0423195

[2] Meir A., Moser L.: On packing of squares and cubes. J. Combin Theory 5 (1968), 126–134. MR 0229142

[3] Moon J.W., Moser L.: Some packing and covering theorems. Colloq. Math. 17 (1967),103–110. MR 0215197 | Zbl 0152.39502

[4] Moser L.: Poorly formulated unsolved problems of combinatorial geometry. mimeographed.

[5] Moser W.: Research Problems in Discrete Geometry 1981, # 23. Zbl 0528.52001

[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 1437834