Frederic Dorn

According to our database, Frederic Dorn authored at least 21 papers between 2005 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Efficient Algorithms for Eulerian Extension and Rural Postman.

Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller

SIAM J. Discret. Math., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.

Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Inf. Comput., 2013

2012

Catalan structures and dynamic programming in H-minor-free graphs.

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos

J. Comput. Syst. Sci., 2012

Fast Minor Testing in Planar Graphs.

Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos

Algorithmica, 2012

2011

Faster parameterized algorithms for minor containment.

Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos

Theor. Comput. Sci., 2011

Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree.

Paul S. Bonsma, Frederic Dorn

ACM Trans. Algorithms, 2011

2010

Dynamic programming and planarity: Improved tree-decomposition based algorithms.

Frederic Dorn

Discret. Appl. Math., 2010

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.

Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin

Algorithmica, 2010

Efficient Algorithms for Eulerian Extension.

Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Planar Subgraph Isomorphism Revisited.

Frederic Dorn

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.

Frederic Dorn, Jan Arne Telle

Discret. Appl. Math., 2009

2008

Subexponential parameterized algorithms.

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos

Comput. Sci. Rev., 2008

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Paul S. Bonsma, Frederic Dorn

CoRR, 2008

Catalan structures and dynamic programming in <i>H</i>-minor-free graphs.

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

An FPT Algorithm for Directed Spanning k-Leaf

Paul S. Bonsma, Frederic Dorn

CoRR, 2007

How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.

Frederic Dorn

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos

Proceedings of the Algorithm Theory, 2006

Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.

Frederic Dorn, Jan Arne Telle

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Dynamic Programming and Fast Matrix Multiplication.

Frederic Dorn

Proceedings of the Algorithms, 2006

2005

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.

Jochen Alber, Frederic Dorn, Rolf Niedermeier

Discret. Appl. Math., 2005

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.

Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin

Proceedings of the Algorithms, 2005