Frederic Dorn
email: firstname[dot]surname[at]ii[dot]uib[dot]no
My CV
My Supervisor is Fedor Fomin
I am member of the Algorithms group in Bergen, Norway.
Dissertation:
Frederic Dorn:
Designing Subexponential Algorithms: Problems, Techniques & Structures.
July 2007.pdf-file (150 pages)
Conference Article:
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos: Catalan Structures and Dynamic Programming in H-minor-free graphs.
SODA 2008, to appear.
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos:
Subexponential parameterized algorithms.
Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007,survey), vol. 4596 of LNCS, Springer, 2007, pages 15-27.pdf-file
Frederic Dorn:
How to use planarity efficiently: new tree-decomposition based algorithms.
33rd International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2007), vol.4769 of LNCS, Springer, 2007, pages 280-291.pdf-file
Frederic Dorn:
Dynamic Programming and Fast Matrix Multiplication.
ESA 2006 Best student paper award, Proceedings of 14th Annual European Symposium (Algorithms/ESA 2006), Springer LNCS 4168, pages 280-291.pdf-file
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Proceedings of 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), Springer LNCS 4059, pages 172-183.pdf-file
Frederic Dorn and Jan Arne Telle:
Two birds with one stone: the best of branchwidth and treewidth with one algorithm.
Proceedings of 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Springer LNCS 3887, pages 386-397.
pdf-file
Frederic Dorn and Eelko Penninkx and Hans L. Bodlaender and Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
Proceedings of 13th Annual European Symposium (Algorithms-ESA 2005), LNCS 3669, pages 95-106.
ps-file
Journal Article:
Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experimental Evaluation of a Tree Decomposition Based Algorithm for Vertex Cover on Planar Graphs.
Discrete Applied Mathematics, 145(2): pages 219-231,
2005.
ps-file
Manuscripts:
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos:
Catalan Structures and Dynamic Programming in H-minor-free graphs.
manuscript,2007.pdf
Frederic Dorn:
Dynamic Programming and Fast Matrix Multiplication.
submitted,2007.
pdf-file
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos:
Subexponential parameterized algorithms.
manuscript,2007.pdf
Frederic Dorn:
How to use planarity efficiently: new tree-decomposition based algorithms.
manuscript,2007.
pdf
Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos:
Fast subexponential algorithm for non-local problems on graphs of bounded genus
manuscript,2006.long version-pdf
Frederic Dorn and Eelko Penninkx and Hans L. Bodlaender and Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.
submitted 2006.
ps-file
Frederic Dorn and Jan Arne Telle:
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm.
submitted 2005.
ps-file
Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experiments on Optimally Solving NP-complete Problems on Planar Graphs.
manuscript 2001.
ps-file
Theses:
Frederic Dorn:
Special Branch Decomposition: A Natural Link between Tree Decompositions and Branch Decompositions
Diplomarbeit, University of Tuebingen, April 2004
Frederic Dorn:
Tuning Algorithms for Hard Planar Graph Problems
Studienarbeit, University of Tuebingen, Januar 2003
(Documentation of the "FPT-TOOLKIT")
pdf-file