Frances A. Rosamond

According to our database1, Frances A. Rosamond authored at least 82 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Frontiers in Algorithmics.
Theor. Comput. Sci., 2019

Diversity in Combinatorial Optimization.
CoRR, 2019

2018
A brief history of Edward K. Blum and the Journal of Computer and System Sciences.
J. Comput. Syst. Sci., 2018

Parameterized approximation via fidelity preserving transformations.
J. Comput. Syst. Sci., 2018

Computational Thinking Enrichment: Public-Key Cryptography.
Informatics in Education, 2018

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

A Survey on the Complexity of Flood-Filling Games.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

What Is Known About Vertex Cover Kernelization?
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016
Max Leaf Spanning Tree.
Encyclopedia of Algorithms, 2016

Tractable Parameterizations for the Minimum Linear Arrangement Problem.
TOCT, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
On the parameterized complexity of dynamic problems.
Theor. Comput. Sci., 2015

The Flood-It game parameterized by the vertex cover number.
Electronic Notes in Discrete Mathematics, 2015

Myhill-Nerode Methods for Hypergraphs.
Algorithmica, 2015

2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Distortion is Fixed Parameter Tractable.
TOCT, 2013

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Theor. Comput. Sci., 2013

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
Eur. J. Comb., 2013

Myhill-Nerode Methods for Hypergraphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Parameterizing by the Number of Numbers.
Theory Comput. Syst., 2012

Local search: Is brute-force avoidable?
J. Comput. Syst. Sci., 2012

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

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

The Parameterized Complexity of Stabbing Rectangles.
Algorithmica, 2012

Train Marshalling Is Fixed Parameter Tractable.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Passion Plays: Melodramas about Mathematics.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

The Parameterized Complexity of Abduction.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput., 2011

Reaching out to the media: become a computer science ambassador.
Commun. ACM, 2011

Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica, 2011

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

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

Multivariate Complexity Theory.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010
Clustering with partial information.
Theor. Comput. Sci., 2010

W-Hierarchies Defined by Symmetric Gates.
Theory Comput. Syst., 2010

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Determining the Winner of a Dodgson Election is Hard.
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.
Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.
Theor. Comput. Sci., 2009

Clique-Width is NP-Complete.
SIAM J. Discrete Math., 2009

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst., 2009

Abstract Milling with Turn Costs
CoRR, 2009

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

What Makes Equitable Connected Partition Easy.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

How similarity helps to efficiently compute Kemeny rankings.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Max Leaf Spanning Tree.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Parameterized approximation of dominating set problems.
Inf. Process. Lett., 2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR, 2008

Parameterized Complexity and Biopolymer Sequence Comparison.
Comput. J., 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

A Purely Democratic Characterization of W[1].
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Leaf Powers and Their Properties: Using the Trees.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Graph Layout Problems Parameterized by Vertex Cover.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Parameterized Complexity of the Clique Partition Problem.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

Fixed-Parameter Algorithms for Kemeny Scores.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
Theory Comput. Syst., 2007

The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst., 2007

Efficient Parameterized Preprocessing for Cluster Editing.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Connected Coloring Completion for General Graphs: Algorithms and Complexity.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Proceedings of the Computation and Logic in the Real World, 2007

2006
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Clique-width minimization is NP-hard.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Kernelization for Convex Recoloring.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005
A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci., 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width
Electronic Colloquium on Computational Complexity (ECCC), 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electronic Colloquium on Computational Complexity (ECCC), 2005

The machine intelligence Hex project.
Computer Science Education, 2005

FPT is P-Time Extremal Structure I.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
Finding k Disjoint Triangles in an Arbitrary Graph.
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.
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.
Electr. Notes Theor. Comput. Sci., 2003

An FPT Algorithm for Set Splitting.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2001
A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000


  Loading...