The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)

Bipartite density of cubic graphs

Discrete Mathematics

The Laplacian spectral radius of a graph under perturbation

Computers & Mathematics with Applications

Local search starting from an LP solution: Fast and quite good

Journal of Experimental Algorithmics (JEA)