dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Dorothea Baumeister Home Page Coauthor index pubzone.org

Universität Düsseldorf

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

1Felix Brandt [7] [9]
2Gábor Erdélyi [11]
3Felix A. Fischer [7] [9]
4Jan Hoffmann [9]
5Claudia Lindner [13]
6Magnus Roos [12]
7Irene Rothe [13]
8Jörg Rothe [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14]

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page