Search results for "Michael Dom"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar	The Parameterized Complexity of Stabbing Rectangles.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	André Nichterlein, Michael Dom, Rolf Niedermeier	Aspects of a multivariate complexity analysis for Rectangle Tiling.	Oper. Res. Lett.	2011	DBLP DOI BibTeX RDF
1	Michael Dom, Falk Hüffner, Rolf Niedermeier	Depth-First Search (Ariadne & Co.).	Algorithms Unplugged	2011	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Rolf Niedermeier	Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß	Fixed-parameter tractability results for feedback set problems in tournaments.	J. Discrete Algorithms	2010	DBLP DOI BibTeX RDF
1	Michael Dom	Algorithimic Aspects of the Consecutive-Ones Property.	Bulletin of the EATCS	2009	DBLP BibTeX RDF
1	Michael Dom, Daniel Lokshtanov, Saket Saurabh	Incompressibility through Colors and IDs.	ICALP	2009	DBLP DOI BibTeX RDF
1	Michael Dom, Michael R. Fellows, Frances A. Rosamond	Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Closest 4-leaf power is fixed-parameter tractable.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke	Red-blue covering problems and the consecutive ones property.	J. Discrete Algorithms	2008	DBLP DOI BibTeX RDF
1	Michael Dom	Set Cover with Almost Consecutive Ones.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Michael Dom, Falk Hüffner, Rolf Niedermeier	Tiefensuche (Ariadne und Co.).	Taschenbuch der Algorithmen	2008	DBLP DOI BibTeX RDF
1	Michael Dom, Somnath Sikdar	The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.	FAW	2008	DBLP DOI BibTeX RDF
1	Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger	Capacitated Domination and Covering: A Parameterized Perspective.	IWPEC	2008	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Rolf Niedermeier	Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.	TAMC	2007	DBLP DOI BibTeX RDF
1	Michael Dom	Compact Routing.	Algorithms for Sensor and Ad Hoc Networks	2007	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Error Compensation in Leaf Power Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Graph modification, Forbidden subgraph characterization, NP-completeness, Graph algorithms, Fixed-parameter tractability, Leaf power, Graph power
1	Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke	Minimum Membership Set Covering and the Consecutive Ones Property.	SWAT	2006	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß	Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.	CIAC	2006	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Extending the Tractability Border for Closest Leaf Powers.	WG	2005	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Rolf Niedermeier	Bounded Degree Closest k-Tree Power Is NP-Complete.	COCOON	2005	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Error Compensation in Leaf Root Problems.	ISAAC	2004	DBLP DOI BibTeX RDF

Publications of "Michael Dom" ( http://dblp.L3S.de/Authors/Michael_Dom )