Frances A. Rosamond
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
34
Venues
20
Active years
2001–2024
Best venue rank
A*
Where they publish
Papers
34 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | MFCS | Breaking a Graph into Connected Components with Small Dominating Sets. | Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2023 | CIAC | On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. | Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach |
| 2023 | ECAI | On Solution Discovery via Reconfiguration. | Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2014 | COCOA | On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. | Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw |
| 2013 | ESA | Tractable Parameterizations for the Minimum Linear Arrangement Problem. | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai |
| 2013 | ISAAC | Myhill-Nerode Methods for Hypergraphs. | Ren van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
| 2012 | AAAI | The Parameterized Complexity of Abduction. | Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rmmele |
| 2012 | FUN | Train Marshalling Is Fixed Parameter Tractable. | Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond |
| 2012 | ICALP | Parameterized Approximation via Fidelity Preserving Transformations. | Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai |
| 2011 | IJCAI | Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. | Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond |
| 2010 | WG | Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
| 2009 | CPM | Haplotype Inference Constrained by Plausible Haplotype Data. | Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg |
| 2009 | ICALP | Distortion Is Fixed Parameter Tractable. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | WALCOM | Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. | Michael Dom, Michael R. Fellows, Frances A. Rosamond |
| 2008 | AAIM | Fixed-Parameter Algorithms for Kemeny Scores. | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
| 2008 | ISAAC | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
| 2008 | ISAAC | Leaf Powers and Their Properties: Using the Trees. | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
| 2008 | MFCS | Clustering with Partial Information. | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
| 2007 | CiE | The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. | Michael R. Fellows, Frances A. Rosamond |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | COCOON | Quadratic Kernelization for Convex Recoloring of Trees. | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
| 2007 | COCOON | Connected Coloring Completion for General Graphs: Algorithms and Complexity. | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
| 2007 | FCT | Efficient Parameterized Preprocessing for Cluster Editing. | Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw |
| 2006 | STOC | Clique-width minimization is NP-hard. | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
| 2006 | SOFSEM | NONBLOCKER: Parameterized Algorithmics for minimum dominating set. | Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond |
| 2005 | COCOON | An O(2 | Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens |
| 2004 | ESA | Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
| 2004 | WG | Finding k Disjoint Triangles in an Arbitrary Graph. | Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle |
| 2003 | WG | An FPT Algorithm for Set Splitting. | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond |
| 2001 | ESA | On the Parameterized Complexity of Layered Graph Drawing. | 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 |
| 2001 | GD | A Fixed-Parameter Approach to Two-Layer Planarization. | 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 |
| 2001 | MFCS | Refined Search Tree Technique for DOMINATING SET on Planar Graphs. | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |