A purely democratic characterization of W[1]
- Fellows, Michael, Hermelin, Danny, Muller, Moritz, Rosamond, Frances
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances
Haplotype inference constrained by plausible haplotype data
- Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat
Milling a graph with turn costs: a parameterized complexity perspective
- Fellows, Mike, Giannopoulos, Panos, Knauer, Christian, Paul, Christophe, Rosamond, Frances, Whitesides, Sue, Yu, Nathan
On complexity of lobbying in multiple referenda
- Christian, Robin, Fellows, Mike, Rosamond, Frances, Slinko, Arkadii
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.
On the parameterized complexity of multiple-interval graph problems
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Parameterized approximation of dominating set problems
- Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances
Parameterized complexity and biopolymer sequence comparison
- Cai, Liming, Huang, Xiuzhen, Liu, Chunmei, Rosamond, Frances, Song, Yinglei
Parameterized complexity of the clique partition problem
- Mujuni, Egbert, Rosamond, Frances
Parameterized low-distortion embeddings: graph metrics into lines and trees
- Fellows, Michael, Fomin, Fedor V., Lokshtanov, Daniel, Losievskaja, Elena, Rosamond, Frances, Saurabh, Saket
Polynomial-time linear kernelization for cluster editing
- Fellows, Michael, Langston, Michael, Rosamond, Frances, Shaw, Peter
Reaching out to the media: become a computer science ambassador
- Rosamond, Frances, Bardohl, Roswitha, Diehl, Stephan, Geisler, Uwe, Bolduan, Gordon, Lessmöllmann, Annette, Schwill, Andreas, Stege, Ulrike
The complexity ecology of parameters: an illustration using bounded max leaf number
- Fellows, Michael, Lokshtanov, Daniel, Misra, Neeldhara, Mnich, Matthias, Rosamond, Frances, Saurabh, Saket
W-Hierarchies defined by symmetric gates
- Fellows, Michael, Flum, Jörg, Hermelin, Danny, Müller, Moritz, Rosamond, Frances
What makes equitable connected partition easy
- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy
Are you sure you would like to clear your session, including search history and login status?