Catherine McCartin

2008
18	EE	Jens Dietrich, Vyacheslav Yakovlev, Catherine McCartin, Graham Jenson, Manfred Duchrow: Cluster analysis of Java dependency graphs. SOFTVIS 2008: 91-94
17	EE	Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
16	EE	Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
15	EE	Magnus Bordewich, Catherine McCartin, Charles Semple: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008)
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

Coauthor Index

1	Magnus Bordewich	[15]
2	Jens Dietrich	[18]
3	Rodney G. Downey (Rod Downey)	[7] [8] [9] [12] [14] [16]
4	Manfred Duchrow	[18]
5	Vida Dujmovic	[3] [4] [11] [17]
6	Michael R. Fellows (Mike Fellows)	[1] [3] [4] [6] [11] [12] [16] [17]
7	Michael T. Hallett	[3] [4] [11] [13]
8	Graham Jenson	[18]
9	Matthew Kitching	[3] [4] [11] [17]
10	Giuseppe Liotta	[3] [4] [11] [17]
11	Naomi Nishimura	[3] [4] [11] [17]
12	Prabhakar Ragde	[3] [4] [11] [17]
13	Frances A. Rosamond	[1] [3] [4] [11] [16] [17]
14	Charles Semple	[15]
15	Ulrike Stege	[1]
16	Matthew Suderman (Matthew J. Suderman)	[3] [4] [11]
17	Sue Whitesides	[3] [4] [11] [17]
18	David R. Wood	[3] [4] [11] [17]
19	Vyacheslav Yakovlev	[18]

Colors in the list of coauthors