Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete

Documenti analoghi

• Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
  di: Abrahamsen, Mikkel, et al.
  Pubblicazione: (2020)
• A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
  di: Hengeveld, Simon, et al.
  Pubblicazione: (2020)
• On Classifying Continuous Constraint Satisfaction Problems
  di: Miltzow, Tillmann, et al.
  Pubblicazione: (2021)
• Slant/Gokigen Naname is NP-complete, and Some Variations are in P
  di: Lynch, Jayson, et al.
  Pubblicazione: (2025)
• Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
  di: Yang, Puhan, et al.
  Pubblicazione: (2025)