Splitting an expander graph

Edge-disjoint paths in expander graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász local Lemma

Random Structures & Algorithms
Line-of-sight networks

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Line-of-sight networks

Combinatorics, Probability and Computing

Hi-index	0.00