1. Non-oblivious local search for graph and hypergraph coloring problems;Alimonti,1995
2. Max NP-completeness made easy;Crescenzi,1997
3. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT;Feige,1995
4. 878-approximation algorithms for MAX CUT and MAX 2SAT;Goemans,1994
5. New 34-approximation algorithms for the maximum satisfiability problem;Goemans;SIAM J. Discrete Math.,1994