Follow
Frances rosamond
Title
Cited by
Cited by
Year
Learning mathematics
RB Davis, F ROSAMOND, D PIMM, W KUYK, JH LORENZ, A ARCAVI, ...
London] Sydney, 1984
10971984
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
3732009
Computer science unplugged and related projects in math and computer science popularization
T Bell, F Rosamond, N Casey
The multivariate algorithmic revolution and beyond: Essays dedicated to …, 2012
2792012
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
1712008
Clique-width is NP-complete
MR Fellows, FA Rosamond, U Rotics, S Szeider
SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009
1502009
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
1462003
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
1332011
On the Parameterized Complexity of Layered Graph Drawing
DRW ask others Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe ...
Algorithmica 52 (2), 267-292, 2008
123*2008
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
1192013
FPT is P-Time Extremal Structure I.
V Estivill-Castro, MR Fellows, MA Langston, FA Rosamond
ACiD 4, 1-41, 2005
992005
On complexity of lobbying in multiple referenda
R Christian, M Fellows, F Rosamond, A Slinko
Review of Economic Design 11, 217-224, 2007
952007
Fixed-parameter algorithms for Kemeny rankings
N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond
Theoretical Computer Science 410 (45), 4554-4570, 2009
942009
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
942004
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
932006
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
922007
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
K Burrage, V Estivill-Castro, M Fellows, M Langston, S Mac, F Rosamond
Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006
842006
An O(2O(k)n3) 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
Efficient parameterized preprocessing for cluster editing
M Fellows, M Langston, F Rosamond, P Shaw
Fundamentals of Computation Theory: 16th International Symposium, FCT 2007 …, 2007
812007
Finding k Disjoint Triangles in an Arbitrary Graph
M Fellows, P Heggernes, F Rosamond, C Sloper, JA Telle
Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005
812005
Local search: Is brute-force avoidable?
MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ...
Journal of Computer and System Sciences 78 (3), 707-719, 2012
752012
The system can't perform the operation now. Try again later.
Articles 1–20