Quadratic kernelization for convex recoloring of trees

- Bodlaender, Hans L., Fellows, Michael R., Langston, Michael A., Ragan, Mark A., Rosamond, Frances A., Weyer, Mark

Clique-width is NP-complete

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

Distortion is fixed parameter tractable

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

Fixed-parameter algorithms for Kemeny rankings

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

Parameterized complexity of stabbing rectangles and squares in the plane

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

Well-quasi-orders in subclasses of bounded treewidth graphs

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

Computing Kemeny rankings, parameterized by the average K-T distance

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedemeier, Rolf, Rosamond, Frances A.

Fixed-parameter algorithms for Kemeny Scores

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

Graph layout problems parameterized by vertex cover

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

Leaf powers and their properties: using the trees

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

Clique width minimization is NP-hard

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

FPT is P-Time extremal structure I

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

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.