| 2007 |
|---|
| 14 | EE | Rodney G. Downey,
Catherine McCartin:
Online promise problems with online width metrics.
J. Comput. Syst. Sci. 73(1): 57-72 (2007) |
| 13 | EE | Michael T. Hallett,
Catherine McCartin:
A Faster FPT Algorithm for the Maximum Agreement Forest Problem.
Theory Comput. Syst. 41(3): 539-550 (2007) |
| 2006 |
|---|
| 12 | EE | Rodney G. Downey,
Michael R. Fellows,
Catherine McCartin:
Parameterized Approximation Problems.
IWPEC 2006: 121-129 |
| 11 | EE | 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:
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica 45(2): 159-182 (2006) |
| 10 | EE | Catherine McCartin:
Parameterized counting problems.
Ann. Pure Appl. Logic 138(1-3): 147-182 (2006) |
| 2005 |
|---|
| 9 | EE | Rodney G. Downey,
Catherine McCartin:
Bounded Persistence Pathwidth.
CATS 2005: 51-56 |
| 2004 |
|---|
| 8 | EE | Rodney G. Downey,
Catherine McCartin:
Some New Directions and Questions in Parameterized Complexity.
Developments in Language Theory 2004: 12-26 |
| 7 | EE | Rodney G. Downey,
Catherine McCartin:
Online Problems, Pathwidth, and Persistence.
IWPEC 2004: 13-24 |
| 2003 |
|---|
| 6 | EE | Michael R. Fellows,
Catherine McCartin:
On the parametric complexity of schedules to minimize tardy tasks.
Theor. Comput. Sci. 2(298): 317-324 (2003) |
| 2002 |
|---|
| 5 | EE | Catherine McCartin:
Parameterized Counting Problems.
MFCS 2002: 556-567 |
| 2001 |
|---|
| 4 | EE | 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:
On the Parameterized Complexity of Layered Graph Drawing.
ESA 2001: 488-499 |
| 3 | EE | 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:
A Fixed-Parameter Approach to Two-Layer Planarization.
Graph Drawing 2001: 1-15 |
| 2 | EE | Catherine McCartin:
An improved algorithm for the jump number problem.
Inf. Process. Lett. 79(2): 87-92 (2001) |
| 2000 |
|---|
| 1 | EE | Michael R. Fellows,
Catherine McCartin,
Frances A. Rosamond,
Ulrike Stege:
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
FSTTCS 2000: 240-251 |
