scientific article; zbMATH DE number 7651192
From MaRDI portal
Publication:5874523
Cites work
- 2-layer right angle crossing drawings
- Area requirement of graph drawings with few crossings per edge
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Crossing-Free Subgraphs
- Drawing graphs with right angle crossings
- Empirical evaluation of aesthetics-based graph layout
- Graphs drawn with few crossings per edge
- Graphs that admit right angle crossing drawings
- Large angle crossing drawings of planar graphs in subquadratic area
- Notes on large angle crossing graphs
- On RAC drawings of graphs with one bend per edge
- On the perspectives opened by right angle crossing drawings
- RAC drawings in subcubic area
- Right angle crossing graphs and 1-planarity
- Testing Full Outer-2-planarity in Linear Time
- The straight-line RAC drawing problem is NP-hard
- \(\mathsf{NIC}\)-planar graphs
Cited in
(6)- On RAC drawings of graphs with two bends per edge
- On RAC drawings of graphs with two bends per edge
- RAC-Drawability is ∃ℝ-complete and Related Results
- Fixed-parameter algorithms for computing RAC drawings of graphs
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874523)
