Fixed-parameter tractability for book drawing with bounded number of crossings per edge
From MaRDI portal
Publication:2151389
DOI10.1007/978-3-030-93176-6_38zbMath1502.68239OpenAlexW4206461660MaRDI QIDQ2151389
Yixuan Li, Jingui Huang, Yunlong Liu
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_38
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- On the page number of RNA secondary structures with pseudoknots
- Improved upper bounds for vertex cover
- Three-page approach to knot theory. Encoding and local moves
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- 1-page and 2-page drawings with bounded number of crossings per edge
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
- Exact crossing number parameterized by vertex cover
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- On 3D visibility representations of graphs with few crossings per edge
- Area requirement of graph drawings with few crossings per edge
- Algorithms for graphs embeddable with few crossings per edge
- Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Parameterized Complexity of 1-Planarity
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- Experimental Evaluation of Book Drawing Algorithms
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Parameterized Algorithms for Queue Layouts
- Parameterized Algorithms for Book Embedding Problems
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Fixed-parameter tractability for book drawing with bounded number of crossings per edge
