Catherine McCartin

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 2

Top Topics

Reachability Analysis

Extended Abstract

Top Venues

J. Complex Networks

Australian Software Engineering Conference

Publications

Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). ICDE (2023)
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
Efficient Sink-Reachability Analysis via Graph Reduction. IEEE Trans. Knowl. Data Eng. 34 (11) (2022)
Hussain A. Al-Mutawa, Jens Dietrich, Stephen Marsland, Catherine McCartin
On the Shape of Circular Dependencies in Java Programs. Australian Software Engineering Conference (2014)
Callum Lowcay, Stephen Marsland, Catherine McCartin
Network parameters and heuristics in practice: a case study using the target set selection problem. J. Complex Networks 2 (4) (2014)
Callum Lowcay, Stephen Marsland, Catherine McCartin
Network Parameters in Practice: A Case Study Using the Target Set Selection Problem. SITIS (2013)
Callum Lowcay, Stephen Marsland, Catherine McCartin
Constrained Switching in Graphs: A Constructive Proof. SITIS (2013)
Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin
On the Automation of Dependency-Breaking Refactorings in Java. ICSM (2013)
Syed M. Ali Shah, Jens Dietrich, Catherine McCartin
Making Smart Moves to Untangle Programs. CSMR (2012)
Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah
On the Existence of High-Impact Refactoring Opportunities in Programs. ACSC (2012)
Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin
On the Automated Modularisation of Java Programs Using Service Locators. SC@TOOLS (2012)
Max Dietrich, Catherine McCartin, Charles Semple
Bounding the maximum size of a minimal definitive set of quartets. Inf. Process. Lett. 112 (16) (2012)
Jens Dietrich, Catherine McCartin
Scalable Motif Detection and Aggregation. ADC (2012)
Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah
Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs. QoSA (2010)
Magnus Bordewich, Catherine McCartin, Charles Semple
A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6 (3) (2008)
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
Parameterized approximation of dominating set problems. Inf. Process. Lett. 109 (1) (2008)
Jens Dietrich, Vyacheslav Yakovlev, Catherine McCartin, Graham Jenson, Manfred Duchrow
Cluster analysis of Java dependency graphs. SOFTVIS (2008)
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) (2008)
Rodney G. Downey, Catherine McCartin
Online promise problems with online width metrics. J. Comput. Syst. Sci. 73 (1) (2007)
Michael T. Hallett, Catherine McCartin
A Faster FPT Algorithm for the Maximum Agreement Forest Problem. Theory Comput. Syst. 41 (3) (2007)
Rodney G. Downey, Michael R. Fellows, Catherine McCartin
Parameterized Approximation Problems. IWPEC (2006)
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) (2006)
Catherine McCartin
Parameterized counting problems. Ann. Pure Appl. Log. 138 (1-3) (2006)
Rodney G. Downey, Catherine McCartin
Bounded Persistence Pathwidth. CATS (2005)
Rodney G. Downey, Catherine McCartin
Online Problems, Pathwidth, and Persistence. IWPEC (2004)
Rodney G. Downey, Catherine McCartin
Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory (2004)
Michael R. Fellows, Catherine McCartin
On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 298 (2) (2003)
Catherine McCartin
Parameterized Counting Problems. MFCS (2002)
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)
Catherine McCartin
An improved algorithm for the jump number problem. Inf. Process. Lett. 79 (2) (2001)
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)
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)