Parameterized complexity of graph planarity with restricted cyclic orders
From MaRDI portal
Publication:6039436
DOI10.1007/978-3-031-15914-5_28MaRDI QIDQ6039436
Giuseppe Liotta, Alessandra Tappini, Ignaz Rutter
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Related Items (3)
Grid recognition: classical and parameterized computational perspectives ⋮ Parameterized approaches to orthogonal compaction ⋮ Parameterized complexity of graph planarity with restricted cyclic orders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new perspective on clustered planarity as a combinatorial embedding problem
- On the parameterized complexity of layered graph drawing
- Graph minors. X: Obstructions to tree-decomposition
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- HV-planarity: algorithms and complexity
- Upward planarity testing
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Simultaneous FPQ-ordering and hybrid planarity testing
- Orthogonal planarity testing of bounded treewidth graphs
- A user study on hybrid graph visualizations
- Quasi-upward planar drawings with minimum curve complexity
- ChordLink: a new hybrid visualization model
- Exact crossing number parameterized by vertex cover
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
- NodeTrix planarity testing with small clusters
- A fixed-parameter approach to 2-layer planarization
- \((k,p)\)-planarity: a relaxation of hybrid planarity
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Computing NodeTrix Representations of Clustered Graphs
- Upward Spirality and Upward Planarity Testing
- The NP-Completeness of Edge-Coloring
- On-Line Planarity Testing
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Parameterized Algorithms for Book Embedding Problems
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Intersection-Link Representations of Graphs
- Parameterized Algorithms
- Planarity for clustered graphs
This page was built for publication: Parameterized complexity of graph planarity with restricted cyclic orders
