Dorothea Baumeister

ORCID

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 35

Top Venues

AAMAS

ADT

IJCAI

J. Comput. Syst. Sci.

Heinrich Heine University Düsseldorf (PHD)

Education History

Heinrich Heine University Düsseldorf

PHD

Publications

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 (2023)
Dorothea Baumeister, Linus Boes
Distortion in Attribute Approval Committee Elections. AAMAS (2023)
Dorothea Baumeister, Tobias Hogrebe
On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. SN Comput. Sci. 4 (4) (2023)
Dorothea Baumeister, Linus Boes, Christian Laußmann, Simon Rey
Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections. AAMAS (2023)
Dorothea Baumeister, Linus Boes, Christian Laußmann
Time-Constrained Participatory Budgeting Under Uncertain Project Costs. IJCAI (2022)
Dorothea Baumeister, Tobias Hogrebe
On the Average-Case Complexity of Predicting Round-Robin Tournaments. AAMAS (2022)
Dorothea Baumeister, Tobias Alexander Hogrebe
Complexity of Scheduling and Predicting Round-Robin Tournaments. AAMAS (2021)
Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe
Acceptance in incomplete argumentation frameworks. Artif. Intell. 295 (2021)
Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
Collective Acceptability in Abstract Argumentation. FLAP 8 (6) (2021)
Dorothea Baumeister, Linus Boes, Johanna Hillebrand
Complexity of Manipulative Interference in Participatory Budgeting. ADT (2021)
Dorothea Baumeister, Tobias Hogrebe
On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. EUMAS (2021)
Dorothea Baumeister, Linus Boes, Robin Weishaupt
Complexity of Sequential Rules in Judgment Aggregation. AAMAS (2021)
Dorothea Baumeister, Linus Boes, Tessa Seeger
Irresolute Approval-based Budgeting. AAMAS (2020)
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 (2020)
Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe
Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS (2020)
Dorothea Baumeister, Ann-Kathrin Selker, Anaëlle Wilczynski
Manipulation of Opinion Polls to Influence Iterative Elections. AAMAS (2020)
Dorothea Baumeister, Tobias Hogrebe
Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract. AAMAS (2020)
Dorothea Baumeister, Tobias Hogrebe
How Hard Is the Manipulative Design of Scoring Systems?. IJCAI (2019)
Dorothea Baumeister, Tobias Hogrebe
Manipulative Design of Scoring Systems. AAMAS (2019)
Dorothea Baumeister, Tobias Hogrebe, Lisa Rey
Generalized Distance Bribery. AAAI (2019)
Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. 50 (1) (2018)
Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA (2018)
Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
Complexity of Verification in Incomplete Argumentation Frameworks. AAAI (2018)
Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
Verification in incomplete argumentation frameworks. Artif. Intell. 264 (2018)
Dorothea Baumeister
Guest Column: Complexity of Verication in Abstract Argumentation Frameworks. SIGACT News 48 (4) (2017)
Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). Dagstuhl Reports 7 (6) (2017)
Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine
Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. 31 (3) (2017)
Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker
Minisum and Minimax Committee Election Rules for General Preference Types. ECAI (2016)
Dorothea Baumeister, Sophie Dennisen, Lisa Rey
Winner Determination and Manipulation in Minisum and Minimax Committee Elections. ADT (2015)
Dorothea Baumeister, Sophie Dennisen
Voter Dissatisfaction in Committee Elections. AAMAS (2015)
Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
Verification in Attack-Incomplete Argumentation Frameworks. ADT (2015)
Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack
Verification in Argument-Incomplete Argumentation Frameworks. ADT (2015)
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 (2015)
Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI (2015)
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)
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)
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) (2013)
Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT (2013)
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) (2012)
Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
Control in Judgment Aggregation. STAIRS (2012)
Dorothea Baumeister
Berechnungskomplexität von Problemen in der Computational Social Choice. Ausgezeichnete Informatikdissertationen (2012)
Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia
The Possible Winner Problem with Uncertain Weights. ECAI (2012)
Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe
Campaigns for lazy voters: truncated ballots. AAMAS (2012)
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)
Dorothea Baumeister, Magnus Roos, Jörg Rothe
Computational complexity of two variants of the possible winner problem. AAMAS (2011)
Dorothea Baumeister, Jörg Rothe
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules CoRR (2011)
Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC (2010)
Dorothea Baumeister, Jörg Rothe
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI (2010)
Dorothea Baumeister, Jörg Rothe
Rotation Puzzle Problem. Fundam. Informaticae 91 (1) (2009)
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 (2009)
Dorothea Baumeister, Jörg Rothe
rotation puzzle problems are NP-complete via parsimonious reductions. Inf. Comput. 207 (11) (2009)
Dorothea Baumeister, Jörg Rothe
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA (2008)
Dorothea Baumeister, Jörg Rothe
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions CoRR (2007)
Dorothea Baumeister, Jörg Rothe
Rotation Puzzle Problem. MCU (2007)
Dorothea Baumeister, Jörg Rothe
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem CoRR (2007)

Dorothea Baumeister.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dorothea Baumeister