A tight subexponential-time algorithm for two-page book embedding
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- A left-first search algorithm for planar graphs
- A single-exponential time 2-approximation algorithm for treewidth
- A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs
- A tight subexponential-time algorithm for two-page book embedding
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
- Covering and coloring problems for relatives of intervals
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding Outerplanar Graphs in Small Books
- Embedding planar graphs in four pages
- Fast Hamiltonicity checking via bases of perfect matchings
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Fundamentals of parameterized complexity
- Genus g Graphs Have Pagenumber O(√g)
- Graph minors. X: Obstructions to tree-decomposition
- Graph treewidth and geometric thickness parameters
- Implementing a partitioned 2-page book embedding testing algorithm
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Inserting an edge into a planar graph
- On the complexity of embedding planar graphs to minimize certain distance measures
- Optimal enclosing regions in planar graphs
- Parameterized algorithms
- Parameterized algorithms for book embedding problems
- Quickly excluding a planar graph
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Sparsity. Graphs, structures, and algorithms
- The 2-page crossing number of \(K_{n}\)
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The book thickness of a graph
- The complexity landscape of decompositional parameters for ILP
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The pagenumber of k-trees is O(k)
- The pagenumber of toroidal graphs is at most seven
- Two-layer planarization parameterized by feedback edge set
- Two-page book embeddings of 4-planar graphs
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: A tight subexponential-time algorithm for two-page book embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875130)
