Michael Dom

Friedrich Schiller University Jena — Germany

Computer Science · Physical Sciences

13h-index784citations28works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(16), Complexity and Algorithms in Graphs(14), Graph Labeling and Dimension Problems(6), Computational Geometry and Mesh Generation(4), graph theory and CDMA systems(4)

Publications28 total

Set Cover with Almost Consecutive Ones
Encyclopedia of Algorithms·2016· 1 cited
Kernelization Lower Bounds Through Colors and IDs
ACM Transactions on Algorithms·2014· 130 cited
Aspects of a multivariate complexity analysis for Rectangle Tiling
Operations Research Letters·2011· 2 cited
Depth-First Search (Ariadne & Co.)
2010
The Parameterized Complexity of Stabbing Rectangles
Algorithmica·2010· 7 cited
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms·2009· 96 cited
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences·2009· 27 cited
Algorithimic Aspects of the Consecutive-Ones Property.
Bulletin of the European Association for Theoretical Computer Science·2009· 27 cited
Incompressibility through Colors and IDs
Lecture notes in computer science·2009· 179 cited
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
Lecture notes in computer science·2009· 19 cited
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
Lecture notes in computer science·2008· 7 cited
Capacitated Domination and Covering: A Parameterized Perspective
Lecture notes in computer science·2008· 73 cited
Tiefensuche (Ariadne und Co.)
eXamen.press·2008
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics·2008· 9 cited
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms·2008· 14 cited
Set Cover with Almost Consecutive Ones
Encyclopedia of Algorithms·2008
Compact Routing
Lecture notes in computer science·2007· 1 cited
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Lecture notes in computer science·2007· 11 cited
Local T/M‐Phase Amount Determination in the Vicinity of Indentations and Scratches in Zirconia
Ceramic transactions /Ceramic transactions·2006· 2 cited
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Lecture notes in computer science·2006· 61 cited
page 1 of 2Next →

Frequent Co-authors

Rolf Niedermeier(16), Jiong Guo(11), Falk Hüffner(9), Daniel Lokshtanov(3), Saket Saurabh(3), Anke Truß(3), Sebastian Wernicke(3), Michael R. Fellows(2), Frances Rosamond(2), Somnath Sikdar(2), Jiaxing Guo(2), Yngve Villanger(1), Harald Sack(1), Uwe Krüger(1), André Nichterlein(1), Klaus G. Nickel(1)