Nadja Betzler

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