| 2011 | IJCAI | Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger |
| 2011 | SOFSEM | On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
| 2010 | AAAI | Probabilistic Possible Winner Determination. | Yoram Bachrach, Nadja Betzler, Piotr Faliszewski |
| 2010 | LATIN | Average Parameterization and Partial Kernelization for Computing Medians. | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
| 2010 | MFCS | On Problem Kernels for Possible Winner Determination under the | Nadja Betzler |
| 2009 | IJCAI | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. | Nadja Betzler, Susanne Hemmann, Rolf Niedermeier |
| 2009 | MFCS | Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. | Nadja Betzler, Britta Dorn |
| 2008 | AAIM | Fixed-Parameter Algorithms for Kemeny Scores. | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
| 2008 | COCOA | Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. | Nadja Betzler, Johannes Uhlmann |
| 2008 | CPM | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |