Framework for -completeness of two-dimensional packing problems

Cites Work

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

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)