Journal of the ACM (JACM)
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM (JACM)
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
An efficient algorithm for the vertex-disjoint paths problem in random graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in circular arc graphs
Nordic Journal of Computing
Chain decompositions and independent trees in 4-connected graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
An improved linear edge bound for graph linkages
European Journal of Combinatorics - Special issue: Topological graph theory II
Extremal Functions for Shortening Sets of Paths
Combinatorics, Probability and Computing
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The extremal function for 3-linked graphs
Journal of Combinatorial Theory Series B
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
A polynomial-time algorithm to find a linkless embedding of a graph
Journal of Combinatorial Theory Series B
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
A novel path protection scheme for MPLS networks using multi-path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics
European Journal of Combinatorics
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
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
Independent paths and K5-subdivisions
Journal of Combinatorial Theory Series B
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Algorithms for finding a maximum non-k-linked graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Finding disjoint paths on directed acyclic graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Oriented paths in mixed graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Journal of Combinatorial Theory Series B
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
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Notes: A simpler proof for the two disjoint odd cycles theorem
Journal of Combinatorial Theory Series B
K5-Subdivisions in graphs containing K4-
Journal of Combinatorial Theory Series B
| Hi-index | 0.01 |