The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael Dom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
    Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:320-331 [Conf]
  2. Michael Dom, Jiong Guo, Rolf Niedermeier
    Bounded Degree Closest k-Tree Power Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:757-766 [Conf]
  3. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Error Compensation in Leaf Root Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:389-401 [Conf]
  4. Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Minimum Membership Set Covering and the Consecutive Ones Property. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:339-350 [Conf]
  5. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Extending the Tractability Border for Closest Leaf Powers. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:397-408 [Conf]
  6. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Error Compensation in Leaf Power Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:363-381 [Journal]
  7. Michael Dom
    Compact Routing. [Citation Graph (0, 0)][DBLP]
    Algorithms for Sensor and Ad Hoc Networks, 2007, pp:187-202 [Conf]
  8. Michael Dom, Jiong Guo, Rolf Niedermeier
    Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:680-691 [Conf]

  9. Incompressibility through Colors and IDs. [Citation Graph (, )][DBLP]


  10. Capacitated Domination and Covering: A Parameterized Perspective. [Citation Graph (, )][DBLP]


  11. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. [Citation Graph (, )][DBLP]


  12. The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. [Citation Graph (, )][DBLP]


  13. Closest 4-leaf power is fixed-parameter tractable. [Citation Graph (, )][DBLP]


Search in 0.161secs, Finished in 0.162secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002