SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Nadja Betzler · Study

Home/Author

Nadja Betzler

7 works· latest 2011· 2 institutionscluster: provisional

h-index7

i107

Citations515

Works here7

09

10

11

Most cited in this library

Unweighted Coalitional Manipulation Under the Borda Rule Is NP-Hard2011 · 95 citations
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules2010 · 87 citations
Fixed-parameter algorithms for Kemeny rankings2009 · 84 citations
A multivariate complexity analysis of determining possible winners given incomplete votes2009 · 71 citations
Parameterized complexity of candidate control in elections and related digraph problems2009 · 67 citations

Works

7 shown

Unweighted Coalitional Manipulation Under the Borda Rule Is NP-Hard

·2011·3 authors

95citations

Probabilistic Possible Winner Determination

Proceedings of the AAAI Conference on Artificial Intelligence·2010·3 authors·other·Open access

55citations

Towards a dichotomy for the Possible Winner problem in elections based on scoring rules

Journal of Computer and System Sciences·2010·2 authors·Open access

87citations

Parameterized computational complexity of Dodgson and Young elections

Information and Computation·2009·3 authors·Open access

56citations

Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science·2009·5 authors·Open access

84citations

A multivariate complexity analysis of determining possible winners given incomplete votes

·2009·3 authors

71citations

Parameterized complexity of candidate control in elections and related digraph problems

Theoretical Computer Science·2009·2 authors·Open access

67citations