Følg
Frances rosamond
Frances rosamond
Verifisert e-postadresse på uib.no
Tittel
Sitert av
Sitert av
År
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
3302009
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
1572012
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
1492008
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
1382003
Clique-width is NP-complete
MR Fellows, FA Rosamond, U Rotics, S Szeider
SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009
1262009
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
1162011
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
109*2001
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
982013
FPT is P-Time Extremal Structure I.
V Estivill-Castro, MR Fellows, MA Langston, FA Rosamond
ACiD 4, 1-41, 2005
962005
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
902006
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
892007
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
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
842004
Fixed-parameter algorithms for Kemeny rankings
N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond
Theoretical Computer Science 410 (45), 4554-4570, 2009
822009
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
812006
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
812004
Efficient parameterized preprocessing for cluster editing
M Fellows, M Langston, F Rosamond, P Shaw
International Symposium on Fundamentals of Computation Theory, 312-321, 2007
802007
The complexity ecology of parameters: An illustration using bounded max leaf number
M Fellows, D Lokshtanov, N Misra, M Mnich, F Rosamond, S Saurabh
Theory of Computing Systems 45 (4), 822-848, 2009
672009
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
652012
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20