Parameterized approaches to orthogonal compaction
From MaRDI portal
Publication:6169516
DOI10.1007/978-3-031-23101-8_8zbMath1529.68205arXiv2210.05019OpenAlexW4313429528MaRDI QIDQ6169516
Walter Didimo, Alexander Wolff, Siddharth Gupta, Meirav Zehavi, Philipp Kindermann, Giuseppe Liotta
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.05019
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Minimum rectilinear polygons for given angle sequences
- Fixed parameter algorithms for one-sided crossing minimization revisited
- On the parameterized complexity of layered graph drawing
- Upward drawings of triconnected digraphs.
- Algorithms for plane representations of acyclic digraphs
- Turn-regularity and optimal area drawings of orthogonal representations
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Orthogonal planarity testing of bounded treewidth graphs
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Algorithms for Reporting and Counting Geometric Intersections
- Inapproximability of Orthogonal Compaction
- Parameterized Complexity of 1-Planarity
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- Kernelization
- Parameterized Algorithms for Queue Layouts
- Upward Book Embeddings of st-Graphs
- Drawing graphs on few lines and few planes
- Parameterized Algorithms for Book Embedding Problems
- Parameterized Algorithms
- On the complexity of orthogonal compaction
- Drawing graphs. Methods and models
- Parameterized complexity of graph planarity with restricted cyclic orders
- Testing upward planarity of partial 2-trees
- Grid recognition: classical and parameterized computational perspectives
This page was built for publication: Parameterized approaches to orthogonal compaction
