We prove that every set of squares with total area 1 can be packed into a rectangle of area at most 2867/2048=1.399… . This improves on the previous best bound of 1.53. Also, our proof yields a linear time algorithm for finding such a packing.

Journal: Computational Geometry: Theory and Applications - COMGEO, vol. 44, no. 8, pp. 456-463, 2011

]]>