The SCEAS System
Navigation Menu

Search the dblp DataBase


Frederic Dorn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frederic Dorn
    Dynamic Programming and Fast Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:280-291 [Conf]
  2. Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
    Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:95-106 [Conf]
  3. Frederic Dorn, Jan Arne Telle
    Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:386-397 [Conf]
  4. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:172-183 [Conf]
  5. Jochen Alber, Frederic Dorn, Rolf Niedermeier
    Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:219-231 [Journal]
  6. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Subexponential Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:15-27 [Conf]

  7. Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. [Citation Graph (, )][DBLP]

  8. Fast Minor Testing in Planar Graphs. [Citation Graph (, )][DBLP]

  9. Catalan structures and dynamic programming in H-minor-free graphs. [Citation Graph (, )][DBLP]

  10. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]

  11. Planar Subgraph Isomorphism Revisited. [Citation Graph (, )][DBLP]

  12. Faster Parameterized Algorithms for Minor Containment. [Citation Graph (, )][DBLP]

  13. How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. [Citation Graph (, )][DBLP]

  14. An FPT Algorithm for Directed Spanning k-Leaf [Citation Graph (, )][DBLP]

  15. Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems [Citation Graph (, )][DBLP]

  16. Planar Subgraph Isomorphism Revisited [Citation Graph (, )][DBLP]

  17. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [Citation Graph (, )][DBLP]

  18. Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. [Citation Graph (, )][DBLP]

  19. Dynamic programming and planarity: Improved tree-decomposition based algorithms. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002