Frances A. Rosamond

According to our database, Frances A. Rosamond authored at least 90 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

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

Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.

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

CoRR, 2023

On Solution Discovery via Reconfiguration.

Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

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

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.

Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond

Artif. Intell., 2022

2021

Parameterized String Equations.

Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond

CoRR, 2021

2020

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.

Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi

Algorithms, 2020

Collaborating with Hans: Some Remaining Wonderments.

Michael R. Fellows, Frances A. Rosamond

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Frontiers in Algorithmics.

Mingyu Xiao, Frances A. Rosamond

Theor. Comput. Sci., 2019

Diversity in Combinatorial Optimization.

Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond

CoRR, 2019

2018

A brief history of Edward K. Blum and the Journal of Computer and System Sciences.

Michael R. Fellows, Frances A. Rosamond

J. Comput. Syst. Sci., 2018

Parameterized approximation via fidelity preserving transformations.

Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai

J. Comput. Syst. Sci., 2018

Computational Thinking Enrichment: Public-Key Cryptography.

Frances A. Rosamond

Informatics Educ., 2018

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.

Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza

Discret. Appl. Math., 2018

A Survey on the Complexity of Flood-Filling Games.

Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

What Is Known About Vertex Cover Kernelization?

Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016

Max Leaf Spanning Tree.

Frances A. Rosamond

Encyclopedia of Algorithms, 2016

Tractable Parameterizations for the Minimum Linear Arrangement Problem.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai

ACM Trans. Comput. Theory, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.

Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

On the parameterized complexity of dynamic problems.

Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw

Theor. Comput. Sci., 2015

The Flood-It game parameterized by the vertex cover number.

Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva

Electron. Notes Discret. Math., 2015

Myhill-Nerode Methods for Hypergraphs.

René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

Algorithmica, 2015

2014

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.

Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo

J. Comput. Syst. Sci., 2014

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.

Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Distortion is Fixed Parameter Tractable.

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh

ACM Trans. Comput. Theory, 2013

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond

Theor. Comput. Sci., 2013

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.

Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond

Eur. J. Comb., 2013

Myhill-Nerode Methods for Hypergraphs.

René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Parameterizing by the Number of Numbers.

Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

Theory Comput. Syst., 2012

Local search: Is brute-force avoidable?

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger

J. Comput. Syst. Sci., 2012

How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding

René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

CoRR, 2012

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond

Algorithmica, 2012

The Parameterized Complexity of Stabbing Rectangles.

Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar

Algorithmica, 2012

Train Marshalling Is Fixed Parameter Tractable.

Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Passion Plays: Melodramas about Mathematics.

Frances A. Rosamond

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.

Tim Bell, Frances A. Rosamond, Nancy Casey

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

The Parameterized Complexity of Abduction.

Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Haplotype Inference Constrained by Plausible Haplotype Data.

Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

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

Inf. Comput., 2011

Reaching out to the media: become a computer science ambassador.

Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege

Commun. ACM, 2011

Quadratic Kernelization for Convex Recoloring of Trees.

Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer

Algorithmica, 2011

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.

Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Statistics of the Field.

Frances A. Rosamond

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

Multivariate Complexity Theory.

Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010

Clustering with partial information.

Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond

Theor. Comput. Sci., 2010

W-Hierarchies Defined by Symmetric Gates.

Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond

Theory Comput. Syst., 2010

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

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Determining the Winner of a Dodgson Election is Hard.

Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

On the parameterized complexity of multiple-interval graph problems.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette

Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Theor. Comput. Sci., 2009

Clique-Width is NP-Complete.

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider

SIAM J. Discret. Math., 2009

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.

Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh

Theory Comput. Syst., 2009

Abstract Milling with Turn Costs

Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu

CoRR, 2009

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.

Michael Dom, Michael R. Fellows, Frances A. Rosamond

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

What Makes Equitable Connected Partition Easy.

Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

How similarity helps to efficiently compute Kemeny rankings.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

Max Leaf Spanning Tree.

Frances A. Rosamond

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Parameterized approximation of dominating set problems.

Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond

Inf. Process. Lett., 2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh

CoRR, 2008

Parameterized Complexity and Biopolymer Sequence Comparison.

Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song

Comput. J., 2008

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

Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.

Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood

Algorithmica, 2008

A Purely Democratic Characterization of W[1].

Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Leaf Powers and Their Properties: Using the Trees.

Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Graph Layout Problems Parameterized by Vertex Cover.

Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Parameterized Complexity of the Clique Partition Problem.

Egbert Mujuni, Frances A. Rosamond

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

Fixed-Parameter Algorithms for Kemeny Scores.

Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

An O(2^O(k)n³) FPT Algorithm for the Undirected Feedback Vertex Set Problem.

Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens

Theory Comput. Syst., 2007

The Complexity of Polynomial-Time Approximation.

Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond

Theory Comput. Syst., 2007

Efficient Parameterized Preprocessing for Cluster Editing.

Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Connected Coloring Completion for General Graphs: Algorithms and Complexity.

Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.

Michael R. Fellows, Frances A. Rosamond

Proceedings of the Computation and Logic in the Real World, 2007

2006

A Fixed-Parameter Approach to 2-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

Algorithmica, 2006

Clique-width minimization is NP-hard.

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

NONBLOCKER: Parameterized Algorithmics for minimum dominating set.

Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

The Undirected Feedback Vertex Set Problem Has a Poly(<i>k</i>) Kernel.

Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Kernelization for Convex Recoloring.

Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

A 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

J. Comput. Syst. Sci., 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider

Electron. Colloquium Comput. Complex., 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider

Electron. Colloquium Comput. Complex., 2005

The machine intelligence Hex project.

Stephan K. Chalup, Drew Mellor, Fran Rosamond

Comput. Sci. Educ., 2005

FPT is P-Time Extremal Structure I.

Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004

Finding k Disjoint Triangles in an Arbitrary Graph.

Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.

Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.

Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

An FPT Algorithm for Set Splitting.

Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2001

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

Proceedings of the Graph Drawing, 9th International Symposium, 2001

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

Proceedings of the Algorithms, 2001

2000

Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.

Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000