STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth 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
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |