On the parameterized complexity of bend-minimum orthogonal planarity

DOI10.1007/S00453-024-01260-1MaRDI QIDQ6623586zbMATH OpenFDO

Authors Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali

Publication date 24 October 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01260-1

zbMATH Keywords

parameterized complexityFPT algorithmsbend minimizationorthogonal drawings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• A better heuristic for orthogonal graph drawings
• Accelerated bend minimization
• Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
• Dividing a Graph into Triconnected Components
• HV-planarity: algorithms and complexity
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the computational complexity of upward and rectilinear planarity testing
• On the parameterized complexity of bend-minimum orthogonal planarity
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Orthogonal planarity testing of bounded treewidth graphs
• Parameterized algorithms for upward planarity
• Planar rectilinear drawings of outerplanar graphs in linear time
• Spirality and Optimal Orthogonal Drawings
• Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
• Upward spirality and upward planarity testing

This page was built for publication: On the parameterized complexity of bend-minimum orthogonal planarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623586)