Nadja Betzler

发表

Partial Kernelization for Rank Aggregation: Theory and Experiments

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2010, IPEC.

Studies in computational aspects of voting: open problems of downey and fellows

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2012 .

Eine Multivariate Komplexitätsanalyse von Wahlproblemen

Nadja Betzler, 2010, Ausgezeichnete Informatikdissertationen.

Tree decompositions of graphs: Saving memory in dynamic programming

Rolf Niedermeier, Nadja Betzler, Johannes Uhlmann, 2006, Discret. Optim..

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2012, The Multivariate Algorithmic Revolution and Beyond.

On Bounded-Degree Vertex Deletion parameterized by treewidth

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2012, Discret. Appl. Math..

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

Nadja Betzler, Britta Dorn, B. Dorn, 2009, MFCS.

Optimal Edge Deletions for Signed Graph Balancing

Rolf Niedermeier, Nadja Betzler, Falk Hüffner, 2007, WEA.

Average parameterization and partial kernelization for computing medians

Christian Komusiewicz, Rolf Niedermeier, Nadja Betzler, 2010, J. Comput. Syst. Sci..

Tree decompositions of graphs: Saving memory in dynamic programming

Rolf Niedermeier, Nadja Betzler, Johannes Uhlmann, 2004, Discret. Optim..

Steiner Tree Problems in the Analysis of Biological Networks

Nadja Betzler, Nadja Betzler, 2006 .

On the Computation of Fully Proportional Representation

Nadja Betzler, Arkadii M. Slinko, Johannes Uhlmann, 2011, J. Artif. Intell. Res..

Fixed-Parameter Algorithms for Kemeny Scores

Rolf Niedermeier, Michael R. Fellows, Nadja Betzler, 2008, AAIM.

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2014, Algorithmica.

Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems

Nadja Betzler, Johannes Uhlmann, 2008, COCOA.

A Multivariate Complexity Analysis of Voting Problems

Nadja Betzler, Nadja Betzler, 2011 .

Parameterized complexity of candidate control in elections and related digraph problems

Nadja Betzler, Johannes Uhlmann, Johannes Uhlmann, 2008, Theor. Comput. Sci..

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard

Gerhard J. Woeginger, Rolf Niedermeier, Nadja Betzler, 2011, IJCAI.

Parameterized computational complexity of Dodgson and Young elections

Rolf Niedermeier, Nadja Betzler, Jiong Guo, 2008, Inf. Comput..

Fixed-parameter algorithms for Kemeny rankings

Rolf Niedermeier, Michael R. Fellows, Nadja Betzler, 2009, Theor. Comput. Sci..

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2011, Algorithmica.

Parameterized computational complexity of Dodgson and Young elections

Rolf Niedermeier, Nadja Betzler, Jiong Guo, 2010, Inf. Comput..

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

Nadja Betzler, Britta Dorn, B. Dorn, 2009, J. Comput. Syst. Sci..

A logic for causal reasoning

Rolf Niedermeier, Nadja Betzler, Susanne Hemmann, 2003, IJCAI 2003.

Experiments on data reduction for optimal domination in networks

Rolf Niedermeier, Nadja Betzler, Jochen Alber, 2006, Ann. Oper. Res..

Separator-based data reduction for signed graph balancing

Rolf Niedermeier, Nadja Betzler, Falk Hüffner, 2010, J. Comb. Optim..

Computing Kemeny rankings, parameterized by the average K-T distance

Michael R. Fellows, Nadja Betzler, Frances A. Rosamond, 2008 .

Average parameterization and partial kernelization for computing medians

Christian Komusiewicz, Rolf Niedermeier, Nadja Betzler, 2011, J. Comput. Syst. Sci..

Probabilistic Possible Winner Determination

Piotr Faliszewski, Nadja Betzler, Yoram Bachrach, 2010, AAAI.

On Problem Kernels for Possible Winner Determination under the k-Approval Protocol

Nadja Betzler, 2010, MFCS.

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks

Christian Komusiewicz, Rolf Niedermeier, René van Bevern, 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Fixed-Parameter Algo Algorithms for Kemeny Scores

Rolf Niedermeier, Michael R. Fellows, Nadja Betzler, 2008 .

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

Rolf Niedermeier, Nadja Betzler, Robert Bredereck, 2014, Autonomous Agents and Multi-Agent Systems.

Rolf Niedermeier, Michael R. Fellows, Nadja Betzler, 2009, AAMAS.

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Christian Komusiewicz, Rolf Niedermeier, Michael R. Fellows, 2008, CPM.