Translative packing of a square with sequences of squares

Janusz Januszewski

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

Displaying similar documents to “Translative packing of a square with sequences of squares”

Packing unit squares in squares: A survey and new results.

Friedman, Erich (1998)

The Electronic Journal of Combinatorics [electronic only]

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.

Universal container for packing rectangles

Janusz Januszewski (2002)

Colloquium Mathematicae

Similarity:

The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.

On-line packing sequences of segments, cubes and boxes.

Lassak, Marek (1997)

Beiträge zur Algebra und Geometrie

Similarity:

Efficient packing of unit squares in a square.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The densest packing of 12 congruent circles in a circle.

Fodor, Ferenc (2000)

Beiträge zur Algebra und Geometrie

Similarity:

Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond.

Graham, R.L., Lubachevsky, B.D. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Repeated patterns of dense packings of equal disks in a square.

Graham, R.L., Lubachevski, B.D. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Improving dense packings of equal disks in a square.

Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.

Mukhacheva, È.A., Mukhacheva, A.S. (2004)

Journal of Mathematical Sciences (New York)

Similarity:

Packing Parameters in Graphs

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...

Packing of non-blocking four-dimensional cubes into the unit cube

Janusz Januszewski, Łukasz Zielonka (2024)

Archivum Mathematicum

Similarity:

Any collection of non-blocking four-dimensional cubes, whose total volume does not exceed 17/81, can be packed into the unit four-dimensional cube. This bound is tight for the parallel packing.

What is the minimum length of a non-extendable lace?

Kemnitz, Arnfried, Soltan, Valeriu (1999)

Beiträge zur Algebra und Geometrie

Similarity: