Frederic Dorn

Publication Activity (10 Years)

Years Active: 2005-2013
Publications (10 Years): 0

Top Topics

Greedy Algorithm

Introduce A General Framework

Top Venues

J. Comput. Syst. Sci.

SIAM J. Discret. Math.

Publications

Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233 (2013)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27 (1) (2013)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Fast Minor Testing in Planar Graphs. Algorithmica 64 (1) (2012)
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. 78 (5) (2012)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412 (50) (2011)
Paul S. Bonsma, Frederic Dorn
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Trans. Algorithms 7 (4) (2011)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Fast Minor Testing in Planar Graphs. ESA (1) (2010)
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS (2010)
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58 (3) (2010)
Frederic Dorn
Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discret. Appl. Math. 158 (7) (2010)
Frederic Dorn
Planar Subgraph Isomorphism Revisited. STACS (2010)
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR (2010)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
Efficient Algorithms for Eulerian Extension. WG (2010)
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
Faster Parameterized Algorithms for Minor Containment. SWAT (2010)
Frederic Dorn
Planar Subgraph Isomorphism Revisited CoRR (2009)
Frederic Dorn, Jan Arne Telle
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discret. Appl. Math. 157 (12) (2009)
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
Subexponential parameterized algorithms. Comput. Sci. Rev. 2 (1) (2008)
Paul S. Bonsma, Frederic Dorn
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems CoRR (2008)
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
-minor-free graphs. SODA (2008)
Paul S. Bonsma, Frederic Dorn
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. ESA (2008)
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
Subexponential Parameterized Algorithms. ICALP (2007)
Paul S. Bonsma, Frederic Dorn
An FPT Algorithm for Directed Spanning k-Leaf CoRR (2007)
Frederic Dorn
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. WG (2007)
Frederic Dorn, Jan Arne Telle
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN (2006)
Frederic Dorn
Dynamic Programming and Fast Matrix Multiplication. ESA (2006)
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT (2006)
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA (2005)
Jochen Alber, Frederic Dorn, Rolf Niedermeier
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discret. Appl. Math. 145 (2) (2005)