Integer and combinatorial optimization
Integer and combinatorial optimization
Finding k-cuts within twice the optimal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
On weighted multiway cuts in trees
Mathematical Programming: Series A and B
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
A 2-approximation algorithm for the directed multiway cut problem
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A constant factor approximation algorithm for a class of classification problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal 3-Terminal Cuts and Linear Programming
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating metrics by tree metrics
ACM SIGACT News
The multi-multiway cut problem
Theoretical Computer Science
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Interactive Separation of Segmented Bones in CT Volumes Using Graph Cut
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
New geometry-inspired relaxations and algorithms for the metric steiner tree problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The maximum integer multiterminal flow problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Two-Server network disconnection problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Solving planar k-terminal cut in O(nc√k) time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
| Hi-index | 0.00 |