Dorothea Baumeister

62 papers A* 5A 17C 6Journal 21Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computational Social Choice: Research & Development. CoRR Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer, Sylvain Bouveret, Andreas Darmann, Piotr Faliszewski, Martin Lackner, Jérôme Lang, Nicholas Mattei, Arianna Novaro
2025	J	`jnl`	Advances in Multi-Agent Systems Research: Extended Selected Papers from EUMAS 2022 and EUMAS 2023. SN Comput. Sci. Dorothea Baumeister, Jörg Rothe, Nikos Spanoudakis, Vadim Malvone, Aniello Murano
2023	A	`conf`	Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections. AAMAS Dorothea Baumeister, Linus Boes, Christian Laußmann, Simon Rey
2023	A	`conf`	Distortion in Attribute Approval Committee Elections. AAMAS Dorothea Baumeister, Linus Boes
2023	J	`jnl`	On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. SN Comput. Sci. Dorothea Baumeister, Tobias Hogrebe
2023	J	`jnl`	The possible winner with uncertain weights problem. J. Comput. Syst. Sci. Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia
2022	C	`ed.`	Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings EUMAS Dorothea Baumeister, Jörg Rothe
2022	A	`conf`	On the Average-Case Complexity of Predicting Round-Robin Tournaments. AAMAS Dorothea Baumeister, Tobias Hogrebe
2022	A*	`conf`	Time-Constrained Participatory Budgeting Under Uncertain Project Costs. IJCAI Dorothea Baumeister, Linus Boes, Christian Laußmann
2021	J	`jnl`	Acceptance in incomplete argumentation frameworks. Artif. Intell. Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe
2021	J	`jnl`	Collective Acceptability in Abstract Argumentation. FLAP Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2021	—	`conf`	Complexity of Manipulative Interference in Participatory Budgeting. ADT Dorothea Baumeister, Linus Boes, Johanna Hillebrand
2021	A	`conf`	Complexity of Scheduling and Predicting Round-Robin Tournaments. AAMAS Dorothea Baumeister, Tobias Alexander Hogrebe
2021	A	`conf`	Complexity of Sequential Rules in Judgment Aggregation. AAMAS Dorothea Baumeister, Linus Boes, Robin Weishaupt
2021	C	`conf`	On the Complexity of Predicting Election Outcomes and Estimating Their Robustness. EUMAS Dorothea Baumeister, Tobias Hogrebe
2020	A	`conf`	Complexity of Election Evaluation and Probabilistic Robustness: Extended Abstract. AAMAS Dorothea Baumeister, Tobias Hogrebe
2020	J	`jnl`	Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker
2020	A	`conf`	Irresolute Approval-based Budgeting. AAMAS Dorothea Baumeister, Linus Boes, Tessa Seeger
2020	A	`conf`	Manipulation of Opinion Polls to Influence Iterative Elections. AAMAS Dorothea Baumeister, Ann-Kathrin Selker, Anaëlle Wilczynski
2020	A	`conf`	Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe
2019	A*	`conf`	Generalized Distance Bribery. AAAI Dorothea Baumeister, Tobias Hogrebe, Lisa Rey
2019	A*	`conf`	How Hard Is the Manipulative Design of Scoring Systems?. IJCAI Dorothea Baumeister, Tobias Hogrebe
2019	A	`conf`	Manipulative Design of Scoring Systems. AAMAS Dorothea Baumeister, Tobias Hogrebe
2018	A*	`conf`	Complexity of Verification in Incomplete Argumentation Frameworks. AAAI Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
2018	C	`conf`	Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2018	J	`jnl`	Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
2018	J	`jnl`	Verification in incomplete argumentation frameworks. Artif. Intell. Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
2017	J	`jnl`	Guest Column: Complexity of Verication in Abstract Argumentation Frameworks. SIGACT News Dorothea Baumeister
2017	J	`jnl`	Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine
2017	J	`jnl`	Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). Dagstuhl Reports Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh
2016	—	`ch.`	Judgment Aggregation. Economics and Computation Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2016	A	`conf`	Minisum and Minimax Committee Election Rules for General Preference Types. ECAI Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker
2016	—	`ch.`	Preference Aggregation by Voting. Economics and Computation Dorothea Baumeister, Jörg Rothe
2015	—	`conf`	Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. ADT Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker
2015	J	`jnl`	Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2015	A*	`conf`	Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
2015	—	`conf`	Verification in Argument-Incomplete Argumentation Frameworks. ADT Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack
2015	—	`conf`	Verification in Attack-Incomplete Argumentation Frameworks. ADT Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2015	A	`conf`	Voter Dissatisfaction in Committee Elections. AAMAS Dorothea Baumeister, Sophie Dennisen
2015	—	`conf`	Winner Determination and Manipulation in Minisum and Minimax Committee Elections. ADT Dorothea Baumeister, Sophie Dennisen, Lisa Rey
2014	A	`conf`	Scoring Rules for the Allocation of Indivisible Goods. ECAI Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe
2013	—	`conf`	Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2013	J	`jnl`	The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2012	—	`ch.`	Berechnungskomplexität von Problemen in der Computational Social Choice. Ausgezeichnete Informatikdissertationen Dorothea Baumeister
2012	A	`conf`	Campaigns for lazy voters: truncated ballots. AAMAS Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe
2012	—	`—`	Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation. Dorothea Baumeister
2012	—	`conf`	Control in Judgment Aggregation. STAIRS Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2012	J	`jnl`	Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Inf. Process. Lett. Dorothea Baumeister, Jörg Rothe
2012	A	`conf`	The Possible Winner Problem with Uncertain Weights. ECAI Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia
2011	A	`conf`	Computational complexity of two variants of the possible winner problem. AAMAS Dorothea Baumeister, Magnus Roos, Jörg Rothe
2011	—	`book`	Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe
2011	—	`conf`	How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2011	J	`jnl`	Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules CoRR Dorothea Baumeister, Jörg Rothe
2010	A	`conf`	Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI Dorothea Baumeister, Jörg Rothe
2010	C	`conf`	The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2009	J	`jnl`	Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP CoRR Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe
2009	J	`jnl`	Satisfiability Parsimoniously Reduces to the Tantrix Fundam. Informaticae Dorothea Baumeister, Jörg Rothe
2009	J	`jnl`	The three-color and two-color Tantrix Inf. Comput. Dorothea Baumeister, Jörg Rothe
2008	C	`conf`	The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA Dorothea Baumeister, Jörg Rothe
2007	C	`conf`	Satisfiability Parsimoniously Reduces to the Tantrix MCU Dorothea Baumeister, Jörg Rothe
2007	J	`jnl`	Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem CoRR Dorothea Baumeister, Jörg Rothe
2007	J	`jnl`	The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions CoRR Dorothea Baumeister, Jörg Rothe