Clique width minimization is NP-hard

- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan

On finding short resolution refutations and small unsatisfiable subsets

- Fellows, Michael R., Szeider, Stefan, Wrightson, Graham

FPT is P-Time extremal structure I

- Fellows, Michael R., Estivill-Castro, Vladimir, Langston, Michael A., Rosamond, Frances A.

The parameterized complexity of some minimum label problems

- Fellows, Michael R., Guo, Jiong, Kanj, Iyad

Upper and lower bounds for finding connected motifs in vertex-colored graphs

- Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stephane

Graph-based data clustering with overlaps

- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes

Clique-width is NP-complete

- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

Leaf powers and their properties: using the trees

- Fellows, Michael R., Meister, Daniel, Rosamond, Frances A., Sritharan, R., Telle, Jan Arne

Distortion is fixed parameter tractable

- Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Losievskaja, Eelena, Rosamond, Frances A., Saurabh, Saket

Haplotype inference constrained by plausible haplotype data

- Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat

Well-quasi-orders in subclasses of bounded treewidth graphs

- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances A.

On the parameterized complexity of multiple-interval graph problems

- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane

Graph layout problems parameterized by vertex cover

- Fellows, Michael R., Lokshtanov, Daniel, Misra, Neeldhara, Rosamond, Frances A., Saurabh, Saket

What makes equitable connected partition easy

- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy

On the parameterized complexity of layered graph drawing

- Dujmovic, Vida, Fellows, Michael R., Kitching, Matthew, Liotta, Giuseppe, McCartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David R.

Cutting up is hard to do: the parameterized complexity of k-Cut and related probelms

- Downey, Rodney G., Estivill-Castro, Vladimir, Fellows, Michael R., Prieto, Elena, Rosamond, Frances A.

The Computer Journal special issue on parameterized complexity: foreword by the guest editors (editorial)

- Downey, Rodney G., Fellows, Michael R., Langston, Michael A.

Parameterized approximation of dominating set problems

- Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances

Parameterized complexity of stabbing rectangles and squares in the plane

- Dom, Michael, Fellows, Michael R., Rosamond, Frances A.