Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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 Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved algorithm for the half-disjoint paths problem
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
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |