9 citations · 11 across the 5 of their papers we have counts for
5 papers
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules
Dorothea Baumeister, Joerg Rothe
The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winn…
The Complexity of Computing Minimal Unidirectional Covering Sets
Dorothea Baumeister, Felix Brandt, Felix Fischer +2
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability.…
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Dorothea Baumeister, Joerg Rothe
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the…
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
Dorothea Baumeister, Joerg Rothe
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotati…