scientific article; zbMATH DE number 7651192
From MaRDI portal
Publication:5874523
DOI10.4230/LIPICS.ESA.2020.53MaRDI QIDQ5874523FDOQ5874523
Authors: Henry Förster, Michael Kaufmann 
Publication date: 7 February 2023
Title of this publication is not available (Why is that?)
Cites Work
- Graphs drawn with few crossings per edge
- Crossing-Free Subgraphs
- Right angle crossing graphs and 1-planarity
- Empirical evaluation of aesthetics-based graph layout
- Area requirement of graph drawings with few crossings per edge
- 2-layer right angle crossing drawings
- Drawing graphs with right angle crossings
- Notes on large angle crossing graphs
- Graphs that admit right angle crossing drawings
- On the perspectives opened by right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- RAC drawings in subcubic area
- The straight-line RAC drawing problem is NP-hard
- \(\mathsf{NIC}\)-planar graphs
- Testing Full Outer-2-planarity in Linear Time
- Large angle crossing drawings of planar graphs in subquadratic area
- On RAC drawings of graphs with one bend per edge
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)
