Uriel Feige Eran Ofek Finding a Maximum Independent Set in a Sparse Random Graph Electronic Colloquium on Computational Complexity (ECCC) 2005 050 db/journals/eccc/eccc12.html#TR05-050 http://eccc.hpi-web.de/eccc-reports/2005/TR05-050/index.html