Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Multiway cuts in node weighted graphs
Journal of Algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering with qualitative information
Journal of Computer and System Sciences - Special issue: Learning theory 2003
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An analysis of graph cut size for transductive learning
ICML '06 Proceedings of the 23rd international conference on Machine learning
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics - Special issue: Max-algebra
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Approximation algorithms for labeling hierarchical taxonomies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Metric clustering via consistent labeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Future Generation Computer Systems
Packing multiway cuts in capacitated graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Meme-tracking and the dynamics of the news cycle
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Strategic cooperation in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Globally optimal image partitioning by multicuts
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
From static code distribution to more shrinkage for the multiterminal cut
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
An approximation algorithm for the Generalized k-Multicut problem
Discrete Applied Mathematics
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Cut problems in graphs with a budget constraint
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Combinatorial auctions with restricted complements
Proceedings of the 13th ACM Conference on Electronic Commerce
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |