Theoretical Computer Science · 1996 · 126 citations · 8 references
8
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text
A Spectral Technique for Coloring Random 3-Colorable Graphs
Noga Alon, Nabil Kahalé · SIAM Journal on Computing · 1997 · 188 citations