Frances A. Rosamond

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 22

Top Venues

CoRR

J. Comput. Syst. Sci.

Adventures Between Lower Bounds and Higher Altitudes

Theor. Comput. Sci.

Publications

Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS (2024)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. CoRR (2023)
Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC (2023)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. ECAI (2023)
George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303 (2022)
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
Parameterized String Equations. CoRR (2021)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI (2020)
Michael R. Fellows, Frances A. Rosamond
Collaborating with Hans: Some Remaining Wonderments. Treewidth, Kernels, and Algorithms (2020)
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13 (9) (2020)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity in Combinatorial Optimization. CoRR (2019)
Mingyu Xiao, Frances A. Rosamond
Frontiers in Algorithmics. Theor. Comput. Sci. 786 (2019)
Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
A Survey on the Complexity of Flood-Filling Games. Adventures Between Lower Bounds and Higher Altitudes (2018)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93 (2018)
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
What Is Known About Vertex Cover Kernelization? Adventures Between Lower Bounds and Higher Altitudes (2018)
Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discret. Appl. Math. 245 (2018)
Frances A. Rosamond
Computational Thinking Enrichment: Public-Key Cryptography. Informatics Educ. 17 (1) (2018)
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
What is known about Vertex Cover Kernelization? CoRR (2018)
Michael R. Fellows, Frances A. Rosamond
A brief history of Edward K. Blum and the Journal of Computer and System Sciences. J. Comput. Syst. Sci. 94 (2018)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC (2016)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8 (2) (2016)
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73 (4) (2015)
Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva
The Flood-It game parameterized by the vertex cover number. Electron. Notes Discret. Math. 50 (2015)
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607 (2015)
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. COCOA (2014)
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. ISAAC (2013)
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472 (2013)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA (2013)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory 5 (4) (2013)
Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34 (3) (2013)
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
Train Marshalling Is Fixed Parameter Tractable. FUN (2012)
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding CoRR (2012)
Frances A. Rosamond
Passion Plays: Melodramas about Mathematics. The Multivariate Algorithmic Revolution and Beyond (2012)
Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar
The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62 (1-2) (2012)
Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele
The Parameterized Complexity of Abduction. AAAI (2012)
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Parameterizing by the Number of Numbers. Theory Comput. Syst. 50 (4) (2012)
Tim Bell, Frances A. Rosamond, Nancy Casey
Computer Science Unplugged and Related Projects in Math and Computer Science Popularization. The Multivariate Algorithmic Revolution and Beyond (2012)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78 (3) (2012)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) (2012)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64 (1) (2012)
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS (2011)
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61 (2) (2011)
Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege
Reaching out to the media: become a computer science ambassador. Commun. ACM 54 (3) (2011)
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI (2011)
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. Inf. Comput. 209 (2) (2011)
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
Haplotype Inference Constrained by Plausible Haplotype Data. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (6) (2011)
Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG (2010)
Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
Determining the Winner of a Dodgson Election is Hard. FSTTCS (2010)
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Parameterizing by the Number of Numbers. IPEC (2010)
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Parameterizing by the Number of Numbers CoRR (2010)
Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46 (2) (2010)
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
Clustering with partial information. Theor. Comput. Sci. 411 (7-9) (2010)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
Distortion Is Fixed Parameter Tractable. ICALP (1) (2009)
Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
Abstract Milling with Turn Costs CoRR (2009)
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45 (4) (2009)
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) (2009)
Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
Local Search: Is Brute-Force Avoidable? IJCAI (2009)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23 (2) (2009)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) (2009)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC (2009)
Michael Dom, Michael R. Fellows, Frances A. Rosamond
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM (2009)
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
Haplotype Inference Constrained by Plausible Haplotype Data. CPM (2009)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410 (45) (2009)
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
What Makes Equitable Connected Partition Easy. IWPEC (2009)
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
Graph Layout Problems Parameterized by Vertex Cover. ISAAC (2008)
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song
Parameterized Complexity and Biopolymer Sequence Comparison. Comput. J. 51 (3) (2008)
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
Clustering with Partial Information. MFCS (2008)
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) (2008)
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
Leaf Powers and Their Properties: Using the Trees. ISAAC (2008)
Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond
A Purely Democratic Characterization of W[1]. IWPEC (2008)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
Fixed-Parameter Algorithms for Kemeny Scores. AAIM (2008)
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
Parameterized approximation of dominating set problems. Inf. Process. Lett. 109 (1) (2008)
Egbert Mujuni, Frances A. Rosamond
Parameterized Complexity of the Clique Partition Problem. CATS (2008)
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 (2008)
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) (2008)
Michael R. Fellows, Frances A. Rosamond
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE (2007)
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)
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)
Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
Efficient Parameterized Preprocessing for Cluster Editing. FCT (2007)
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41 (3) (2007)
Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond
The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41 (3) (2007)
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)
Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond
NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM (2006)
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) (2006)
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
Kernelization for Convex Recoloring. ACiD (2006)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Clique-width minimization is NP-hard. STOC (2006)
Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond
) Kernel. IWPEC (2006)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electron. Colloquium Comput. Complex. (080) (2005)
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) (2005)
Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
FPT is P-Time Extremal Structure I. ACiD (2005)
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON (2005)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Proving NP-hardness for clique-width II: non-approximability of clique-width Electron. Colloquium Comput. Complex. (081) (2005)
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)
Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
Finding k Disjoint Triangles in an Arbitrary Graph. WG (2004)
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)
Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electron. Notes Theor. Comput. Sci. 78 (2003)
Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
An FPT Algorithm for Set Splitting. WG (2003)
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)
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)

Frances A. Rosamond.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frances A. Rosamond