Experiments on data reduction for optimal domination in networks. - Jochen Alber; Nadja Betzler; Rolf Niedermeier (Ann. Oper. Res., 2006)

Tree decompositions of graphs: Saving memory in dynamic programming. - Nadja Betzler; Rolf Niedermeier; Johannes Uhlmann (Discret. Optim., 2006)

Optimal Edge Deletions for Signed Graph Balancing. - Falk Hüffner; Nadja Betzler; Rolf Niedermeier (WEA, 2007)

Fixed-Parameter Algorithms for Kemeny Scores. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (AAIM, 2008)

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. - Nadja Betzler; Michael R. Fellows; Christian Komusiewicz; Rolf Niedermeier (CPM, 2008)

How similarity helps to efficiently compute Kemeny rankings. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (AAMAS (1), 2009)

A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. - Nadja Betzler; Susanne Hemmann; Rolf Niedermeier (IJCAI, 2009)

Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. - Nadja Betzler; Britta Dorn (MFCS, 2009)

Fixed-parameter algorithms for Kemeny rankings. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (Theor. Comput. Sci., 2009)

Parameterized complexity of candidate control in elections and related digraph problems. - Nadja Betzler; Johannes Uhlmann (Theor. Comput. Sci., 2009)

Probabilistic Possible Winner Determination. - Yoram Bachrach; Nadja Betzler; Piotr Faliszewski (AAAI, 2010)

Eine Multivariate Komplexitätsanalyse von Wahlproblemen. - Nadja Betzler (Ausgezeichnete Informatikdissertationen, 2010)

Partial Kernelization for Rank Aggregation: Theory and Experiments. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier (IPEC, 2010)

On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. - Nadja Betzler (MFCS, 2010)

Parameterized computational complexity of Dodgson and Young elections. - Nadja Betzler; Jiong Guo; Rolf Niedermeier (Inf. Comput., 2010)

Separator-based data reduction for signed graph balancing. - Falk Hüffner; Nadja Betzler; Rolf Niedermeier (J. Comb. Optim., 2010)

Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. - Nadja Betzler; Britta Dorn (J. Comput. Syst. Sci., 2010)

A Multivariate Complexity Analysis of Voting Problems. - Nadja Betzler (2010)

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. - Nadja Betzler; Rolf Niedermeier; Gerhard J. Woeginger (IJCAI, 2011)

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (SOFSEM, 2011)

Average parameterization and partial kernelization for computing medians. - Nadja Betzler; Jiong Guo; Christian Komusiewicz; Rolf Niedermeier (J. Comput. Syst. Sci., 2011)

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. - Nadja Betzler; René van Bevern; Michael R. Fellows; Christian Komusiewicz; Rolf Niedermeier (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. - Nadja Betzler; Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier (The Multivariate Algorithmic Revolution and Beyond, 2012)

On Bounded-Degree Vertex Deletion parameterized by treewidth. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Discret. Appl. Math., 2012)

On the Computation of Fully Proportional Representation. - Nadja Betzler; Arkadii Slinko; Johannes Uhlmann (J. Artif. Intell. Res., 2013)

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2014)

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. - Nadja Betzler; Hans L. Bodlaender; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Algorithmica, 2014)