


default search action
Marc Neveling
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia
:
The possible winner with uncertain weights problem. J. Comput. Syst. Sci. 138: 103464 (2023) - 2022
- [j3]Cynthia Maushagen, Marc Neveling, Jörg Rothe
, Ann-Kathrin Selker:
Complexity of shift bribery for iterative voting rules. Ann. Math. Artif. Intell. 90(10): 1017-1054 (2022) - 2021
- [j2]Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang
, Roman Zorn:
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. 35(2): 41 (2021) - [j1]Marc Neveling, Jörg Rothe:
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artif. Intell. 298: 103508 (2021) - [c8]Marc Neveling, Jörg Rothe
, Robin Weishaupt:
The Possible Winner Problem with Uncertain Weights Revisited. FCT 2021: 399-412 - 2020
- [c7]Marc Neveling, Jörg Rothe:
The Complexity of Cloning Candidates in Multiwinner Elections. AAMAS 2020: 922-930 - [c6]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. CSR 2020: 314-327 - [c5]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. ISAIM 2020
2010 – 2019
- 2018
- [c4]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Iterative Elections. AAMAS 2018: 1567-1575 - [c3]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. ISAIM 2018 - 2017
- [c2]Marc Neveling, Jörg Rothe:
Solving Seven Open Problems of Offline and Online Control in Borda Elections. AAAI 2017: 3029-3035 - [c1]Marc Neveling, Jörg Rothe:
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases. ICTCS/CILC 2017: 138-149
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint