Drawn tree decomposition: new approach for graph drawing problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- A partial k-arboretum of graphs with bounded treewidth
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Algorithms – ESA 2004
- Bend-minimum orthogonal drawings in quadratic time
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Complexity of some geometric and topological problems
- Computing crossing numbers in quadratic time
- Crossing Number is NP-Complete
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing number is hard for cubic graphs
- Crossing numbers of graphs with rotation systems
- Drawn tree decomposition: new approach for graph drawing problems
- Enumerating grid layouts of graphs
- Exact crossing number parameterized by vertex cover
- Finding small simple cycle separators for 2-connected planar graphs
- Grid recognition: classical and parameterized computational perspectives
- How to fit a tree in a box
- Milling a graph with turn costs: a parameterized complexity perspective
- Minimizing the Area for Planar Straight-Line Grid Drawings
- Minimum rectilinear polygons for given angle sequences
- On Area-Optimal 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 complexity of orthogonal compaction
- On the computational complexity of upward and rectilinear planarity testing
- On upward drawings of trees on a given grid
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Orthogonal planarity testing of bounded treewidth graphs
- Parameterized algorithms
- Parameterized algorithms for book embedding problems
- Parameterized analysis and crossing minimization problems
- Parameterized approaches to orthogonal compaction
- Parameterized complexity of 1-planarity
- Parameterized complexity of graph planarity with restricted cyclic orders
- Planar Separators
- Some provably hard crossing number problems
- Spirality and Optimal Orthogonal Drawings
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- The complexity of minimizing wire lengths in VLSI layouts
- The point-set embeddability problem for plane graphs
- Turn-regularity and optimal area drawings of orthogonal representations
- Unit-length embedding of binary trees on a square grid
- Unit-length rectangular drawings of graphs
This page was built for publication: Drawn tree decomposition: new approach for graph drawing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926186)
