| 2008 |
|---|
| 8 | EE | Nadja Betzler,
Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.
COCOA 2008: 43-53 |
| 7 | EE | Christian Komusiewicz,
Johannes Uhlmann:
A Cubic-Vertex Kernel for Flip Consensus Tree.
FSTTCS 2008 |
| 6 | EE | Jiong Guo,
Falk Hüffner,
Erhan Kenar,
Rolf Niedermeier,
Johannes Uhlmann:
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
European Journal of Operational Research 186(2): 542-553 (2008) |
| 5 | EE | Jiong Guo,
Rolf Niedermeier,
Johannes Uhlmann:
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.
Inf. Process. Lett. 106(2): 81-86 (2008) |
| 2007 |
|---|
| 4 | EE | Jiong Guo,
Johannes Uhlmann:
Kernelization and Complexity Results for Connectivity Augmentation Problems.
WADS 2007: 483-494 |
| 2006 |
|---|
| 3 | EE | Jiong Guo,
Falk Hüffner,
Erhan Kenar,
Rolf Niedermeier,
Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut.
SOFSEM 2006: 303-312 |
| 2 | EE | Nadja Betzler,
Rolf Niedermeier,
Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming.
Discrete Optimization 3(3): 220-229 (2006) |
| 2004 |
|---|
| 1 | EE | Nadja Betzler,
Rolf Niedermeier,
Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.
Electronic Notes in Discrete Mathematics 17: 57-62 (2004) |
