#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2000

2014

- This year (0)
- Last 5 years (5)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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)

- Magnus Bordewich, Catherine McCartin, Charles Semple
- J. Discrete Algorithms
- 2008

In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and theâ€¦ (More)

- Rodney G. Downey, Michael R. Fellows, Catherine McCartin
- IWPEC
- 2006

Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis, alongside approximation, randomization, and the like. It is fair to sayâ€¦ (More)

- Michael T. Hallett, Catherine McCartin
- Theory of Computing Systems
- 2007

Given two unrooted, binary trees, T1 and T2, leaf labelled bijectively by a set of species L, the Maximum Agreement Forest (MAF) problem asks to find a minimum cardinality collection F = {t1, ...,â€¦ (More)

- Vida Dujmovic, Michael R. Fellows, +9 authors David R. Wood
- Graph Drawing
- 2001

- Callum Lowcay, Stephen R. Marsland, Catherine McCartin
- 2013 International Conference on Signal-Imageâ€¦
- 2013

Many real networks exhibit strongly-skewed, heavy-tailed degree distributions, one of the indicators of so-called `complex' networks, and there is a lot of current research in this area. Much of thisâ€¦ (More)

- Vida Dujmovic, Michael R. Fellows, +9 authors David R. Wood
- Algorithmica
- 2005

A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers.â€¦ (More)

- Michael R. Fellows, Catherine McCartin
- Theor. Comput. Sci.
- 2003

Given a set T of tasks, each of unit length and having an individual deadline d(t)âˆˆ Z, a set of precedence constraints on T , and a positive integer k6 |T |, we can ask â€œIs there a one-processorâ€¦ (More)

- Catherine McCartin
- Ann. Pure Appl. Logic
- 2006

We present a novel approach to the analysis of dependency graphs of object-oriented programs. We propose to use the Girvan-Newman clustering algorithm to compute the modular structure of programs.â€¦ (More)