Subhash Khot, Rishi Saket. Hardness of Finding Independent Sets in Almost q-Colorable Graphs. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 380-389, IEEE Computer Society, 2012. [doi]
Abstract is missing.