Orthogonal planarity testing of bounded treewidth graphs
type: Item
instance of: scholarly article
title: Orthogonal planarity testing of bounded treewidth graphs
author: Emilio Di Giacomo
author: Giuseppe Liotta
author: Fabrizio Montecchiani
published in: Journal of Computer and System Sciences
publication date: 2022-01-31T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7466701
zbMATH Keywords: orthogonal planarity
zbMATH Keywords: HV planarity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: graph drawing
zbMATH Keywords: bounded treewidth graphs
MaRDI profile type: Publication
full work available at URL: j.jcss.2021.11.004
OpenAlex ID: W4200514496
cites work: Parameterized Complexity of 1-Planarity
cites work: Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
cites work: Parameterized algorithms for book embedding problems
cites work: A better heuristic for orthogonal graph drawings
cites work: Morphing orthogonal planar graph drawings
cites work: Orthogonal graph drawing with flexibility constraints
cites work: Orthogonal graph drawing with inflexible edges
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: The Fine Details of Fast Dynamic Programming over Tree Decompositions
cites work: Algorithms – ESA 2004
cites work: Q4580103
cites work: Accelerated Bend Minimization
cites work: Drawing database schemas
cites work: Q3154375
cites work: Spirality and Optimal Orthogonal Drawings
cites work: Sketched representations and orthogonal planarity of bounded treewidth graphs
cites work: Q5358292
cites work: Upward Spirality and Upward Planarity Testing
cites work: Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
cites work: Bend-minimum orthogonal drawings in quadratic time
cites work: HV-planarity: algorithms and complexity
cites work: Q4503944
cites work: On the parameterized complexity of layered graph drawing
cites work: Fixed parameter algorithms for one-sided crossing minimization revisited
cites work: A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
cites work: Drawing HV-Restricted Planar Graphs
cites work: Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
cites work: Atomic Embeddability, Clustered Planarity, and Thickenability
cites work: On the computational complexity of upward and rectilinear planarity testing
cites work: Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
cites work: TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
cites work: Treewidth. Computations and approximations
cites work: Q3997942
cites work: Planar graphs: Theory and algorithms
cites work: Q3154374
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Toward a theory of planarity: Hanani-Tutte and planarity variants
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
DOI: 10.1016/J.JCSS.2021.11.004
Recommended article: Sketched representations and orthogonal planarity of bounded treewidth graphs
Recommended article: On the linearity of testing planarity of graphs
Recommended article: Q3785966
Recommended article: Testing Outerplanarity of Bounded Degree Graphs
Recommended article: Testing outerplanarity of bounded degree graphs
Recommended article: Q5417619
Recommended article: Testing Planarity of Partially Embedded Graphs
Recommended article: An algorithm of graph planarity testing and cross minimization
Recommended article: A tight lower bound for vertex planarization on graphs of bounded treewidth
Recommended article: Algorithms for graphs of bounded treewidth via orthogonal range searching
description: scientific article; zbMATH DE number 7466701