On the upward book thickness problem: combinatorial and complexity results (Q5925712): Difference between revisions

@@ Property / cites work @@
+Computing straight-line 3D grid drawings of graphs in linear volume
+Normal rank
@@ Property / cites work @@
+Layout of Graphs with Bounded Tree-Width
@@ Property / cites work: Layout of Graphs with Bounded Tree-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Using Networks of Queues and Stacks
@@ Property / cites work: Sorting Using Networks of Queues and Stacks / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Comparing Queues and Stacks As Machines for Laying Out Graphs
+Normal rank
@@ Property / cites work @@
+Stack and Queue Layouts of Posets
@@ Property / cites work: Stack and Queue Layouts of Posets / rank @@
+Normal rank
@@ Property / cites work @@
+Stack and Queue Layouts of Directed Acyclic Graphs: Part II
+Normal rank
@@ Property / cites work @@
+Stack and Queue Layouts of Directed Acyclic Graphs: Part I
+Normal rank
@@ Property / cites work @@
+Ordered sets, pagenumbers and planarity
@@ Property / cites work: Ordered sets, pagenumbers and planarity / 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 @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank
@@ Property / cites work @@
+Four pages are indeed necessary for planar graphs
@@ Property / cites work: Four pages are indeed necessary for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs that need four pages
@@ Property / cites work: Planar graphs that need four pages / rank @@
+Normal rank
@@ Property / cites work @@
+Genus g Graphs Have Pagenumber O(√g)
@@ Property / cites work: Genus g Graphs Have Pagenumber O(√g) / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of 1-planar graphs is constant
@@ Property / cites work: The book thickness of 1-planar graphs is constant / rank @@
+Normal rank
@@ Property / cites work @@
+Book embeddings of nonplanar graphs with small faces in few pages
+Normal rank
@@ Property / cites work @@
+Graph treewidth and geometric thickness parameters
+Normal rank
@@ Property / cites work @@
+Advancements on SEFE and partitioned book embedding problems
+Normal rank
@@ Property / cites work @@
+Atomic Embeddability, Clustered Planarity, and Thickenability
+Normal rank
@@ Property / cites work @@
+Upward Planarity Testing in Practice
@@ Property / cites work: Upward Planarity Testing in Practice / rank @@
+Normal rank
@@ Property / cites work @@
+Extending upward planar graph drawings
@@ Property / cites work: Extending upward planar graph drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Upward planar morphs
@@ Property / cites work: Upward planar morphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for plane representations of acyclic digraphs
+Normal rank
@@ Property / cites work @@
+Upward Spirality and Upward Planarity Testing
@@ Property / cites work: Upward Spirality and Upward Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of upward planar orientations of maximal planar graphs
+Normal rank
@@ Property / cites work @@
+Upward Book Embeddings of st-Graphs
@@ Property / cites work: Upward Book Embeddings of st-Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Book embeddability of series-parallel digraphs
@@ Property / cites work: Book embeddability of series-parallel digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
+Normal rank
@@ Property / cites work @@
+On the Page Number of Upward Planar Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Circle graphs are quadratically χ‐bounded
@@ Property / cites work: Circle graphs are quadratically χ‐bounded / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On miniaturized problems in parameterized complexity theory
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Book Embedding Problems
+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 @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank