Research Interests: Approximation Algorithms, Combinatorial Optimization and Graph Algorithms.

Some of my Publications

On the single-source unsplittable flow problem
with Y. Dinitz and M. Goemans

Minimizing stall time in single and parallel disk systems
with S. Albers and S. Leonardi

Finding separator cuts in planar graphs within twice the optimal
with H. Saran and V. Vazirani

Multiway Cuts in Directed and Node Weighted Graphs
with V. Vazirani and M. Yannakakis

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane.
Algorithmica, 18(1):111-121, 1997.
with D. Hochbaum

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees.
Algorithmica, 18(1):3-20, 1997.
with V. Vazirani and M. Yannakakis

Approximate max-flow min-(multi)cut theorems and their applications.
SIAM Journal on Computing, 25(2):235-251, 1996.
with V. Vazirani and M. Yannakakis

A Polyhedron with all s-t Cuts as Vertices and Adjacency of Cuts.
Mathematical Programming (A), 70(1):17-25, 1995.
with V. Vazirani

And my Dissertation: Multicommodity Flows and Approximation Algorithms