Solving Seven Open Problems of Offline and Online Control in Borda Elections. - Marc Neveling; Jörg Rothe (AAAI, 2017)

Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases. - Marc Neveling; Jörg Rothe (ICTCS/CILC, 2017)

Complexity of Shift Bribery in Iterative Elections. - Cynthia Maushagen; Marc Neveling; Jörg Rothe; Ann-Kathrin Selker (AAMAS, 2018)

Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. - Cynthia Maushagen; Marc Neveling; Jörg Rothe; Ann-Kathrin Selker (ISAIM, 2018)

The Complexity of Cloning Candidates in Multiwinner Elections. - Marc Neveling; Jörg Rothe (AAMAS, 2020)

The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. - Marc Neveling; Jörg Rothe; Roman Zorn (ISAIM, 2020)

The Possible Winner Problem with Uncertain Weights Revisited. - Marc Neveling; Jörg Rothe; Robin Weishaupt (FCT, 2021)

Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. - Gábor Erdélyi; Marc Neveling; Christian Reger; Jörg Rothe; Yongjie Yang 001; Roman Zorn (Auton. Agents Multi Agent Syst., 2021)

Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. - Marc Neveling; Jörg Rothe (Artif. Intell., 2021)

Complexity of shift bribery for iterative voting rules. - Cynthia Maushagen; Marc Neveling; Jörg Rothe; Ann-Kathrin Selker (Ann. Math. Artif. Intell., 2022)

The possible winner with uncertain weights problem. - Dorothea Baumeister; Marc Neveling; Magnus Roos; Jörg Rothe; Lena Schend; Robin Weishaupt; Lirong Xia (J. Comput. Syst. Sci., 2023)