Nadja Betzler

According to our database, Nadja Betzler authored at least 27 papers between 2004 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.

Nadja Betzler, Robert Bredereck, Rolf Niedermeier

Auton. Agents Multi Agent Syst., 2014

2013

On the Computation of Fully Proportional Representation.

Nadja Betzler, Arkadii Slinko, Johannes Uhlmann

J. Artif. Intell. Res., 2013

2012

On Bounded-Degree Vertex Deletion parameterized by treewidth.

Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann

Discret. Appl. Math., 2012

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.

Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

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

Average parameterization and partial kernelization for computing medians.

Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier

J. Comput. Syst. Sci., 2011

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.

Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.

Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger

Proceedings of the IJCAI 2011, 2011

2010

A Multivariate Complexity Analysis of Voting Problems.

Nadja Betzler

PhD thesis, 2010

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

Nadja Betzler, Britta Dorn

J. Comput. Syst. Sci., 2010

Separator-based data reduction for signed graph balancing.

Falk Hüffner, Nadja Betzler, Rolf Niedermeier

J. Comb. Optim., 2010

Parameterized computational complexity of Dodgson and Young elections.

Nadja Betzler, Jiong Guo, Rolf Niedermeier

Inf. Comput., 2010

On Problem Kernels for Possible Winner Determination under the <i>k</i>-Approval Protocol.

Nadja Betzler

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Partial Kernelization for Rank Aggregation: Theory and Experiments.

Nadja Betzler, Robert Bredereck, Rolf Niedermeier

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Eine Multivariate Komplexitätsanalyse von Wahlproblemen.

Nadja Betzler

Proceedings of the Ausgezeichnete Informatikdissertationen 2010, 2010

Probabilistic Possible Winner Determination.

Yoram Bachrach, Nadja Betzler, Piotr Faliszewski

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Parameterized complexity of candidate control in elections and related digraph problems.

Nadja Betzler, Johannes Uhlmann

Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Theor. Comput. Sci., 2009

Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules.

Nadja Betzler, Britta Dorn

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.

Nadja Betzler, Susanne Hemmann, Rolf Niedermeier

Proceedings of the IJCAI 2009, 2009

How similarity helps to efficiently compute Kemeny rankings.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.

Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Fixed-Parameter Algorithms for Kemeny Scores.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Optimal Edge Deletions for Signed Graph Balancing.

Falk Hüffner, Nadja Betzler, Rolf Niedermeier

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006

Experiments on data reduction for optimal domination in networks.

Jochen Alber, Nadja Betzler, Rolf Niedermeier

Ann. Oper. Res., 2006

2004

Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.

Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann

Electron. Notes Discret. Math., 2004