( en | de | ru )

 

Disambiguation of "Dorn, Frederic"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Minor Testing in Planar Graphs.

, , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 97-109. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frédéric Ruckert

Frédéric Roux

Frederic Orde

Frederic Folwaczny

Frédéric Robin

 

Other publications of authors with the same name

An FPT Algorithm for Directed Spanning k-Leaf, and . CoRR, (2007)Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions., , , and . Algorithmica, 58 (3): 790-810 (2010)Subexponential parameterized algorithms., , and . Comput. Sci. Rev., 2 (1): 29-39 (2008)Faster parameterized algorithms for minor containment., , , , and . Theor. Comput. Sci., 412 (50): 7018-7028 (2011)Catalan structures and dynamic programming in H-minor-free graphs., , and . J. Comput. Syst. Sci., 78 (5): 1606-1622 (2012)Dynamic programming and planarity: Improved tree-decomposition based algorithms.. Discret. Appl. Math., 158 (7): 800-808 (2010)Subexponential Parameterized Algorithms., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 15-27. Springer, (2007)Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 222-233. Springer, (2008)Dynamic Programming and Fast Matrix Multiplication.. ESA, volume 4168 of Lecture Notes in Computer Science, page 280-291. Springer, (2006)Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems, and . CoRR, (2008)