RAC-Drawability is ∃ℝ-complete and Related Results
From MaRDI portal
Publication:6181953
DOI10.7155/jgaa.00646zbMath1529.05117OpenAlexW4389318424MaRDI QIDQ6181953
Publication date: 20 December 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00646
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Graphs that admit right angle crossing drawings
- Recognition and complexity of point visibility graphs
- Fixed points, Nash equilibria, and the existential theory of the reals
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- Solving systems of polynomial inequalities in subexponential time
- The computational complexity of some problems of linear algebra
- Mnëv's universality theorem revisited
- On RAC drawings of 1-planar graphs
- The Crossing-Angle Resolution in Graph Drawing
- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
- On the Complexity of the Planar Slope Number Problem
- The Straight-Line RAC Drawing Problem is NP-Hard
- The Intrinsic Spread of a Configuration in R d
- Characterizing integers among rational numbers with a universal-existential formula
- Right Angle Crossing Drawings of Graphs
- The Art Gallery Problem is ∃ℝ-complete
- Complexity of Geometric k-Planarity for Fixed k
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- Notes on large angle crossing graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
- On RAC drawings of graphs with one bend per edge
- The Complexity of Angular Resolution
