BibTeX record conf/focs/KhotS12

download as .bib file

@inproceedings{DBLP:conf/focs/KhotS12,
  author       = {Subhash Khot and
                  Rishi Saket},
  title        = {Hardness of Finding Independent Sets in Almost q-Colorable Graphs},
  booktitle    = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages        = {380--389},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/FOCS.2012.75},
  doi          = {10.1109/FOCS.2012.75},
  timestamp    = {Thu, 23 Mar 2023 23:57:55 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KhotS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.