@InProceedings{dey_et_al:LIPIcs.MFCS.2017.57,
  author =	{Dey, Palash and Misra, Neeldhara},
  title =	{{On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{57:1--57:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.57},
  URN =		{urn:nbn:de:0030-drops-81354},
  doi =		{10.4230/LIPIcs.MFCS.2017.57},
  annote =	{Keywords: Computational Social Choice, Dichotomy, NP-completeness, Maxflow, Voting, Possible winner}
}