Cited in
(57)- Translative packing of a convex body by sequences of its positive homothetic copies
- An algorithm for packing squares
- A note on perfect packing of squares and cubes
- Two packing problems
- Online removable square packing
- Approximation algorithms for orthogonal packing problems for hypercubes
- Filling the plane with squares of harmonic areas
- On packings of squares and rectangles
- Optimal packing of similar triangles
- Online packing of \(d\)-dimensional boxes into the unit cube
- Covering and packing properties of bounded sequences of convex sets
- Packing of non-blocking four-dimensional cubes into the unit cube.
- Packing of non-blocking cubes into the unit cube
- Approximation and online algorithms for multidimensional bin packing: a survey
- Dynamic multi-dimensional bin packing
- On packing unequal rectangles in the unit square
- Translative covering by homothetic copies
- Packing a tetrahedron by similar tetrahedra
- Polynomial-time approximation schemes for circle and other packing problems
- An approximation algorithm for square packing.
- Two-dimensional packing with conflicts
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions
- Packing, covering and tiling in two-dimensional spaces
- Perfect square packings
- Absolute approximation ratios for packing rectangles into bins
- Selfish square packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Packing a triangle by equilateral triangles of harmonic sidelengths
- Two dimensional strip packing with unloading constraints
- Covering a set with homothets of a convex body
- Cube packing.
- scientific article; zbMATH DE number 7047830 (Why is no real title available?)
- Perfect packing of \(d\)-cubes
- Perfect packing by convex and concave polygons
- Packing Rectangles into 2OPT Bins Using Rotations
- Relations between capacity utilization, minimal bin size and bin number
- Packing batches of cubes into a single bin
- A generalization of a theorem of Kleitman and Krieger
- One-space bounded algorithms for two-dimensional bin packing
- Problems, problems, problems
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- Rectangle packing with additional restrictions
- On packing of rectangles in a rectangle
- Multidimensional cube packing
- Perfectly packing a cube by cubes of nearly harmonic sidelength
- Tiling the unit square with squares and rectangles
- Compactness theorems for geometric packings
- Techniques and results on approximation algorithms for packing circles
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- Two-dimensional strip packing with unloading constraints
- Packing squares into a rectangle with a relatively small area
- Perfectly packing an equilateral triangle by equilateral triangles of sidelengths \(n^{-1/2-\epsilon }\)
- Packing of odd squares revisited
- Prices of anarchy of selfish 2D bin packing games
- On packing squares into a rectangle
- Packing isosceles right triangles of legs of harmonic lengths
- Bounds on soft rectangle packing ratios
This page was built for publication: On packing of squares and cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550367)
