Evolutionary trees: An integer multicommodity max-flow-min-cut theorem
Advances in Applied Mathematics
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimum 0-extensions of graph metrics
European Journal of Combinatorics
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient graph-based energy minimization methods in computer vision
Efficient graph-based energy minimization methods in computer vision
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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 efficient algorithm for image segmentation, Markov random fields and related problems
Journal of the ACM (JACM)
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Net Surface Problems with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Experimental Algorithmics (JEA)
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Approximate Labeling via Graph Cuts Based on Linear Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cortical Surface Thickness as a Classifier: Boosting for Autism Classification
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
Improved Moves for Truncated Convex Models
The Journal of Machine Learning Research
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |