On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics - Special issue: Max-algebra
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics
Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
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.89 |