Michael Dom

Available identifiers

Publication	Date of Publication	Type
Kernelization Lower Bounds Through Colors and IDs	2018-10-30	Paper
The parameterized complexity of stabbing rectangles	2012-04-26	Paper
Aspects of a multivariate complexity analysis for rectangle tiling	2012-04-05	Paper
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems	2010-05-25	Paper
Fixed-parameter tractability results for feedback set problems in tournaments	2010-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q3397627	2009-09-22	Paper
Incompressibility through Colors and IDs	2009-07-14	Paper
Red-blue covering problems and the consecutive ones property	2009-05-13	Paper
Closest 4-leaf power is fixed-parameter tractable	2009-03-04	Paper
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane	2009-02-24	Paper
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants	2008-06-19	Paper
Capacitated Domination and Covering: A Parameterized Perspective	2008-06-05	Paper
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems	2007-11-13	Paper
Minimum Membership Set Covering and the Consecutive Ones Property	2007-09-07	Paper
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments	2007-05-02	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
Error compensation in leaf power problems	2006-08-16	Paper
Computing and Combinatorics	2006-01-11	Paper
Algorithms and Computation	2005-12-22	Paper

This page was built for person: Michael Dom