On the parameterized complexity of bend-minimum orthogonal planarity
From MaRDI portal
Publication:6623586
DOI10.1007/s00453-024-01260-1MaRDI QIDQ6623586
Fabrizio Montecchiani, Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Giacomo Ortali
Publication date: 24 October 2024
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A better heuristic for orthogonal graph drawings
- HV-planarity: algorithms and complexity
- Orthogonal planarity testing of bounded treewidth graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Upward Spirality and Upward Planarity Testing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Dividing a Graph into Triconnected Components
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Accelerated Bend Minimization
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Parameterized algorithms for upward planarity
- On the parameterized complexity of bend-minimum orthogonal planarity
- Upward and orthogonal planarity are W[1-hard parameterized by treewidth]
This page was built for publication: On the parameterized complexity of bend-minimum orthogonal planarity
