| Publication | Date of Publication | Type |
|---|
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics | 2014-04-02 | Paper |
| A fine-grained analysis of a simple independent set algorithm | 2012-10-24 | Paper |
Courcelle's theorem -- a game-theoretic approach
Discrete Optimization | 2012-04-05 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Theoretical Computer Science | 2012-01-09 | Paper |
A new algorithm for finding trees with many leaves
Algorithmica | 2011-12-14 | Paper |
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Journal of Discrete Algorithms | 2011-08-23 | Paper |
| scientific article; zbMATH DE number 5859273 (Why is no real title available?) | 2011-03-01 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A bound on the pathwidth of sparse graphs with applications to exact algorithms
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Parameterized power domination complexity
Information Processing Letters | 2010-01-18 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
On digraph width measures in parameterized algorithmics
Parameterized and Exact Computation | 2010-01-14 | Paper |
Randomized divide-and-conquer: improved path, matching, and packing algorithms
SIAM Journal on Computing | 2010-01-06 | Paper |
Approximation hardness of deadline-TSP reoptimization
Theoretical Computer Science | 2009-05-28 | Paper |
A New Algorithm for Finding Trees with Many Leaves
Algorithms and Computation | 2009-01-29 | Paper |
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Divide-and-Color
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Intuitive Algorithms and t-Vertex Cover
Algorithms and Computation | 2008-04-24 | Paper |
Partial vs. Complete Domination: t-Dominating Set
Lecture Notes in Computer Science | 2008-03-07 | Paper |
The parameterized approximability of TSP with deadlines
Theory of Computing Systems | 2007-12-19 | Paper |
On the Approximation Hardness of Some Generalizations of TSP
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
