Leaf powers and their properties: using the trees

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

On problems without polynomial kernels

- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny

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.

Parameterized algorithms and hardness results for some graph Motif problems

- Betzler, Nadja, Fellows, Michael R., Komusiewicz, Christian, Niedermeier, Rolf

Parameterized approximation of dominating set problems

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

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

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

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

A refined search tree technique for Dominating Set on planar graphs

- Alber, Jochen, Fan, Hongbing, Fellows, Michael R., Fernau, Henning, Niedermeier, Rolf, Rosamond, Fran, Stege, Ulrike

FPT is P-Time extremal structure I

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

Polynomial-time data reduction for dominating set

- Alber, Jochen, Fellows, Michael 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.