Michael Dom

According to our database, Michael Dom authored at least 23 papers between 2004 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Set Cover with Almost Consecutive Ones.

Michael Dom

Encyclopedia of Algorithms, 2016

2014

Kernelization Lower Bounds Through Colors and IDs.

Michael Dom, Daniel Lokshtanov, Saket Saurabh

ACM Trans. Algorithms, 2014

2012

The Parameterized Complexity of Stabbing Rectangles.

Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar

Algorithmica, 2012

2011

Aspects of a multivariate complexity analysis for Rectangle Tiling.

André Nichterlein, Michael Dom, Rolf Niedermeier

Oper. Res. Lett., 2011

Depth-First Search (Ariadne & Co.).

Michael Dom, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms Unplugged, 2011

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

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.

Michael Dom, Jiong Guo, Rolf Niedermeier

J. Comput. Syst. Sci., 2010

2009

Algorithimic Aspects of the Consecutive-Ones Property.

Michael Dom

Bull. EATCS, 2009

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.

Michael Dom, Michael R. Fellows, Frances A. Rosamond

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Incompressibility through Colors and IDs.

Michael Dom, Daniel Lokshtanov, Saket Saurabh

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Tiefensuche (Ariadne und Co.).

Michael Dom, Falk Hüffner, Rolf Niedermeier

Proceedings of the Taschenbuch der Algorithmen, 2008

Set Cover with Almost Consecutive Ones.

Michael Dom

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Red-blue covering problems and the consecutive ones property.

Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke

J. Discrete Algorithms, 2008

Closest 4-leaf power is fixed-parameter tractable.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Discret. Appl. Math., 2008

Capacitated Domination and Covering: A Parameterized Perspective.

Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.

Michael Dom, Somnath Sikdar

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.

Michael Dom, Jiong Guo, Rolf Niedermeier

Proceedings of the Theory and Applications of Models of Computation, 2007

Compact Routing.

Michael Dom

Proceedings of the Algorithms for Sensor and Ad Hoc Networks, 2007

2006

Error Compensation in Leaf Power Problems.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Algorithmica, 2006

Minimum Membership Set Covering and the Consecutive Ones Property.

Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke

Proceedings of the Algorithm Theory, 2006

2005

Extending the Tractability Border for Closest Leaf Powers.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Bounded Degree Closest <i>k</i>-Tree Power Is NP-Complete.

Michael Dom, Jiong Guo, Rolf Niedermeier

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Error Compensation in Leaf Root Problems.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004