Frances rosamond
TitleCited byYear
On the parameterized complexity of multiple-interval graph problems
MR Fellows, D Hermelin, F Rosamond, S Vialette
Theoretical Computer Science 410 (1), 53-61, 2009
2552009
Computer science unplugged and related projects in math and computer science popularization
T Bell, F Rosamond, N Casey
The multivariate algorithmic revolution and beyond, 398-456, 2012
1522012
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
International Symposium on Algorithms and Computation, 294-305, 2008
1182008
Cutting up is hard to do: The parameterised complexity of k-cut and related problems
FAR Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto
Electronic Notes in Theoretical Computer Science 78, 209-222, 2003
1182003
Clique-width is NP-complete
MR Fellows, FA Rosamond, U Rotics, S Szeider
SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009
1042009
On the parameterized complexity of layered graph drawing
V Dujmović, M Fellows, M Hallett, M Kitching, G Liotta, C McCartin, ...
European Symposium on Algorithms, 488-499, 2001
97*2001
Clique-width minimization is NP-hard
MR Fellows, FA Rosamond, U Rotics, S Szeider
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
892006
FPT is P-Time Extremal Structure I.
V Estivill-Castro, MR Fellows, MA Langston, FA Rosamond
ACiD 4, 1-41, 2005
892005
On the complexity of some colorful problems parameterized by treewidth
MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ...
Information and Computation 209 (2), 143-153, 2011
862011
On complexity of lobbying in multiple referenda
R Christian, M Fellows, F Rosamond, A Slinko
Review of Economic Design 11 (3), 217-224, 2007
862007
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
F Dehne, M Fellows, MA Langston, F Rosamond, K Stevens
International Computing and Combinatorics Conference, 859-869, 2005
842005
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
MR Fellows, BMP Jansen, F Rosamond
European Journal of Combinatorics 34 (3), 541-566, 2013
782013
Finding k disjoint triangles in an arbitrary graph
M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle
International Workshop on Graph-Theoretic Concepts in Computer Science, 235-244, 2004
782004
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
KS Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A ...
Theory Comput. Syst. 41 (3), 479-492, 2007
772007
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
KS Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A ...
COCOON, 859-869, 2005
77*2005
Fixed-parameter algorithms for Kemeny rankings
N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond
Theoretical Computer Science 410 (45), 4554-4570, 2009
762009
Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for …
F Dehne, M Fellows, F Rosamond, P Shaw
International Workshop on Parameterized and Exact Computation, 271-280, 2004
762004
Efficient parameterized preprocessing for cluster editing
M Fellows, M Langston, F Rosamond, P Shaw
International Symposium on Fundamentals of Computation Theory, 312-321, 2007
692007
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
K Burrage, V Estivill-Castro, M Fellows, M Langston, S Mac, F Rosamond
International Workshop on Parameterized and Exact Computation, 192-202, 2006
672006
Refined search tree technique for dominating set on planar graphs
J Alber, H Fan, MR Fellows, H Fernau, R Niedermeier, F Rosamond, ...
International Symposium on Mathematical Foundations of Computer Science, 111-123, 2001
642001
The system can't perform the operation now. Try again later.
Articles 1–20