Polynomial time approximation of dense weighted instances of MAX-CUT

Approximability of the Minimum Bisection Problem: An Algorithmic Challenge

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

Random Structures & Algorithms

Approximation schemes for Metric Bisection and partitioning

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Tensor decomposition and approximation schemes for constraint satisfaction problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Approximating integer quadratic programs and MAXCUT in subdense graphs

ESA'05 Proceedings of the 13th annual European conference on Algorithms