 | 2009 |
|---|
| 14 |       | Frederic Dorn:
Planar Subgraph Isomorphism Revisited
CoRR abs/0909.4692: (2009) |
| 13 | | Frederic Dorn,
Jan Arne Telle:
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.
Discrete Applied Mathematics 157(12): 2737-2746 (2009) |
| 2008 |
|---|
| 12 | | Paul S. Bonsma,
Frederic Dorn:
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.
ESA 2008: 222-233 |
| 11 | | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs.
SODA 2008: 631-640 |
| 10 | | Paul S. Bonsma,
Frederic Dorn:
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
CoRR abs/0804.2032: (2008) |
| 9 | | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms.
Computer Science Review 2(1): 29-39 (2008) |
| 2007 |
|---|
| 8 | | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms.
ICALP 2007: 15-27 |
| 7 | | Frederic Dorn:
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.
WG 2007: 280-291 |
| 6 | | Paul S. Bonsma,
Frederic Dorn:
An FPT Algorithm for Directed Spanning k-Leaf
CoRR abs/0711.4052: (2007) |
| 2006 |
|---|
| 5 | | Frederic Dorn:
Dynamic Programming and Fast Matrix Multiplication.
ESA 2006: 280-291 |
| 4 | | Frederic Dorn,
Jan Arne Telle:
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.
LATIN 2006: 386-397 |
| 3 | | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
SWAT 2006: 172-183 |
| 2005 |
|---|
| 2 | | Frederic Dorn,
Eelko Penninkx,
Hans L. Bodlaender,
Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
ESA 2005: 95-106 |
| 1 | | Jochen Alber,
Frederic Dorn,
Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.
Discrete Applied Mathematics 145(2): 219-231 (2005) |
