scientific article; zbMATH DE number 7651192
From MaRDI portal
Publication:5874523
DOI10.4230/LIPIcs.ESA.2020.53MaRDI QIDQ5874523
Michael Kaufmann, Henry Förster
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ RAC-Drawability is ∃ℝ-complete and Related Results
Cites Work
- Recognizing and drawing IC-planar graphs
- Graphs that admit right angle crossing drawings
- 2-layer right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- RAC drawings in subcubic area
- Graphs drawn with few crossings per edge
- Empirical evaluation of aesthetics-based graph layout
- Right angle crossing graphs and 1-planarity
- Area requirement of graph drawings with few crossings per edge
- On RAC drawings of 1-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- Testing Full Outer-2-planarity in Linear Time
- The Straight-Line RAC Drawing Problem is NP-Hard
- Crossing-Free Subgraphs
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
- Notes on large angle crossing graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
- On RAC drawings of graphs with one bend per edge
This page was built for publication:
