Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Existence and Construction of Edge-Disjoint Pathson Expander Graphs
SIAM Journal on Computing
A Chernoff Bound for Random Walks on Expander Graphs
SIAM Journal on Computing
Static and dynamic path selection on expander graphs: a random walk approach
Random Structures & Algorithms
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Multicommodity Flow and Circuit Switching
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Graph Theory With Applications
Graph Theory With Applications
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.05 |