 | 2012 |
| 22 |  | Michael Dom,
Michael R. Fellows,
Frances A. Rosamond,
Somnath Sikdar:
The Parameterized Complexity of Stabbing Rectangles.
Algorithmica 62(1-2): 564-594 (2012) |
| 2011 |
| 21 |  | Michael Dom,
Falk Hüffner,
Rolf Niedermeier:
Depth-First Search (Ariadne & Co.).
Algorithms Unplugged 2011: 57-68 |
| 20 |  | André Nichterlein,
Michael Dom,
Rolf Niedermeier:
Aspects of a multivariate complexity analysis for Rectangle Tiling.
Oper. Res. Lett. 39(5): 346-351 (2011) |
| 2010 |
| 19 |  | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.
J. Comput. Syst. Sci. 76(3-4): 204-221 (2010) |
| 18 |  | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier,
Anke Truß:
Fixed-parameter tractability results for feedback set problems in tournaments.
J. Discrete Algorithms 8(1): 76-86 (2010) |
| 2009 |
| 17 |  | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh:
Incompressibility through Colors and IDs.
ICALP (1) 2009: 378-389 |
| 16 |  | Michael Dom,
Michael R. Fellows,
Frances A. Rosamond:
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
WALCOM 2009: 298-309 |
| 15 |  | Michael Dom:
Algorithimic Aspects of the Consecutive-Ones Property.
Bulletin of the EATCS 98: 27-59 (2009) |
| 2008 |
| 14 |  | Michael Dom,
Somnath Sikdar:
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.
FAW 2008: 288-299 |
| 13 |  | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh,
Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective.
IWPEC 2008: 78-90 |
| 12 |  | Michael Dom:
Set Cover with Almost Consecutive Ones.
Encyclopedia of Algorithms 2008 |
| 11 |  | Michael Dom,
Falk Hüffner,
Rolf Niedermeier:
Tiefensuche (Ariadne und Co.).
Taschenbuch der Algorithmen 2008: 61-73 |
| 10 |  | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Closest 4-leaf power is fixed-parameter tractable.
Discrete Applied Mathematics 156(18): 3345-3361 (2008) |
| 9 |  | Michael Dom,
Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property.
J. Discrete Algorithms 6(3): 393-407 (2008) |
| 2007 |
| 8 |  | Michael Dom:
Compact Routing.
Algorithms for Sensor and Ad Hoc Networks 2007: 187-202 |
| 7 |  | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.
TAMC 2007: 680-691 |
| 2006 |
| 6 |  | 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 |  | Michael Dom,
Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property.
SWAT 2006: 339-350 |
| 4 |  | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Power Problems.
Algorithmica 44(4): 363-381 (2006) |
| 2005 |
| 3 |  | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete.
COCOON 2005: 757-766 |
| 2 |  | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers.
WG 2005: 397-408 |
| 2004 |
| 1 |  | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Root Problems.
ISAAC 2004: 389-401 |