Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502): Difference between revisions

@@ Property / cites work @@
+Counting linear extensions
@@ Property / cites work: Counting linear extensions / rank @@
+Normal rank
@@ Property / cites work @@
+Jump number of dags having Dilworth number 2
@@ Property / cites work: Jump number of dags having Dilworth number 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4200070
@@ Property / cites work: Q4200070 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing setups in ordered sets of fixed width
@@ Property / cites work: Minimizing setups in ordered sets of fixed width / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Setups for Cycle-Free Ordered Sets
@@ Property / cites work: Minimizing Setups for Cycle-Free Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for plane representations of acyclic digraphs
+Normal rank
@@ Property / cites work @@
+Curve-constrained drawings of planar graphs
@@ Property / cites work: Curve-constrained drawings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Upward Topological Book Embeddings of Upward Planar Digraphs
+Normal rank
@@ Property / cites work @@
+The Two-Triangle Case of the Acquaintance Graph
@@ Property / cites work: The Two-Triangle Case of the Acquaintance Graph / rank @@
+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 @@
+Fundamentals of planar ordered sets
@@ Property / cites work: Fundamentals of planar ordered sets / rank @@
+Normal rank
@@ Property / cites work @@
+Tackling the jump number of interval orders
@@ Property / cites work: Tackling the jump number of interval orders / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
+Normal rank
@@ Property / cites work @@
+Ordered sets, pagenumbers and planarity
@@ Property / cites work: Ordered sets, pagenumbers and planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Linear Extensions Fast
@@ Property / cites work: Generating Linear Extensions Fast / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Linear Extensions by Interchanging Chains
@@ Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank @@
+Normal rank
@@ Property / cites work @@
+On minimizing jumps for ordered sets
@@ Property / cites work: On minimizing jumps for ordered sets / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
+Normal rank
@@ Property / cites work @@
+Dynamic maintenance of planar digraphs, with applications
+Normal rank
@@ Property / cites work @@
+A unified approach to visibility representations of planar graphs
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank