STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for cycle packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An O(√n)-approximation algorithm for directed sparsest cut
Information Processing Letters
On the max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An O(n)-approximation algorithm for directed sparsest cut
Information Processing Letters
Approximability of packing disjoint cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithm for directed multicuts
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Operations Research Letters
Theoretical Computer Science
| Hi-index | 0.00 |