Q5090955 (Q5090955): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planarity testing
@@ Property / cites work: The complexity of planarity testing / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Two Disjoint Paths in Polynomial Time
@@ Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
+Normal rank
@@ Property / cites work @@
+Resolution of Hartmanis' conjecture for NL-hard sparse sets
+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 @@
+Fast Parallel Matrix Inversion Algorithms
@@ Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity Testing Revisited
@@ Property / cites work: Planarity Testing Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest vertex-disjoint two-face paths in planar graphs
+Normal rank
@@ Property / cites work @@
+The disjoint shortest paths problem
@@ Property / cites work: The disjoint shortest paths problem / 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 @@
+Graphs of non-crossing perfect matchings
@@ Property / cites work: Graphs of non-crossing perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+On shortest disjoint paths in planar graphs
@@ Property / cites work: On shortest disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4259990
@@ Property / cites work: Q4259990 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. VI. Disjoint paths across a disc
@@ Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. VII: Disjoint paths on a surface
@@ Property / cites work: Graph minors. VII: Disjoint paths on a surface / 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 @@
+On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
+Normal rank
@@ Property / cites work @@
+Q3138923
@@ Property / cites work: Q3138923 / rank @@
+Normal rank
@@ Property / cites work @@
+Length-bounded disjoint paths in planar graphs
@@ Property / cites work: Length-bounded disjoint paths in planar graphs / rank @@
+Normal rank