Michael Dom

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Set Cover with Almost Consecutive Ones.
Encyclopedia of Algorithms, 2016

2014
Kernelization Lower Bounds Through Colors and IDs.
ACM Trans. Algorithms, 2014

2012
The Parameterized Complexity of Stabbing Rectangles.
Algorithmica, 2012

2011
Aspects of a multivariate complexity analysis for Rectangle Tiling.
Oper. Res. Lett., 2011

Depth-First Search (Ariadne & Co.).
Proceedings of the Algorithms Unplugged, 2011

2010
Fixed-parameter tractability results for feedback set problems in tournaments.
J. Discrete Algorithms, 2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.
J. Comput. Syst. Sci., 2010

2009
Algorithimic Aspects of the Consecutive-Ones Property.
Bulletin of the EATCS, 2009

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Incompressibility through Colors and IDs.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Tiefensuche (Ariadne und Co.).
Proceedings of the Taschenbuch der Algorithmen, 2008

Set Cover with Almost Consecutive Ones.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Red-blue covering problems and the consecutive ones property.
J. Discrete Algorithms, 2008

Closest 4-leaf power is fixed-parameter tractable.
Discrete Applied Mathematics, 2008

Capacitated Domination and Covering: A Parameterized Perspective.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.
Proceedings of the Theory and Applications of Models of Computation, 2007

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

2006
Error Compensation in Leaf Power Problems.
Algorithmica, 2006

Minimum Membership Set Covering and the Consecutive Ones Property.
Proceedings of the Algorithm Theory, 2006

2005
Extending the Tractability Border for Closest Leaf Powers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Bounded Degree Closest k-Tree Power Is NP-Complete.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Error Compensation in Leaf Root Problems.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004


  Loading...