Error Compensation in Leaf Root Problems. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (ISAAC, 2004)

Bounded Degree Closest k-Tree Power Is NP-Complete. - Michael Dom; Jiong Guo; Rolf Niedermeier (COCOON, 2005)

Extending the Tractability Border for Closest Leaf Powers. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (WG, 2005)

Minimum Membership Set Covering and the Consecutive Ones Property. - Michael Dom; Jiong Guo; Rolf Niedermeier; Sebastian Wernicke 001 (SWAT, 2006)

Error Compensation in Leaf Power Problems. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Algorithmica, 2006)

Compact Routing. - Michael Dom (Algorithms for Sensor and Ad Hoc Networks, 2007)

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. - Michael Dom; Jiong Guo; Rolf Niedermeier (TAMC, 2007)

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. - Michael Dom; Somnath Sikdar (FAW, 2008)

Capacitated Domination and Covering: A Parameterized Perspective. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (IWPEC, 2008)

Closest 4-leaf power is fixed-parameter tractable. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Discret. Appl. Math., 2008)

Red-blue covering problems and the consecutive ones property. - Michael Dom; Jiong Guo; Rolf Niedermeier; Sebastian Wernicke 001 (J. Discrete Algorithms, 2008)

Set Cover with Almost Consecutive Ones. - Michael Dom (Encyclopedia of Algorithms, 2008)

Tiefensuche (Ariadne und Co.). - Michael Dom; Falk Hüffner; Rolf Niedermeier (Taschenbuch der Algorithmen, 2008)

Incompressibility through Colors and IDs. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001 (ICALP (1), 2009)

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. - Michael Dom; Michael R. Fellows; Frances A. Rosamond (WALCOM, 2009)

Algorithimic Aspects of the Consecutive-Ones Property. - Michael Dom (Bull. EATCS, 2009)

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. - Michael Dom; Jiong Guo; Rolf Niedermeier (J. Comput. Syst. Sci., 2010)

Fixed-parameter tractability results for feedback set problems in tournaments. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier; Anke Truß (J. Discrete Algorithms, 2010)

Depth-First Search (Ariadne & Co.). - Michael Dom; Falk Hüffner; Rolf Niedermeier (Algorithms Unplugged, 2011)

Aspects of a multivariate complexity analysis for Rectangle Tiling. - André Nichterlein; Michael Dom; Rolf Niedermeier (Oper. Res. Lett., 2011)

The Parameterized Complexity of Stabbing Rectangles. - Michael Dom; Michael R. Fellows; Frances A. Rosamond; Somnath Sikdar (Algorithmica, 2012)

Kernelization Lower Bounds Through Colors and IDs. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 2014)

Set Cover with Almost Consecutive Ones. - Michael Dom (Encyclopedia of Algorithms, 2016)