| Publication | Date of Publication | Type |
|---|
Subexponential parameterized algorithms
Computer Science Review | 2014-10-07 | Paper |
Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
Information and Computation | 2014-01-10 | Paper |
Efficient algorithms for Eulerian extension and rural Postman
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Fast minor testing in planar graphs
Algorithmica | 2012-11-21 | Paper |
Catalan structures and dynamic programming in \(H\)-minor-free graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2012-01-23 | Paper |
| Planar subgraph isomorphism revisited | 2012-01-23 | Paper |
Faster parameterized algorithms for minor containment
Theoretical Computer Science | 2011-12-07 | Paper |
Efficient algorithms for Eulerian extension
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Algorithmica | 2010-09-27 | Paper |
Fast minor testing in planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764900 (Why is no real title available?) | 2010-08-06 | Paper |
Faster parameterized algorithms for minor containment
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Dynamic programming and planarity: improved tree-decomposition based algorithms
Discrete Applied Mathematics | 2010-05-25 | Paper |
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics | 2010-04-28 | Paper |
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Dynamic Programming and Fast Matrix Multiplication
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Subexponential Parameterized Algorithms
Automata, Languages and Programming | 2007-11-28 | Paper |
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
