default search action
Dorothea Baumeister
Person information
- affiliation (former): University of Düsseldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]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) - [j13]Dorothea Baumeister
On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. SN Comput. Sci. 4(4): 362 (2023) - [c35]Dorothea Baumeister, Linus Boes, Christian Laußmann, Simon Rey:
Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections. AAMAS 2023: 1400-1408 - [c34]Dorothea Baumeister, Linus Boes:
Distortion in Attribute Approval Committee Elections. AAMAS 2023: 2649-2651 - 2022
- [c33]Dorothea Baumeister, Tobias Hogrebe:
On the Average-Case Complexity of Predicting Round-Robin Tournaments. AAMAS 2022: 1542-1544 - [c32]Dorothea Baumeister, Linus Boes, Christian Laußmann:
Time-Constrained Participatory Budgeting Under Uncertain Project Costs. IJCAI 2022: 74-80 - [e1]Dorothea Baumeister
Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings. Lecture Notes in Computer Science 13442, Springer 2022, ISBN 978-3-031-20613-9 [contents] - 2021
- [j12]Dorothea Baumeister
Acceptance in incomplete argumentation frameworks. Artif. Intell. 295: 103470 (2021) - [j11]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Collective Acceptability in Abstract Argumentation. FLAP 8(6): 1503-1542 (2021) - [c31]Dorothea Baumeister, Linus Boes, Johanna Hillebrand:
Complexity of Manipulative Interference in Participatory Budgeting. ADT 2021: 424-439 - [c30]Dorothea Baumeister, Tobias Alexander Hogrebe:
Complexity of Scheduling and Predicting Round-Robin Tournaments. AAMAS 2021: 178-186 - [c29]Dorothea Baumeister, Linus Boes, Robin Weishaupt:
Complexity of Sequential Rules in Judgment Aggregation. AAMAS 2021: 187-195 - [c28]Dorothea Baumeister, Tobias Hogrebe:
On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. EUMAS 2021: 228-244 - 2020
- [j10]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker:
Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. 112: 13-33 (2020) - [c27]Dorothea Baumeister, Ann-Kathrin Selker, Anaëlle Wilczynski:
Manipulation of Opinion Polls to Influence Iterative Elections. AAMAS 2020: 132-140 - [c26]Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe:
Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS 2020: 1691-1695 - [c25]Dorothea Baumeister, Tobias Hogrebe:
Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract. AAMAS 2020: 1771-1773 - [c24]Dorothea Baumeister, Linus Boes, Tessa Seeger:
Irresolute Approval-based Budgeting. AAMAS 2020: 1774-1776
2010 – 2019
- 2019
- [c23]Dorothea Baumeister, Tobias Hogrebe, Lisa Rey:
Generalized Distance Bribery. AAAI 2019: 1764-1771 - [c22]Dorothea Baumeister, Tobias Hogrebe:
Manipulative Design of Scoring Systems. AAMAS 2019: 1814-1816 - [c21]Dorothea Baumeister, Tobias Hogrebe:
How Hard Is the Manipulative Design of Scoring Systems?. IJCAI 2019: 74-80 - 2018
- [j9]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Verification in incomplete argumentation frameworks. Artif. Intell. 264: 1-26 (2018) - [j8]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. 50(1): 101-122 (2018) - [c20]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Complexity of Verification in Incomplete Argumentation Frameworks. AAAI 2018: 1753-1760 - [c19]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA 2018: 181-192 - 2017
- [j7]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen
Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. 31(3): 628-655 (2017) - [j6]Dorothea Baumeister:
Guest Column: Complexity of Verication in Abstract Argumentation Frameworks. SIGACT News 48(4): 43-56 (2017) - [i5]Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh:
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). Dagstuhl Reports 7(6): 109-134 (2017) - 2016
- [c18]Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker:
Minisum and Minimax Committee Election Rules for General Preference Types. ECAI 2016: 1656-1657 - [p3]Dorothea Baumeister, Jörg Rothe:
Preference Aggregation by Voting. Economics and Computation 2016: 197-325 - [p2]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
Judgment Aggregation. Economics and Computation 2016: 361-391 - 2015
- [j5]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. 76: 19-30 (2015) - [c17]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Verification in Attack-Incomplete Argumentation Frameworks. ADT 2015: 341-358 - [c16]Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack:
Verification in Argument-Incomplete Argumentation Frameworks. ADT 2015: 359-376 - [c15]Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. ADT 2015: 432-448 - [c14]Dorothea Baumeister, Sophie Dennisen, Lisa Rey:
Winner Determination and Manipulation in Minisum and Minimax Committee Elections. ADT 2015: 469-485 - [c13]Dorothea Baumeister, Sophie Dennisen:
Voter Dissatisfaction in Committee Elections. AAMAS 2015: 1707-1708 - [c12]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI 2015: 1127-1133 - 2014
- [c11]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Scoring Rules for the Allocation of Indivisible Goods. ECAI 2014: 75-80 - 2013
- [j4]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. 53(3): 467-502 (2013) - [c10]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT 2013: 71-85 - 2012
- [b2]Dorothea Baumeister:
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation. Heinrich Heine University Düsseldorf, 2012 - [j3]Dorothea Baumeister, Jörg Rothe:
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Inf. Process. Lett. 112(5): 186-190 (2012) - [c9]Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe:
Campaigns for lazy voters: truncated ballots. AAMAS 2012: 577-584 - [c8]Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia
The Possible Winner Problem with Uncertain Weights. ECAI 2012: 133-138 - [c7]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Control in Judgment Aggregation. STAIRS 2012: 23-34 - [p1]Dorothea Baumeister:
Berechnungskomplexität von Problemen in der Computational Social Choice. Ausgezeichnete Informatikdissertationen 2012: 31-40 - 2011
- [b1]Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe:
Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Springer Spektrum 2011, ISBN 978-3-8274-2570-6 - [c6]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT 2011: 1-15 - [c5]Dorothea Baumeister, Magnus Roos, Jörg Rothe:
Computational complexity of two variants of the possible winner problem. AAMAS 2011: 853-860 - [i4]Dorothea Baumeister, Jörg Rothe:
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. CoRR abs/1108.4436 (2011) - 2010
- [c4]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310 - [c3]Dorothea Baumeister, Jörg Rothe:
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI 2010: 1019-1020
2000 – 2009
- 2009
- [j2]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. Fundam. Informaticae 91(1): 35-51 (2009) - [j1]Dorothea Baumeister, Jörg Rothe:
The three-color and two-color TantrixTM rotation puzzle problems are NP-complete via parsimonious reductions. Inf. Comput. 207(11): 1119-1139 (2009) - [i3]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe:
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP. CoRR abs/0901.3692 (2009) - 2008
- [c2]Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA 2008: 76-87 - 2007
- [c1]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. MCU 2007: 134-145 - [i2]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem. CoRR abs/0705.0915 (2007) - [i1]Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions. CoRR abs/0711.1827 (2007)
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-05-02 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: