Search filters

List of works by Frances A. Rosamond

A Fixed-Parameter Approach to 2-Layer Planarization

A Purely Democratic Characterization of W[1]

A refined search tree technique for Dominating Set on planar graphs

scholarly article by Jochen Alber et al published November 2005 in Journal of Computer and System Sciences

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

Clique-Width is NP-Complete

article by Michael R. Fellows et al published January 2009 in SIAM Journal on Discrete Mathematics

Clustering with Partial Information

article published in Lecture Notes in Computer Science

Clustering with partial information

article by Hans L. Bodlaender et al published February 2010 in Theoretical Computer Science

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

scholarly article by Tim Bell et al published 2012 in Lecture Notes in Computer Science

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Distortion Is Fixed Parameter Tractable

Distortion is Fixed Parameter Tractable

Dynamic dominating set and turbo-charging greedy heuristics

Fixed-Parameter Algorithms for Kemeny Scores

scholarly article published in Lecture Notes in Computer Science

Fixed-parameter algorithms for Kemeny rankings

scholarly article by Nadja Betzler et al published October 2009 in Theoretical Computer Science

Graph Layout Problems Parameterized by Vertex Cover

Guest editorial: Special issue on parameterized complexity

Haplotype Inference Constrained by Plausible Haplotype Data

article by Michael R. Fellows et al published 2009 in Lecture Notes in Computer Science

Haplotype inference constrained by plausible haplotype data

scientific article

Leaf Powers and Their Properties: Using the Trees

article published in 2008

Local search: Is brute-force avoidable?

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective

article published in 2010

Myhill-Nerode Methods for Hypergraphs

On complexity of lobbying in multiple referenda

On the Complexity of Some Colorful Problems Parameterized by Treewidth

On the Parameterized Complexity of Layered Graph Drawing

On the complexity of some colorful problems parameterized by treewidth

On the parameterized complexity of multiple-interval graph problems

Parameterized Approximation via Fidelity Preserving Transformations

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

Parameterized approximation of dominating set problems

Parameterizing by the Number of Numbers

Parameterizing by the Number of Numbers

Passion Plays: Melodramas about Mathematics

Quadratic Kernelization for Convex Recoloring of Trees

Reaching out to the media

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

scientific article (publication date: 29 January 2009)

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

article published in 2007

The Complexity of Polynomial-Time Approximation

The Parameterized Complexity of Stabbing Rectangles

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

Tractable Parameterizations for the Minimum Linear Arrangement Problem

Train Marshalling Is Fixed Parameter Tractable

W-Hierarchies Defined by Symmetric Gates

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

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

What Makes Equitable Connected Partition Easy

article by Rosa Enciso et al published 2009 in Lecture Notes in Computer Science

nonblocker: Parameterized Algorithmics for minimum dominating set

Paulina is supported by:

About Paulina

Help