Home |
CV |
Miscellaneous |

"Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree", with Paul Bonsma. To appear in ACM - Transactions on Algorithms.

"Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions", with Hans L. Bodlaender and Fedor V. Fomin and Eelko Penninkx. Algorithmica, 58(3): pages 790-810, 2010.

"Dynamic Programming and Planarity: Improved Tree-Decomposition Based Algorithms". Discrete Applied Mathematics, 158: pages 800-808, 2010.

"Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm", with Jan Arne Telle. Discrete Applied Mathematics, 157: pages 2737-2746,2009. Special Issue on Tree Decompositions.

"Subexponential parameterized algorithms", with Fedor V. Fomin and Dimitrios M. Thilikos.

Computer Science Review, 2(1): pages 29-39, 2008.

"Experimental Evaluation of a Tree Decomposition Based Algorithm for Vertex Cover on Planar Graphs", with Jochen Alber and Rolf Niedermeier.

Journal on Discrete Applied Mathematics, 145(2): pages 219-231, 2005.

"Efficient Algorithms for Eulerian Extension", with Hannes Moser, Rolf Niedermeier and Mathias Weller. Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010), vol. 6410 of LNCS, Springer, 2010, pages 100 - 111.

"Fast Minor Testing in Planar Graphs ", with Isolde Adler, Fedor V. Fomin, Ignasi Sau and Dimitrios M. Thilikos. Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), vol. 6346 of LNCS, Springer, 2010, pages 97 - 109.

"Faster Parameterized Algorithms for Minor Containment", with Isolde Adler, Fedor V. Fomin, Ignasi Sau and Dimitrios M. Thilikos. Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), vol. 6139 of LNCS, Springer, 2010, pages 322-333.

"Planar Subgraph Isomorphism Revisited", Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pages 263-274.

"Beyond Bidimensionality: Parameterized Subexponential
Algorithms on Directed Graphs", with Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh.

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pages 251-262.

"Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf",
with Paul Bonsma. Preprint

Proceedings of 16th Annual European Symposium (Algorithms/ESA 2008), vol. 5193 of LNCS, Springer, 2008, pages 222-233.

"Catalan Structures and Dynamic Programming in H-minor-free graphs", with Fedor V. Fomin and Dimitrios M. Thilikos. Preprint.

Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), 2008, pages 631-640.

"Subexponential parameterized algorithms", with Fedor V. Fomin and Dimitrios M. Thilikos. Preprint.

Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007,survey), vol. 4596 of LNCS, Springer, 2007, pages 15-27.

"How to use planarity efficiently: new tree-decomposition based algorithms", preprint.

Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), vol.4769 of LNCS, Springer, 2007, pages 280-291.

"Dynamic Programming and Fast Matrix Multiplication", preprint.

Proceedings of 14th Annual European Symposium (Algorithms/ESA 2006), Springer LNCS 4168, pages 280-291.

ESA 2006 EATCS award: "Best student ESA paper"

"Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus", with Fedor V. Fomin and Dimitrios M. Thilikos. Preprint.

Proceedings of 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), Springer LNCS 4059, pages 172-183.

"Two birds with one stone: the best of branchwidth and treewidth with one algorithm", with Jan Arne Telle. Preprint.

Proceedings of 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Springer LNCS 3887, pages 386-397.

"Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions", with Hans L. Bodlaender and Fedor V. Fomin and Eelko Penninkx. Preprint.

Proceedings of 13th Annual European Symposium (Algorithms-ESA 2005), LNCS 3669, pages 95-106.

"An FPT Algorithm for Directed Spanning k-Leaf",
with Paul Bonsma.

Technical report 2007.

"Experiments on Optimally Solving NP-complete Problems on Planar Graphs", with Jochen Alber and Rolf Niedermeier.

manuscript, 2001.

"Designing Subexponential Algorithms: Problems, Techniques & Structures.", PhD thesis, Bergen 2007.

"Special Branch Decomposition: A Natural Link between Tree Decompositions and Branch Decompositions", Diplomarbeit, University of Tuebingen, April 2004.

"Tuning Algorithms for Hard Planar Graph Problems", Studienarbeit, University of Tuebingen, Januar 2003.

(Documentation of the "FPT-TOOLKIT").