Packing unit squares in a rectangle.

Nagamochi, Hiroshi

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Packing unit squares in a rectangle.”

Efficient packing of unit squares in a square.

Kearney, Michael J., Shiu, Peter (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On packing of squares into a rectangle

Pavel Novotný (1996)

Archivum Mathematicum

Similarity:

On-line Packing Squares into n Unit Squares

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.

Packing 10 or 11 unit squares in a square.

Stromquist, Walter (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Tiling parity results and the holey square solution.

Tenner, Bridget Eileen (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On biembeddings of Latin squares.

Grannell, M.J., Griggs, T.S., Knor, M. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Translative packing of a square with sequences of 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'.

Tiling proofs of some formulas for the Pell numbers of odd index.

Shattuck, Mark (2009)

Integers

Similarity: