A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3160838608
@@ Property / OpenAlex ID: W3160838608 / rank @@
+Normal rank
@@ Property / cites work @@
+Irrelevant vertices for the planar disjoint paths problem
+Normal rank
@@ Property / cites work @@
+Routing with congestion in acyclic digraphs
@@ Property / cites work: Routing with congestion in acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A tight lower bound for Steiner orientation
@@ Property / cites work: A tight lower bound for Steiner orientation / rank @@
+Normal rank
@@ Property / cites work @@
+A tight lower bound for planar Steiner orientation
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
+Normal rank
@@ Property / cites work @@
+Improved approximation for node-disjoint paths in planar graphs
+Normal rank
@@ Property / cites work @@
+New hardness results for routing on disjoint paths
+Normal rank
@@ Property / cites work @@
+Almost polynomial hardness of node-disjoint paths in grids
+Normal rank
@@ Property / cites work @@
+Q5002709
@@ Property / cites work: Q5002709 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential time parameterized algorithm for planar disjoint paths
+Normal rank
@@ Property / cites work @@
+The limited blessing of low dimensionality
@@ Property / cites work: The limited blessing of low dimensionality / 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 @@
+Finding <i>k</i> Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Finding k Partially Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+NP-completeness of some edge-disjoint paths problems
+Normal rank