Irit Dinur, Subhash Khot, Will Perkins, Muli Safra. Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 212-221, IEEE Computer Society, 2010. [doi]
@inproceedings{DinurKPS10,
title = {Hardness of Finding Independent Sets in Almost 3-Colorable Graphs},
author = {Irit Dinur and Subhash Khot and Will Perkins and Muli Safra},
year = {2010},
doi = {10.1109/FOCS.2010.84},
url = {http://dx.doi.org/10.1109/FOCS.2010.84},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DinurKPS10},
cites = {0},
citedby = {0},
pages = {212-221},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-4244-7},
}