Your selections:
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.
Polynomial-time data reduction for dominating set
- Alber, Jochen, Fellows, Michael R.
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.
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
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances
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
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
- Downey, Rodney G., Fellows, Michael R., Langston, Michael A.
A complexity dichotomy for finding disjoint solutions of vertex deletion problems
- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf
- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan
Derivation of algorithms for cutwidth and related graph layout parameters
- Bodlaender, Hans L., Fellows, Michael R., Thilikos, Dimitrios M.
Distortion is fixed parameter tractable
- Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Losievskaja, Eelena, Rosamond, Frances A., Saurabh, Saket
Are you sure you would like to clear your session, including search history and login status?