| 2007 |
|---|
| 9 | EE | Joachim Kneis,
Daniel Mölle,
Peter Rossmanith:
Partial vs. Complete Domination: t -Dominating Set.
SOFSEM (1) 2007: 367-376 |
| 8 | EE | Hans-Joachim Böckenhauer,
Juraj Hromkovic,
Joachim Kneis,
Joachim Kupke:
The Parameterized Approximability of TSP with Deadlines.
Theory Comput. Syst. 41(3): 431-444 (2007) |
| 2006 |
|---|
| 7 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Intuitive Algorithms and t-Vertex Cover.
ISAAC 2006: 598-607 |
| 6 | EE | Hans-Joachim Böckenhauer,
Juraj Hromkovic,
Joachim Kneis,
Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP.
SWAT 2006: 184-195 |
| 5 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Divide-and-Color.
WG 2006: 58-67 |
| 4 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Parameterized power domination complexity.
Inf. Process. Lett. 98(4): 145-149 (2006) |
| 2005 |
|---|
| 3 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
On the Parameterized Complexity of Exact Satisfiability Problems.
MFCS 2005: 568-579 |
| 2 | EE | Joachim Kneis,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith:
Algorithms Based on the Treewidth of Sparse Graphs.
WG 2005: 385-396 |
| 2003 |
|---|
| 1 | EE | Jens Gerlach,
Joachim Kneis:
Generic Programming for Scientific Computing in C++, Java, and C#.
APPT 2003: 301-310 |
