Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Solution to the Undirected Two Paths Problem
Journal of the ACM (JACM)
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
Achievable throughput in two-scale wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
| Hi-index | 0.00 |