An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs

An efficient algorithm for the vertex-disjoint paths problem in random graphs

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Optimal construction of edge-disjoint paths in random regular graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Optimal construction of edge-disjoint paths in random graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs

Combinatorics, Probability and Computing