Catherine McCartin

According to our database1, Catherine McCartin authored at least 30 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract).
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
Efficient Sink-Reachability Analysis via Graph Reduction.
IEEE Trans. Knowl. Data Eng., 2022

2014
Network parameters and heuristics in practice: a case study using the target set selection problem.
J. Complex Networks, 2014

On the Shape of Circular Dependencies in Java Programs.
Proceedings of the 23rd Australian Software Engineering Conference, 2014

2013
Constrained Switching in Graphs: A Constructive Proof.
Proceedings of the Ninth International Conference on Signal-Image Technology & Internet-Based Systems, 2013

Network Parameters in Practice: A Case Study Using the Target Set Selection Problem.
Proceedings of the Ninth International Conference on Signal-Image Technology & Internet-Based Systems, 2013

On the Automation of Dependency-Breaking Refactorings in Java.
Proceedings of the 2013 IEEE International Conference on Software Maintenance, 2013

2012
Bounding the maximum size of a minimal definitive set of quartets.
Inf. Process. Lett., 2012

On the Automated Modularisation of Java Programs Using Service Locators.
Proceedings of the Software Composition - 11th International Conference, 2012

Making Smart Moves to Untangle Programs.
Proceedings of the 16th European Conference on Software Maintenance and Reengineering, 2012

Scalable Motif Detection and Aggregation.
Proceedings of the Twenty-Third Australasian Database Conference, 2012

On the Existence of High-Impact Refactoring Opportunities in Programs.
Proceedings of the Thirty-Fifth Australasian Computer Science Conference, 2012

2010
Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs.
Proceedings of the Research into Practice, 2010

2008
A 3-approximation algorithm for the subtree distance between phylogenies.
J. Discrete Algorithms, 2008

Parameterized approximation of dominating set problems.
Inf. Process. Lett., 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

Cluster analysis of Java dependency graphs.
Proceedings of the ACM 2008 Symposium on Software Visualization, 2008

2007
A Faster FPT Algorithm for the Maximum Agreement Forest Problem.
Theory Comput. Syst., 2007

Online promise problems with online width metrics.
J. Comput. Syst. Sci., 2007

2006
Parameterized counting problems.
Ann. Pure Appl. Log., 2006

A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Parameterized Approximation Problems.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005
Bounded Persistence Pathwidth.
Proceedings of the Theory of Computing 2005, 2005

2004
Online Problems, Pathwidth, and Persistence.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Some New Directions and Questions in Parameterized Complexity.
Proceedings of the Developments in Language Theory, 2004

2003
On the parametric complexity of schedules to minimize tardy tasks.
Theor. Comput. Sci., 2003

2001
An improved algorithm for the jump number problem.
Inf. Process. Lett., 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000


  Loading...