| 2008 |
|---|
| 10 | EE | Michael Dom,
Somnath Sikdar:
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.
FAW 2008: 288-299 |
| 9 | EE | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh,
Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective.
IWPEC 2008: 78-90 |
| 2007 |
|---|
| 8 | EE | Michael Dom:
Compact Routing.
Algorithms for Sensor and Ad Hoc Networks 2007: 187-202 |
| 7 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.
TAMC 2007: 680-691 |
| 2006 |
|---|
| 6 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier,
Anke Truß:
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.
CIAC 2006: 320-331 |
| 5 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property.
SWAT 2006: 339-350 |
| 4 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Power Problems.
Algorithmica 44(4): 363-381 (2006) |
| 2005 |
|---|
| 3 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete.
COCOON 2005: 757-766 |
| 2 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers.
WG 2005: 397-408 |
| 2004 |
|---|
| 1 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Root Problems.
ISAAC 2004: 389-401 |
