default search action
Michael Dom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [r2]Michael Dom:
Set Cover with Almost Consecutive Ones. Encyclopedia of Algorithms 2016: 1960-1963 - 2014
- [j9]Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms 11(2): 13:1-13:20 (2014) - 2012
- [j8]Michael Dom, Michael R. Fellows
, Frances A. Rosamond
The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2): 564-594 (2012) - 2011
- [j7]André Nichterlein, Michael Dom, Rolf Niedermeier:
Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. 39(5): 346-351 (2011) - [p2]Michael Dom, Falk Hüffner
Depth-First Search (Ariadne & Co.). Algorithms Unplugged 2011: 57-68 - 2010
- [j6]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. 76(3-4): 204-221 (2010) - [j5]Michael Dom, Jiong Guo, Falk Hüffner
Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1): 76-86 (2010)
2000 – 2009
- 2009
- [j4]Michael Dom:
Algorithimic Aspects of the Consecutive-Ones Property. Bull. EATCS 98: 27-59 (2009) - [c11]Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Incompressibility through Colors and IDs. ICALP (1) 2009: 378-389 - [c10]Michael Dom, Michael R. Fellows
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309 - 2008
- [j3]Michael Dom, Jiong Guo, Falk Hüffner
Closest 4-leaf power is fixed-parameter tractable. Discret. Appl. Math. 156(18): 3345-3361 (2008) - [j2]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008) - [c9]Michael Dom, Somnath Sikdar:
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. FAW 2008: 288-299 - [c8]Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90 - [p1]Michael Dom, Falk Hüffner
Tiefensuche (Ariadne und Co.). Taschenbuch der Algorithmen 2008: 61-73 - [r1]Michael Dom:
Set Cover with Almost Consecutive Ones. Encyclopedia of Algorithms 2008 - 2007
- [c7]Michael Dom:
Compact Routing. Algorithms for Sensor and Ad Hoc Networks 2007: 187-202 - [c6]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691 - 2006
- [j1]Michael Dom, Jiong Guo, Falk Hüffner
Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006) - [c5]Michael Dom, Jiong Guo, Falk Hüffner
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. CIAC 2006: 320-331 - [c4]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350 - 2005
- [c3]Michael Dom, Jiong Guo, Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766 - [c2]Michael Dom, Jiong Guo, Falk Hüffner
Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408 - 2004
- [c1]Michael Dom, Jiong Guo, Falk Hüffner
Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: