@InProceedings{rubinstein:LIPIcs.ITCS.2017.42,
  author =	{Rubinstein, Aviad},
  title =	{{Detecting communities is Hard (And Counting Them is Even Harder)}},
  booktitle =	{8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
  pages =	{42:1--42:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-029-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{67},
  editor =	{Papadimitriou, Christos H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.42},
  URN =		{urn:nbn:de:0030-drops-81496},
  doi =		{10.4230/LIPIcs.ITCS.2017.42},
  annote =	{Keywords: Community detection, stable communities, quasipolynomial time}
}