| 2010 | ESA | Fast Minor Testing in Planar Graphs. | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | STACS | Planar Subgraph Isomorphism Revisited. | Frederic Dorn |
| 2010 | STACS | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | WG | Efficient Algorithms for Eulerian Extension. | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
| 2008 | ESA | Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. | Paul S. Bonsma, Frederic Dorn |
| 2008 | SODA | Catalan structures and dynamic programming in | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | ICALP | Subexponential Parameterized Algorithms. | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | WG | How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. | Frederic Dorn |
| 2006 | ESA | Dynamic Programming and Fast Matrix Multiplication. | Frederic Dorn |
| 2006 | LATIN | Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. | Frederic Dorn, Jan Arne Telle |
| 2005 | ESA | Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |