关注
Marc Neveling
标题
引用次数
引用次数
年份
Complexity of shift bribery in iterative elections
C Maushagen, M Neveling, J Rothe, AK Selker
Proceedings of the 17th international conference on autonomous agents and …, 2018
262018
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, R Zorn
Autonomous Agents and Multi-Agent Systems 35, 1-48, 2021
192021
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control
M Neveling, J Rothe
Artificial Intelligence 298, 103508, 2021
162021
Solving seven open problems of offline and online control in Borda elections
M Neveling, J Rothe
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
162017
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases.
M Neveling, J Rothe
ICTCS/CILC, 138-149, 2017
72017
The possible winner problem with uncertain weights revisited
M Neveling, J Rothe, R Weishaupt
Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021 …, 2021
52021
The Complexity of Cloning Candidates in Multiwinner Elections.
M Neveling, J Rothe
AAMAS, 922-930, 2020
42020
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters
M Neveling, J Rothe, R Zorn
Computer Science–Theory and Applications: 15th International Computer …, 2020
42020
Complexity of shift bribery for iterative voting rules
C Maushagen, M Neveling, J Rothe, AK Selker
Annals of Mathematics and Artificial Intelligence 90 (10), 1017-1054, 2022
32022
The possible winner with uncertain weights problem
D Baumeister, M Neveling, M Roos, J Rothe, L Schend, R Weishaupt, ...
Journal of Computer and System Sciences 138, 103464, 2023
12023
Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections.
C Maushagen, M Neveling, J Rothe, AK Selker
ISAIM, 2018
12018
Thema 12: Zeichnen binärer Bäume auf einem Gitter
M Neveling
Closing the Gap of Control Complexity in Borda Elections: Solving Twelve Open Cases1
M Neveling, J Rothe
A Computational Complexity Study of Various Types of Electoral Control, Cloning, and Bribery
M Neveling
Dissertation, Düsseldorf, Heinrich-Heine-Universität, 2021, 0
系统目前无法执行此操作,请稍后再试。
文章 1–14