Nadja Betzler, Johannes Uhlmann. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. In Boting Yang, Ding-Zhu Du, Cao An Wang, editors, Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John s, NL, Canada, August 21-24, 2008. Proceedings. Volume 5165 of Lecture Notes in Computer Science, pages 43-53, Springer, 2008. [doi]
@inproceedings{BetzlerU08,
title = {Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems},
author = {Nadja Betzler and Johannes Uhlmann},
year = {2008},
doi = {10.1007/978-3-540-85097-7_5},
url = {http://dx.doi.org/10.1007/978-3-540-85097-7_5},
researchr = {https://researchr.org/publication/BetzlerU08},
cites = {0},
citedby = {0},
pages = {43-53},
booktitle = {Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John s, NL, Canada, August 21-24, 2008. Proceedings},
editor = {Boting Yang and Ding-Zhu Du and Cao An Wang},
volume = {5165},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-85096-0},
}