 | 2012 |
| 14 |  | 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) |
| 2011 |
| 13 |  | 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 |
| 12 |  | Dorothea Baumeister,
Magnus Roos,
Jörg Rothe:
Computational complexity of two variants of the possible winner problem.
AAMAS 2011: 853-860 |
| 11 |  | 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 |
| 10 |  | 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 |
| 9 |  | Dorothea Baumeister,
Felix Brandt,
Felix A. Fischer,
Jan Hoffmann,
Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets.
CIAC 2010: 299-310 |
| 8 |  | 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 |
| 2009 |
| 7 |  | 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) |
| 6 |  | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.
Fundam. Inform. 91(1): 35-51 (2009) |
| 5 |  | 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) |
| 2008 |
| 4 |  | 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 |
| 3 |  | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.
MCU 2007: 134-145 |
| 2 |  | Dorothea Baumeister,
Jörg Rothe:
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
CoRR abs/0705.0915: (2007) |
| 1 |  | 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) |