Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. - Michael R. Fellows; Catherine McCartin; Frances A. Rosamond; Ulrike Stege (FSTTCS, 2000)

On the Parameterized Complexity of Layered Graph Drawing. - 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 (ESA, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - 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 (GD, 2001)

An improved algorithm for the jump number problem. - Catherine McCartin (Inf. Process. Lett., 2001)

On the parametric complexity of schedules to minimize tardy tasks. - Michael R. Fellows; Catherine McCartin (Theor. Comput. Sci., 2003)

Some New Directions and Questions in Parameterized Complexity. - Rodney G. Downey; Catherine McCartin (Developments in Language Theory, 2004)

Online Problems, Pathwidth, and Persistence. - Rodney G. Downey; Catherine McCartin (IWPEC, 2004)

Bounded Persistence Pathwidth. - Rodney G. Downey; Catherine McCartin (CATS, 2005)

Parameterized Approximation Problems. - Rodney G. Downey; Michael R. Fellows; Catherine McCartin (IWPEC, 2006)

A Fixed-Parameter Approach to 2-Layer Planarization. - 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 (Algorithmica, 2006)

Parameterized counting problems. - Catherine McCartin (Ann. Pure Appl. Log., 2006)

Online promise problems with online width metrics. - Rodney G. Downey; Catherine McCartin (J. Comput. Syst. Sci., 2007)

A Faster FPT Algorithm for the Maximum Agreement Forest Problem. - Michael T. Hallett; Catherine McCartin (Theory Comput. Syst., 2007)

Cluster analysis of Java dependency graphs. - Jens Dietrich 001; Vyacheslav Yakovlev; Catherine McCartin; Graham Jenson; Manfred Duchrow (SOFTVIS, 2008)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Sue Whitesides; David R. Wood (Algorithmica, 2008)

Parameterized approximation of dominating set problems. - Rodney G. Downey; Michael R. Fellows; Catherine McCartin; Frances A. Rosamond (Inf. Process. Lett., 2008)

A 3-approximation algorithm for the subtree distance between phylogenies. - Magnus Bordewich; Catherine McCartin; Charles Semple (J. Discrete Algorithms, 2008)

Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs. - Jens Dietrich 001; Catherine McCartin; Ewan D. Tempero; Syed M. Ali Shah (QoSA, 2010)

On the Existence of High-Impact Refactoring Opportunities in Programs. - Jens Dietrich 001; Catherine McCartin; Ewan D. Tempero; Syed M. Ali Shah (ACSC, 2012)

Scalable Motif Detection and Aggregation. - Jens Dietrich 001; Catherine McCartin (ADC, 2012)

Making Smart Moves to Untangle Programs. - Syed M. Ali Shah; Jens Dietrich 001; Catherine McCartin (CSMR, 2012)

On the Automated Modularisation of Java Programs Using Service Locators. - Syed Muhammad Ali Shah; Jens Dietrich 001; Catherine McCartin (SC@TOOLS, 2012)

Bounding the maximum size of a minimal definitive set of quartets. - Max Dietrich; Catherine McCartin; Charles Semple (Inf. Process. Lett., 2012)

On the Automation of Dependency-Breaking Refactorings in Java. - Syed Muhammad Ali Shah; Jens Dietrich 001; Catherine McCartin (ICSM, 2013)

Network Parameters in Practice: A Case Study Using the Target Set Selection Problem. - Callum Lowcay; Stephen Marsland; Catherine McCartin (SITIS, 2013)

Constrained Switching in Graphs: A Constructive Proof. - Callum Lowcay; Stephen Marsland; Catherine McCartin (SITIS, 2013)

On the Shape of Circular Dependencies in Java Programs. - Hussain A. Al-Mutawa; Jens Dietrich 001; Stephen Marsland; Catherine McCartin (Australian Software Engineering Conference, 2014)

Network parameters and heuristics in practice: a case study using the target set selection problem. - Callum Lowcay; Stephen Marsland; Catherine McCartin (J. Complex Networks, 2014)

Efficient Sink-Reachability Analysis via Graph Reduction. - Jens Dietrich 001; Lijun Chang; Long Qian; Lyndon M. Henry; Catherine McCartin; Bernhard Scholz (IEEE Trans. Knowl. Data Eng., 2022)

Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). - Jens Dietrich 001; Lijun Chang; Long Qian; Lyndon M. Henry; Catherine McCartin; Bernhard Scholz (ICDE, 2023)