Frederic Dorn

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