Orthogonal planarity testing of bounded treewidth graphs
From MaRDI portal
Publication:2071827
DOI10.1016/J.JCSS.2021.11.004OpenAlexW4200514496MaRDI QIDQ2071827FDOQ2071827
Authors: Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani 
Publication date: 31 January 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.11.004
Recommendations
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- On the linearity of testing planarity of graphs
- scientific article; zbMATH DE number 4049078
- Testing outerplanarity of bounded degree graphs
- Testing outerplanarity of bounded degree graphs
- Testing planarity of partially embedded graphs
- Testing Planarity of Partially Embedded Graphs
- An algorithm of graph planarity testing and cross minimization
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Algorithms for graphs of bounded treewidth via orthogonal range searching
Cites Work
- Title not available (Why is that?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Graph minors. II. Algorithmic aspects of tree-width
- Treewidth. Computations and approximations
- On the parameterized complexity of layered graph drawing
- Title not available (Why is that?)
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- A better heuristic for orthogonal graph drawings
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Title not available (Why is that?)
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- On the computational complexity of upward and rectilinear planarity testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar graphs: Theory and algorithms
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- Spirality and Optimal Orthogonal Drawings
- Fixed parameter algorithms for one-sided crossing minimization revisited
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Upward spirality and upward planarity testing
- Atomic embeddability, clustered planarity, and thickenability
- Accelerated bend minimization
- HV-planarity: algorithms and complexity
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Algorithms – ESA 2004
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- On bend-minimized orthogonal drawings of planar 3-graphs
- Drawing database schemas
- Drawing HV-Restricted Planar Graphs
- Bend-minimum orthogonal drawings in quadratic time
- Parameterized complexity of 1-planarity
- Parameterized algorithms for book embedding problems
- Morphing orthogonal planar graph drawings
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Cited In (15)
- Rectilinear Planarity of Partial 2-Trees
- Title not available (Why is that?)
- Parameterized algorithms for queue layouts
- Recognizing map graphs of bounded treewidth
- On the parameterized complexity of bend-minimum orthogonal planarity
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- On the parameterized complexity of bend-minimum orthogonal planarity
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Parameterized approaches to orthogonal compaction
- Testing outerplanarity of bounded degree graphs
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
- Grid recognition: classical and parameterized computational perspectives
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
This page was built for publication: Orthogonal planarity testing of bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071827)
