| 2008 |
|---|
| 11 | EE | Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.
Theory Comput. Syst. 43(2): 234-253 (2008) |
| 2007 |
|---|
| 10 | EE | Joachim Kneis,
Daniel Mölle,
Peter Rossmanith:
Partial vs. Complete Domination: t-Dominating Set.
SOFSEM (1) 2007: 367-376 |
| 9 | EE | Bernhard Fuchs,
Walter Kern,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith,
Xinhui Wang:
Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst. 41(3): 493-500 (2007) |
| 2006 |
|---|
| 8 | EE | Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.
COCOON 2006: 265-273 |
| 7 | EE | Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.
CSR 2006: 270-280 |
| 6 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Intuitive Algorithms and t-Vertex Cover.
ISAAC 2006: 598-607 |
| 5 | EE | Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
A Faster Algorithm for the Steiner Tree Problem.
STACS 2006: 561-570 |
| 4 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Divide-and-Color.
WG 2006: 58-67 |
| 3 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Parameterized power domination complexity.
Inf. Process. Lett. 98(4): 145-149 (2006) |
| 2005 |
|---|
| 2 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
On the Parameterized Complexity of Exact Satisfiability Problems.
MFCS 2005: 568-579 |
| 1 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Algorithms Based on the Treewidth of Sparse Graphs.
WG 2005: 385-396 |
