#### Filter Results:

- Full text PDF available (62)

#### Publication Year

2000

2018

- This year (2)
- Last 5 years (14)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
- Theor. Comput. Sci.
- 2009

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many applications of interval graphs also generalize to… (More)

- Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond
- Electr. Notes Theor. Comput. Sci.
- 2003

The Graph k-Cut problem is that of finding a set of edges of minimum total weight, in an edge-weighted graph, such that their removal from the graph results in a graph having at least k connected… (More)

We describe a broad program of research in parameterized complexity, and hows this plays out for the M AX LEAF SPANNING TREE problem.

- Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- SIAM J. Discrete Math.
- 2009

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order… (More)

- Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
- Inf. Process. Lett.
- 2008

A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a dominating set of… (More)

- Robin Christian, Mike Fellows, Frances A. Rosamond, Arkadii M. Slinko
- 2004

1 Department of Combinatorics and Optimization University of Waterloo, Canada (e-mail: r3christ@math.uwaterloo.ca) 2 Parameterized Complexity Research Unit, University of Newcastle, Australia… (More)

- Frank Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
- Theory of Computing Systems
- 2005

We describe an algorithm for the Feedback Vertex Set problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the… (More)

We describe an algorithm for the Feedback Vertex Set problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(cn) where c = 10.567 and n is the number… (More)

The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permutation”… (More)

- Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
- Theor. Comput. Sci.
- 2009