18 citations · 18 across the 2 of their papers we have counts for
2 papers
cs.GT2008★ 18 cited
Llull and Copeland Voting Computationally Resist Bribery and Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
The only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization. We study a parameterized versi…
cs.CC2007
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…