Framework for -completeness of two-dimensional packing problems

Cites work

scientific article; zbMATH DE number 17663 (Why is no real title available?)
scientific article; zbMATH DE number 1256725 (Why is no real title available?)
A proof of the Kepler conjecture
A rational quartic Bézier representation for conics
A review of the application of meta-heuristic algorithms to 2D strip packing problems
A tutorial in irregular shape packing problems
Algorithms in real algebraic geometry
Approximation and online algorithms for multidimensional bin packing: a survey
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
Complexity of some geometric and topological problems
Computational aspects of packing problems
Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
Efficient packings of unit squares in a large square
Fixed points, Nash equilibria, and the existential theory of the reals
Generalized planar matching
Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
Improved dense packings of congruent squares in a square
Integer realizations of disk and segment graphs
Intersection graphs of rays and grounded segments
Irregular packing problems: a review of mathematical models
Multiple translational containment. I: An approximate algorithm
Multiple translational containment. II: Exact algorithms
On classifying continuous constraint satisfaction problems
On packing squares with equal squares
On the computational complexity of decision problems about multi-player Nash equilibria
Optimal packing and covering in the plane are NP-complete
Planar graphs and face areas. Area-universality
Realizability of graphs and linkages
Realization spaces of 4-polytopes are universal
Recognition and complexity of point visibility graphs
Rotational polygon containment and minimum enclosure using only robust 2D constructions
Segment representations with small resolution
Some provably hard crossing number problems
Sphere and dot product representations of graphs
The Art Gallery Problem is ∃ℝ-complete
The complexity of drawing a graph in a polygonal region
The complexity of positive semidefinite matrix factorization
The geometry of nesting problems: a tutorial
The sphere packing problem in dimension 8
Who needs crossings? Hardness of plane graph rigidity
Über die dichteste Kugellagerung
Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene. Definitionen und Theoreme.

This page was built for publication: Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566472)