Orthogonal planarity testing of bounded treewidth graphs
From MaRDI portal
Publication:2071827
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
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A better heuristic for orthogonal graph drawings
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- Accelerated bend minimization
- Algorithms – ESA 2004
- Atomic embeddability, clustered planarity, and thickenability
- Bend-minimum orthogonal drawings in quadratic time
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Drawing HV-Restricted Planar Graphs
- Drawing database schemas
- Fixed parameter algorithms for one-sided crossing minimization revisited
- Graph minors. II. Algorithmic aspects of tree-width
- HV-planarity: algorithms and complexity
- Morphing orthogonal planar graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On bend-minimized orthogonal drawings of planar 3-graphs
- On the computational complexity of upward and rectilinear planarity testing
- On the parameterized complexity of layered graph drawing
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- Parameterized algorithms for book embedding problems
- Parameterized complexity of 1-planarity
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Planar graphs: Theory and algorithms
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Spirality and Optimal Orthogonal Drawings
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Treewidth. Computations and approximations
- Upward spirality and upward planarity testing
Cited in
(15)- Rectilinear Planarity of Partial 2-Trees
- scientific article; zbMATH DE number 6863595 (Why is no real title available?)
- 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
- Testing outerplanarity of bounded degree graphs
- Parameterized approaches to orthogonal compaction
- Parameterized complexity of graph planarity with restricted cyclic orders
- 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
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)
