On the parameterized complexity of bend-minimum orthogonal planarity
type: Item
instance of: scholarly article
title: On the parameterized complexity of bend-minimum orthogonal planarity
author: Emilio Di Giacomo
author: Walter Didimo
author: Giuseppe Liotta
author: Fabrizio Montecchiani
author: Giacomo Ortali
published in: Algorithmica
publication date: 2024-10-24T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7931152
zbMATH Keywords: orthogonal drawings
zbMATH Keywords: bend minimization
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT algorithms
MaRDI profile type: Publication
cites work: A better heuristic for orthogonal graph drawings
cites work: Parameterized algorithms for upward planarity
cites work: Accelerated Bend Minimization
cites work: Q3154375
cites work: Spirality and Optimal Orthogonal Drawings
cites work: On the parameterized complexity of bend-minimum orthogonal planarity
cites work: Orthogonal planarity testing of bounded treewidth graphs
cites work: Upward Spirality and Upward Planarity Testing
cites work: Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
cites work: Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
cites work: HV-planarity: algorithms and complexity
cites work: Planar rectilinear drawings of outerplanar graphs in linear time
cites work: On the computational complexity of upward and rectilinear planarity testing
cites work: Q4472293
cites work: Dividing a Graph into Triconnected Components
cites work: Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
cites work: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
DOI: 10.1007/S00453-024-01260-1
description: scientific article; zbMATH DE number 7931152