Catherine McCartin

31 papers A* 1A 3B 1C 1Misc 1Journal 12Unranked 12
YearRankTypeTitle / Venue / Authors
2023 A* conf
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract).
ICDE
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
2022 J jnl
Efficient Sink-Reachability Analysis via Graph Reduction.
IEEE Trans. Knowl. Data Eng.
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
2014 J jnl
Network parameters and heuristics in practice: a case study using the target set selection problem.
J. Complex Networks
Callum Lowcay, Stephen Marsland, Catherine McCartin
2014 — conf
On the Shape of Circular Dependencies in Java Programs.
Australian Software Engineering Conference
Hussain A. Al-Mutawa, Jens Dietrich, Stephen Marsland, Catherine McCartin
2013 — conf
Constrained Switching in Graphs: A Constructive Proof.
SITIS
Callum Lowcay, Stephen Marsland, Catherine McCartin
2013 — conf
Network Parameters in Practice: A Case Study Using the Target Set Selection Problem.
SITIS
Callum Lowcay, Stephen Marsland, Catherine McCartin
2013 — conf
On the Automation of Dependency-Breaking Refactorings in Java.
ICSM
Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin
2012 J jnl
Bounding the maximum size of a minimal definitive set of quartets.
Inf. Process. Lett.
Max Dietrich, Catherine McCartin, Charles Semple
2012 — conf
Making Smart Moves to Untangle Programs.
CSMR
Syed M. Ali Shah, Jens Dietrich, Catherine McCartin
2012 A conf
On the Automated Modularisation of Java Programs Using Service Locators.
SC
Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin
2012 — conf
On the Existence of High-Impact Refactoring Opportunities in Programs.
ACSC
Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah
2012 Misc conf
Scalable Motif Detection and Aggregation.
ADC
Jens Dietrich, Catherine McCartin
2010 — conf
Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs.
QoSA
Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah
2008 J jnl
A 3-approximation algorithm for the subtree distance between phylogenies.
J. Discrete Algorithms
Magnus Bordewich, Catherine McCartin, Charles Semple
2008 — conf
Cluster analysis of Java dependency graphs.
SOFTVIS
Jens Dietrich, Vyacheslav Yakovlev, Catherine McCartin, Graham Jenson, Manfred Duchrow
2008 J jnl
On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica
Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008 J jnl
Parameterized approximation of dominating set problems.
Inf. Process. Lett.
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
2007 J jnl
A Faster FPT Algorithm for the Maximum Agreement Forest Problem.
Theory Comput. Syst.
Michael T. Hallett, Catherine McCartin
2007 J jnl
Online promise problems with online width metrics.
J. Comput. Syst. Sci.
Rodney G. Downey, Catherine McCartin
2006 J jnl
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica
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
2006 — conf
Parameterized Approximation Problems.
IWPEC
Rodney G. Downey, Michael R. Fellows, Catherine McCartin
2006 J jnl
Parameterized counting problems.
Ann. Pure Appl. Log.
Catherine McCartin
2005 — conf
Bounded Persistence Pathwidth.
CATS
Rodney G. Downey, Catherine McCartin
2004 — conf
Online Problems, Pathwidth, and Persistence.
IWPEC
Rodney G. Downey, Catherine McCartin
2004 C conf
Some New Directions and Questions in Parameterized Complexity.
Developments in Language Theory
Rodney G. Downey, Catherine McCartin
2003 J jnl
On the parametric complexity of schedules to minimize tardy tasks.
Theor. Comput. Sci.
Michael R. Fellows, Catherine McCartin
2002 B conf
Parameterized Counting Problems.
MFCS
Catherine McCartin
2001 A conf
A Fixed-Parameter Approach to Two-Layer Planarization.
GD
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
2001 J jnl
An improved algorithm for the jump number problem.
Inf. Process. Lett.
Catherine McCartin
2001 A conf
On the Parameterized Complexity of Layered Graph Drawing.
ESA
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
2000 — conf
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
FSTTCS
Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege