@InProceedings{fellows_et_al:LIPIcs.FSTTCS.2010.459,
author = {Fellows, Michael and Jansen, Bart M. P. and Lokshtanov, Daniel and Rosamond, Frances A. and Saurabh, Saket},
title = {{Determining the Winner of a Dodgson Election is Hard}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {459--468},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.459},
URN = {urn:nbn:de:0030-drops-28866},
doi = {10.4230/LIPIcs.FSTTCS.2010.459},
annote = {Keywords: Dodgson Score, Parameterized Complexity, Kernelization Lower Bounds}
}