Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

Interval Deletion Is Fixed-Parameter Tractable

(2015) Yixin Cao et al.   ACM Transactions on Algorithms

Myhill–Nerode Methods for Hypergraphs

(2015) René van Bevern et al.   ALGORITHMICA

On nowhere dense graphs

(2011) Jaroslav Nešetřil et al.   EUROPEAN JOURNAL OF COMBINATORICS

Faster parameterized algorithms for minor containment

(2011) Isolde Adler et al.   THEORETICAL COMPUTER SCIENCE

Rank-width and tree-width of H-minor-free graphs

(2010) Fedor V. Fomin et al.   EUROPEAN JOURNAL OF COMBINATORICS

On the induced matching problem

(2010) Iyad Kanj et al.   JOURNAL OF COMPUTER AND SYSTEM SCIENCES

A linear kernel for a planar connected dominating set

(2010) Daniel Lokshtanov et al.   THEORETICAL COMPUTER SCIENCE

Chordal Deletion is Fixed-Parameter Tractable

(2008) Dániel Marx   ALGORITHMICA

The parameterized complexity of the induced matching problem

(2008) Hannes Moser et al.   DISCRETE APPLIED MATHEMATICS

Improved algorithms for feedback vertex set problems

(2008) Jianer Chen et al.   JOURNAL OF COMPUTER AND SYSTEM SCIENCES