Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
From MaRDI portal
Publication:6636993
DOI10.7155/jgaa.v28i2.2995MaRDI QIDQ6636993
Robert Ganian, Cornelius Brand, Florian Schager, Sebastian Röder
Publication date: 12 November 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- 2-layer right angle crossing drawings
- Improved upper bounds for vertex cover
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- Graph minors. III. Planar tree-width
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- New algorithms for maximum disjoint paths based on tree-likeness
- Computing crossing numbers in quadratic time
- Linear time solvable optimization problems on graphs of bounded clique-width
- Exact crossing number parameterized by vertex cover
- On RAC drawings of 1-planar graphs
- The power of cut-based parameters for computing edge-disjoint paths
- An Alternative Method to Crossing Minimization on Hierarchical Graphs
- Graph Theory
- The Straight-Line RAC Drawing Problem is NP-Hard
- Crossing Number is NP-Complete
- Algorithmic Meta-theorems for Restrictions of Treewidth
- Parameterized Complexity of 1-Planarity
- Right Angle Crossing Drawings of Graphs
- Parameterized Algorithms for Queue Layouts
- Parameterized Algorithms for Book Embedding Problems
- Parameterized Algorithms
- On the Perspectives Opened by Right Angle Crossing Drawings
- On RAC drawings of graphs with one bend per edge
- Algorithms in real algebraic geometry
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- RAC drawings of graphs with low degree
This page was built for publication: Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
