Parameterized algorithms for book embedding problems (Q2206870): Difference between revisions

@@ Property / cites work @@
+Parameterized Complexity of 1-Planarity
@@ Property / cites work: Parameterized Complexity of 1-Planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Two-page book embeddings of 4-planar graphs
@@ Property / cites work: Two-page book embeddings of 4-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+-page and 2-page drawings with bounded number of crossings per edge
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4667610
@@ Property / cites work: Q4667610 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph treewidth and geometric thickness parameters
+Normal rank
@@ Property / cites work @@
+On the book thickness of $k$-trees
@@ Property / cites work: On the book thickness of $k$-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Q3455032
@@ Property / cites work: Q3455032 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity landscape of decompositional parameters for ILP
+Normal rank
@@ Property / cites work @@
+The pagenumber of \(k\)-trees is \(O(k)\)
@@ Property / cites work: The pagenumber of \(k\)-trees is \(O(k)\) / rank @@
+Normal rank
@@ Property / cites work @@
+The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
+Normal rank
@@ Property / cites work @@
+RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
+Normal rank
@@ Property / cites work @@
+Q4081276
@@ Property / cites work: Q4081276 / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+SAT-encodings for special treewidth and pathwidth
@@ Property / cites work: SAT-encodings for special treewidth and pathwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Linear ordering based MIP formulations for the vertex separation or pathwidth problem
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+The complexity of colouring circle graphs
@@ Property / cites work: The complexity of colouring circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank