The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number

Venkatesan Guruswami, Ali Kemal Sinop. The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1615-1626, SIAM, 2011. [doi]

Abstract

Abstract is missing.