Pages that link to "Item:Q3143754"
From MaRDI portal
The following pages link to The Straight-Line RAC Drawing Problem is NP-Hard (Q3143754):
Displaying 31 items.
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- RAC-drawability is \(\exists \mathbb{R} \)-complete (Q2151432) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- Heuristics for the Maximum 2-layer RAC Subgraph Problem (Q2889915) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- (Q3974991) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
- The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
- (Q5091019) (← links)
- (Q5111244) (← links)
- (Q5874523) (← links)
- On RAC drawings of graphs with one bend per edge (Q5915940) (← links)
- On RAC drawings of graphs with one bend per edge (Q5918835) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)
- RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
- On RAC drawings of graphs with two bends per edge (Q6616241) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
