Framework for -completeness of two-dimensional packing problems
From MaRDI portal
Publication:6566472
DOI10.46298/THEORETICS.24.11MaRDI QIDQ6566472FDOQ6566472
Tillmann Miltzow, Nadja Seiferth, Mikkel Abrahamsen
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- 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
- 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)
