Combinatorica
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
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic approximation algorithm for a minmax integer programming problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
| Hi-index | 0.00 |