Publications
Refereed Journal Publications
Complexity of Shift Bribery for Iterative Voting Rules.
C. Maushagen, M. Neveling, J. Rothe, and A. Selker.
Annals of Mathematics and Artificial Intelligence, vol. 90, no. 10, pp. 1017–1054,
October 2022.
Towards Completing the Puzzle: Complexity of Control by Replacing, Adding, and Deleting Candidates or Voters.
G. Erdélyi, M. Neveling, C. Reger, J. Rothe, Y. Yang, and R. Zorn.
Journal of Autonomous Agents and Multi-Agent Systems, vol. 35, no. 2, article 41, July 2021.
Control Complexity in Borda Elections: Solving All Open Cases of Offline Control and Some Cases of Online Control.
M. Neveling and J. Rothe.
Artificial Intelligence, vol. 298, 103508, 30 pages, September 2021.
Refereed Publications in Conference Proceedings
The Possible Winner Problem with Uncertain Weights Revisited.
M. Neveling, J. Rothe, and R. Weishaupt.
Proceedings of the 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021), Athens, Greece. Best Paper Award. Springer-Verlag Lecture Notes in Computer Science 12867, pages 399-412, September 2021.
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.
M. Neveling, J. Rothe, and R. Zorn.
Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), Ekaterinburg, Russia. Springer-Verlag Lecture Notes in Computer Science 12159, pages 314-327, June/July 2020.
A
preliminary version appeared in the nonarchival website proceedings of the 16th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2020), Fort Lauderdale, FL, USA. January 2020.
The Complexity of Cloning Candidates in Multiwinner Elections.
M. Neveling and J. Rothe.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand. IFAAMAS, pages 922-930, May 2020.
Complexity of Shift Bribery in Iterative Elections.
C. Maushagen, M. Neveling, J. Rothe, and A. Selker.
Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018), Stockholm, Sweden. IFAAMAS, pages 1567-1575, July 2018.
A
preliminary version appeared in the nonarchival website proceedings of the 15th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2018), Fort Lauderdale, FL, USA. January 2018.
Closing the Gap of Control Complexity in Borda Elections: Solving Ten Open Cases.
M. Neveling and J. Rothe.
Proceedings of the 18th Italian Conference on Theoretical Computer Science (ICTCS 2017), Napoli, Italy. CEUR-WS.org, vol. 1949, pages 138-149, September 2017.
Solving Seven Open Problems of Offline and Online Control in Borda Elections.
M. Neveling and J. Rothe.
Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), San Francisco, CA, USA.
AAAI Press, pages 3029-3035, February 2017.
An
extended version also appears in the nonarchival proceedings of
the 7th International Workshop on Computational Social Choice (COMSOC 2018), Troy, NY, USA, June 2018.
PhD Thesis
A Computational Complexity Study of Various Types of Electoral Control, Cloning, and Bribery.
M. Neveling.
PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 180 pages, September 2021.
Master Thesis
Wahlkontrolle im Standard- und im Online-Modell für Scoring-Protokolle.
M. Neveling.
Master Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 39 pages, January 2017.