On packing of squares into a rectangle

Pavel Novotný

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

Displaying similar documents to “On packing of squares into a rectangle”

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.

Efficient packing of unit squares in a square.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On squares of squares II

Andrew Bremner (2001)

Acta Arithmetica

Similarity:

On the computer algebra implementation of the least squares method on the nonnegative orthant.

Ikramov, Kh.D., Matin Far, M. (2004)

Zapiski Nauchnykh Seminarov POMI

Similarity:

On the Reconstruction of Latin Squares

Ratko Tošić (1980)

Publications de l'Institut Mathématique

Similarity:

Determinants of Latin squares of order 8.

Ford, David, Johnson, Kenneth W. (1996)

Experimental Mathematics

Similarity:

Visual Magic Squares and Group Orbits I

John Pais, Richard Singer (2004)

Visual Mathematics

Similarity:

On squares of differentiable functions

M. Kuczma (1969)

Annales Polonici Mathematici

Similarity:

The disjoint $m$ -flower intersection problem for Latin squares.

Lefevre, James G., McCourt, Thomas A. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Packing unit squares in a rectangle.

Nagamochi, Hiroshi (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity: