Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.7155/jgaa.00479
+Normal rank
@@ Property / OpenAlex ID @@
+W3104326931
@@ Property / OpenAlex ID: W3104326931 / rank @@
+Normal rank
@@ Property / cites work @@
+The 2-page crossing number of \(K_{n}\)
@@ Property / cites work: The 2-page crossing number of \(K_{n}\) / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Nonplanar Graphs
@@ Property / cites work: A Separator Theorem for Nonplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q3283487
@@ Property / cites work: Q3283487 / rank @@
+Normal rank
@@ 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 @@
+Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
+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 @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4858092
@@ Property / cites work: Q4858092 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Outerplanarity
@@ Property / cites work: Beyond Outerplanarity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545841
@@ Property / cites work: Q5545841 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Q4001429
@@ Property / cites work: Q4001429 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Book drawings of complete bipartite graphs
@@ Property / cites work: Book drawings of complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411278
@@ Property / cites work: Q4411278 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of layered graph drawing
+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 @@
+Q4298571
@@ Property / cites work: Q4298571 / rank @@
+Normal rank
@@ Property / cites work @@
+On the planar split thickness of graphs
@@ Property / cites work: On the planar split thickness of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+One- and two-page crossing numbers for some types of graphs
+Normal rank
@@ Property / cites work @@
+Q4081276
@@ Property / cites work: Q4081276 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental Evaluation of Book Drawing Algorithms
+Normal rank
@@ Property / cites work @@
+Q5111885
@@ Property / cites work: Q5111885 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of simple complete topological graphs
@@ Property / cites work: Enumeration of simple complete topological graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithms to recognize outerplanar and maximal outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Crossing Numbers and Parameterized Complexity
@@ Property / cites work: Crossing Numbers and Parameterized Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5788382
@@ Property / cites work: Q5788382 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785974
@@ Property / cites work: Q3785974 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128756517
@@ Property / Wikidata QID: Q128756517 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4611385