Efficient packing of unit squares in a square.
Kearney, Michael J., Shiu, Peter (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kearney, Michael J., Shiu, Peter (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nagamochi, Hiroshi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janusz Januszewski (2010)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.
Janusz Januszewski (2010)
Colloquium Mathematicae
Similarity:
Let S be a square and let S' be a square of unit area with a diagonal parallel to a side of S. Any (finite or infinite) sequence of homothetic copies of S whose total area does not exceed 4/9 can be packed translatively into S'.
Pavel Novotný (1996)
Archivum Mathematicum
Similarity:
Friedman, Erich (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reid, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tenner, Bridget Eileen (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Aaron Melman (2013)
The Teaching of Mathematics
Similarity:
Marshall, T.H., Martin, G.J. (2005)
Annales Academiae Scientiarum Fennicae. Mathematica
Similarity:
Shen, Yujin, Tolosa, Juan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sanchez, Diogo Merguizo, Yokoyama, Tadashi, de Oliveira Brasil, Pedro Ivo, Cordeiro, Ricardo Reis (2009)
Mathematical Problems in Engineering
Similarity: