Your selections:
Fixed-parameter algorithms for Kemeny rankings
- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.
Graph-based data clustering with overlaps
- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes
Haplotype inference constrained by plausible haplotype data
- Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat
On problems without polynomial kernels
- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny
On the parameterized complexity of multiple-interval graph problems
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
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.
What makes equitable connected partition easy
- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances
The parameterized complexity of some minimum label problems
- Fellows, Michael R., Guo, Jiong, Kanj, Iyad
Quadratic kernelization for convex recoloring of trees
- Bodlaender, Hans L., Fellows, Michael R., Langston, Michael A., Ragan, Mark A., Rosamond, Frances A., Weyer, Mark
Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stephane
Are you sure you would like to clear your session, including search history and login status?