Efficient algorithms for finding disjoint paths in grids
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A very practical algorithm for the two-paths problem in 3-connected planar graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG)
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
Hardness of finding two edge-disjoint min-min paths in digraphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tight bounds for linkages in planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A linear time algorithm for the induced disjoint paths problem in planar graphs
Journal of Computer and System Sciences
On the complexity of the edge-disjoint min-min problem in planar digraphs
Theoretical Computer Science
On shortest disjoint paths in planar graphs
Discrete Optimization
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
It is shown that, for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.