 | 2009 |
|---|
| 11 |       | Nadja Betzler,
Michael R. Fellows,
Jiong Guo,
Rolf Niedermeier,
Frances A. Rosamond:
How similarity helps to efficiently compute Kemeny rankings.
AAMAS (1) 2009: 657-664 |
| 10 | | Nadja Betzler,
Susanne Hemmann,
Rolf Niedermeier:
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.
IJCAI 2009: 53-58 |
| 9 | | Nadja Betzler,
Britta Dorn:
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules.
MFCS 2009: 124-136 |
| 2008 |
|---|
| 8 | | Nadja Betzler,
Michael R. Fellows,
Jiong Guo,
Rolf Niedermeier,
Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores.
AAIM 2008: 60-71 |
| 7 | | Nadja Betzler,
Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.
COCOA 2008: 43-53 |
| 6 | | Nadja Betzler,
Michael R. Fellows,
Christian Komusiewicz,
Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
CPM 2008: 31-43 |
| 5 | | Nadja Betzler,
Jiong Guo,
Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections.
SWAT 2008: 402-413 |
| 2007 |
|---|
| 4 | | Falk Hüffner,
Nadja Betzler,
Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing.
WEA 2007: 297-310 |
| 2006 |
|---|
| 3 | | Jochen Alber,
Nadja Betzler,
Rolf Niedermeier:
Experiments on data reduction for optimal domination in networks.
Annals OR 146(1): 105-117 (2006) |
| 2 | | Nadja Betzler,
Rolf Niedermeier,
Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming.
Discrete Optimization 3(3): 220-229 (2006) |
| 2004 |
|---|
| 1 | | Nadja Betzler,
Rolf Niedermeier,
Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.
Electronic Notes in Discrete Mathematics 17: 57-62 (2004) |
