Frances A. Rosamond

2009
40	EE	Michael Dom, Michael R. Fellows, Frances A. Rosamond: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309
39	EE	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009)
2008
38	EE	Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
37	EE	Egbert Mujuni, Frances A. Rosamond: Parameterized Complexity of the Clique Partition Problem. CATS 2008: 75-78
36	EE	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
35	EE	Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413
34	EE	Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114
33	EE	Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
32	EE	Frances A. Rosamond: Max Leaf Spanning Tree. Encyclopedia of Algorithms 2008
31	EE	Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)
30	EE	Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
29	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR abs/0804.3028: (2008)
28	EE	Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song: Parameterized Complexity and Biopolymer Sequence Comparison. Comput. J. 51(3): 270-291 (2008)
27	EE	Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
2007
26	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
25	EE	Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir: Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON 2007: 75-85
24	EE	Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96
23	EE	Michael R. Fellows, Frances A. Rosamond: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277
22	EE	Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw: Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321
21	EE	Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond: The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007)
20	EE	Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens: An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41(3): 479-492 (2007)
2006
19		Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Kernelization for Convex Recoloring. ACiD 2006: 23-35
18	EE	Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. IWPEC 2006: 192-202
17	EE	Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond: NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245
16	EE	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
15	EE	Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)
2005
14		Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond: FPT is P-Time Extremal Structure I. ACiD 2005: 1-41
13	EE	Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens: An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON 2005: 859-869
12	EE	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electronic Colloquium on Computational Complexity (ECCC)(080): (2005)
11	EE	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width II: non-approximability of clique-width Electronic Colloquium on Computational Complexity (ECCC)(081): (2005)
10	EE	Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005)
2004
9	EE	Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322
8	EE	Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw: Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. IWPEC 2004: 271-280
7	EE	Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle: Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244
2003
6	EE	Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond: An FPT Algorithm for Set Splitting. WG 2003: 180-191
5	EE	Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78: (2003)
2001
4	EE	Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499
3	EE	Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15
2	EE	Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122
2000
1	EE	Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. FSTTCS 2000: 240-251

Coauthor Index

1	Jochen Alber	[2] [10]
2	Nadja Betzler	[38]
3	Hans L. Bodlaender	[19] [24] [33]
4	Kevin Burrage	[18]
5	Liming Cai	[21] [28]
6	Benny Chor	[25]
7	Frank K. H. A. Dehne	[6] [8] [13] [17] [20]
8	Michael Dom	[40]
9	Rodney G. Downey (Rod Downey)	[5] [27]
10	Vida Dujmovic	[3] [4] [15] [30]
11	Vladimir Estivill-Castro	[5] [14] [18]
12	Hongbing Fan	[2] [10]
13	Michael R. Fellows (Mike Fellows)	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [29] [30] [31] [33] [34] [35] [36] [38] [39] [40]
14	Henning Fernau	[2] [10] [17]
15	Fedor V. Fomin	[26] [29]
16	Jiong Guo	[38]
17	Michael T. Hallett	[3] [4] [15]
18	Pinar Heggernes	[7] [33]
19	Danny Hermelin	[34] [39]
20	Xiuzhen Huang	[28]
21	David W. Juedes	[21]
22	Matthew Kitching	[3] [4] [15] [30]
23	Christian Knauer	[9] [31]
24	Michael A. Langston	[13] [14] [18] [19] [20] [22] [24]
25	Giuseppe Liotta	[3] [4] [15] [30]
26	Chunmei Liu	[28]
27	Daniel Lokshtanov	[26] [29] [36]
28	Elena Losievskaja	[29]
29	Shev Mac	[18]
30	Federico Mancini	[33]
31	Catherine McCartin	[1] [3] [4] [15] [27] [30]
32	Daniel Meister	[35]
33	Neeldhara Misra	[36]
34	Egbert Mujuni	[37]
35	Moritz Müller	[34]
36	Rolf Niedermeier	[2] [10] [38]
37	Naomi Nishimura	[3] [4] [9] [15] [30] [31]
38	Charis Papadopoulos	[33]
39	Elena Prieto	[5] [17]
40	Mark A. Ragan	[19] [24] [25]
41	Prabhakar Ragde	[3] [4] [9] [15] [30] [31]
42	Igor Razgon	[25]
43	Udi Rotics	[11] [12] [16]
44	Saket Saurabh	[26] [29] [36]
45	Peter Shaw	[8] [22]
46	Christian Sloper	[7]
47	Sagi Snir	[25]
48	Yinglei Song	[28]
49	R. Sritharan	[35]
50	Ulrike Stege	[1] [2] [9] [10] [31]
51	Kim Stevens	[13] [20]
52	Matthew Suderman (Matthew J. Suderman)	[3] [4] [15]
53	Stefan Szeider	[11] [12] [16] [26]
54	Jan Arne Telle	[7] [35]
55	Dimitrios M. Thilikos	[9] [31]
56	Carsten Thomassen	[26]
57	Stéphane Vialette	[39]
58	Mark Weyer	[19] [24]
59	Sue Whitesides	[3] [4] [9] [15] [30] [31]
60	David R. Wood	[3] [4] [15] [30]