Nadja Betzler

Publication Activity (10 Years)

Years Active: 2004-2014
Publications (10 Years): 0

Top Venues

Auton. Agents Multi Agent Syst.

CoRR

Discret. Appl. Math.

J. Artif. Intell. Res.

Friedrich Schiller University of Jena (PHD)

Education History

Friedrich Schiller University of Jena

PHD

Publications

Nadja Betzler, Arkadii Slinko, Johannes Uhlmann
On the Computation of Fully Proportional Representation. CoRR (2014)
Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68 (3) (2014)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agents Multi Agent Syst. 28 (5) (2014)
Nadja Betzler, Arkadii Slinko, Johannes Uhlmann
On the Computation of Fully Proportional Representation. J. Artif. Intell. Res. 47 (2013)
Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond (2012)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160 (1-2) (2012)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM (2011)
Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77 (4) (2011)
Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI (2011)
Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (5) (2011)
Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
Average Parameterization and Partial Kernelization for Computing Medians. LATIN (2010)
Nadja Betzler
Eine Multivariate Komplexitätsanalyse von Wahlproblemen. Ausgezeichnete Informatikdissertationen (2010)
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20 (4) (2010)
Nadja Betzler, Jiong Guo, Rolf Niedermeier
Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208 (2) (2010)
Nadja Betzler
-Approval Protocol. MFCS (2010)
Nadja Betzler, Britta Dorn
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. J. Comput. Syst. Sci. 76 (8) (2010)
Yoram Bachrach, Nadja Betzler, Piotr Faliszewski
Probabilistic Possible Winner Determination. AAAI (2010)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC (2010)
Nadja Betzler, Susanne Hemmann, Rolf Niedermeier
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI (2009)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) (2009)
Nadja Betzler, Britta Dorn
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules CoRR (2009)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410 (45) (2009)
Nadja Betzler, Britta Dorn
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. MFCS (2009)
Nadja Betzler, Johannes Uhlmann
Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410 (52) (2009)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
Fixed-Parameter Algorithms for Kemeny Scores. AAIM (2008)
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM (2008)
Nadja Betzler, Jiong Guo, Rolf Niedermeier
Parameterized Computational Complexity of Dodgson and Young Elections. SWAT (2008)
Nadja Betzler, Johannes Uhlmann
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA (2008)
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
Optimal Edge Deletions for Signed Graph Balancing. WEA (2007)
Jochen Alber, Nadja Betzler, Rolf Niedermeier
Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. 146 (1) (2006)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3 (3) (2006)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. 17 (2004)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW (2004)

Nadja Betzler.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nadja Betzler