Dorothea Baumeister
Orcid: 0000-0001-6325-2879Affiliations:
- University of Düsseldorf, Germany (former)
According to our database1,
Dorothea Baumeister
authored at least 53 papers
between 2007 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
0
1
2
3
4
5
6
7
2
1
2
2
1
2
3
1
1
1
3
2
2
2
3
4
3
2
1
5
1
1
3
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2023
J. Comput. Syst. Sci., December, 2023
SN Comput. Sci., July, 2023
Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
2021
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021
2020
J. Comput. Syst. Sci., 2020
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
2019
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
Soc. Choice Welf., 2018
Proceedings of the Computational Models of Argument, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
SIGACT News, 2017
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261).
Dagstuhl Reports, 2017
Auton. Agents Multi Agent Syst., 2017
2016
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
2015
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules.
Math. Soc. Sci., 2015
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
2014
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014
2013
Theory Comput. Syst., 2013
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013
2012
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation.
PhD thesis, 2012
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.
Inf. Process. Lett., 2012
Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012
Proceedings of the ECAI 2012, 2012
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012
2011
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011
Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen.
Springer Spektrum, ISBN: 978-3-8274-2570-6, 2011
2009
The three-color and two-color Tantrix<sup>TM</sup> rotation puzzle problems are NP-complete via parsimonious reductions.
Inf. Comput., 2009
Satisfiability Parsimoniously Reduces to the Tantrix<sup>TM</sup> Rotation Puzzle Problem.
Fundam. Informaticae, 2009
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP
CoRR, 2009
2008
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.
Proceedings of the Language and Automata Theory and Applications, 2008
2007
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
CoRR, 2007
CoRR, 2007