 | 2012 |
| 25 |  | Isolde Adler,
Frederic Dorn,
Fedor V. Fomin,
Ignasi Sau,
Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs.
Algorithmica 64(1): 69-84 (2012) |
| 2011 |
| 24 |  | Paul Bonsma,
Frederic Dorn:
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree.
ACM Transactions on Algorithms 7(4): 44 (2011) |
| 23 |  | Isolde Adler,
Frederic Dorn,
Fedor V. Fomin,
Ignasi Sau,
Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment.
Theor. Comput. Sci. 412(50): 7018-7028 (2011) |
| 2010 |
| 22 |  | Isolde Adler,
Frederic Dorn,
Fedor V. Fomin,
Ignasi Sau,
Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs.
ESA (1) 2010: 97-109 |
| 21 |  | Frederic Dorn,
Fedor V. Fomin,
Daniel Lokshtanov,
Venkatesh Raman,
Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.
STACS 2010: 251-262 |
| 20 |  | Frederic Dorn:
Planar Subgraph Isomorphism Revisited.
STACS 2010: 263-274 |
| 19 |  | Isolde Adler,
Frederic Dorn,
Fedor V. Fomin,
Ignasi Sau,
Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment.
SWAT 2010: 322-333 |
| 18 |  | Frederic Dorn,
Hannes Moser,
Rolf Niedermeier,
Mathias Weller:
Efficient Algorithms for Eulerian Extension.
WG 2010: 100-111 |
| 17 |  | Frederic Dorn,
Eelko Penninkx,
Hans L. Bodlaender,
Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.
Algorithmica 58(3): 790-810 (2010) |
| 16 |  | Frederic Dorn,
Fedor V. Fomin,
Daniel Lokshtanov,
Venkatesh Raman,
Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
CoRR abs/1001.0821: (2010) |
| 15 |  | Frederic Dorn:
Dynamic programming and planarity: Improved tree-decomposition based algorithms.
Discrete Applied Mathematics 158(7): 800-808 (2010) |
| 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) |