Upper bounds on the size of obstructions and intertwines

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Computing the branchwidth of interval graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics

Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Computing the branchwidth of interval graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics

Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond