Dr Catherine McCartin staff profile picture

Contact details +64 (06) 356 9099  ext. 84230

Dr Catherine McCartin

Senior Lecturer

School of Engineering and Advanced Technology

Research Expertise

Research Interests

Graph Algorithms

Parameterized Complexity

Thematics

Design – for Commerce, Community and Culture

Area of Expertise

Field of research codes
Analysis of Algorithms and Complexity (080201): Applied Discrete Mathematics (080202): Computation Theory and Mathematics (080200): Information And Computing Sciences (080000)

Research Projects

Summary of Research Projects

Position Current Completed
Project Leader 0 1

Research Outputs

Journal

Lowcay, C., Marsland, S., & McCartin, C. (2014). Network parameters and heuristics in practice: A case study using the target set selection problem. Journal of Complex Networks. 2(4), 373-393
[Journal article]Authored by: Marsland, S., McCartin, C.
Dietrich, M., McCartin, C., & Semple, C. (2012). Bounding the maximum size of a minimal definitive set of quartets. Information Processing Letters. 112(16), 651-655
[Journal article]Authored by: McCartin, C.
Downey, RG., Fellows, MR., McCartin, C., & Rosamond, F. (2008). Parameterized approximation of dominating set problems. Information Processing Letters. 109(1), 68-70
[Journal article]Authored by: McCartin, C.
Downey, RG., Fellows, MR., McCartin, C., & Rosamond, F. (2008). Parameterized approximation of dominating set problems. Information Processing Letters. 109(1), 68-70
[Journal article]Authored by: McCartin, C.
Downey, RG., Fellows, MR., McCartin, C., & Rosamond, F. (2008). Parameterized approximation of dominating set problems. Information Processing Letters.
[Journal article]Authored by: McCartin, C.
Dujmović, V., Fellows, MR., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., . . . Wood, DR. (2008). On the parameterized complexity of layered graph drawing. Algorithmica (New York). 52(2), 267-292
[Journal article]Authored by: McCartin, C.
Downey, RG., Fellows, MR., McCartin, C., & Rosamond, F. (2008). Parameterized approximation of dominating set problems. Information Processing Letters. 109(1), 68-70
[Journal article]Authored by: McCartin, C.
Bordewich, M., McCartin, C., & Semple, C. (2008). A 3-approximation algorithm for the subtree distance between phylogenies. Journal of Discrete Algorithms. 6(3), 458-471
[Journal article]Authored by: McCartin, C.
Hallett, M., & McCartin, C. (2007). A faster FPT algorithm for the maximum agreement forest problem. Theory of Computing Systems. 41(3), 539-550
[Journal article]Authored by: McCartin, C.
Downey, RG., & McCartin, C. (2007). Online promise problems with online width metrics. Journal of Computer and System Sciences. 73(1), 57-72
[Journal article]Authored by: McCartin, C.
Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., Mccartin, C., . . . Wood, DR. (2006). A fixed-parameter approach to 2-layer planarization. Algorithmica (New York). 45(2), 159-182
[Journal article]Authored by: McCartin, C.
McCartin, CM. (2006). Parameterized counting problems. Annals of Pure and Applied Logic. 138(1-3), 147-182
[Journal article]Authored by: McCartin, C.
Rushton, DB., & McCartin, CM. (2004). Simulation package for reactive sensor networks. Projects: Project Papers by the Final-Year Students of the Bachelor of Engineering and Bachelor of Technology. 13, 140-144
[Journal article]Authored by: McCartin, C.
Fellows, MR., & McCartin, C. (2003). On the parametric complexity of schedules to minimize tardy tasks. Theoretical Computer Science. 298(2), 317-324
[Journal article]Authored by: McCartin, C.
McCartin, C. (2001). An improved algorithm for the jump number problem. Information Processing Letters. 79(2), 87-92
[Journal article]Authored by: McCartin, C.
Dietrich, J., McCartin, C., Tempero, E., & Shah, SMA.On the Detection of High-Impact Refactoring Opportunities in Programs.
[Journal article]Authored by: McCartin, C.

Book

Downey, RG., & McCartin, CM. (2009). Parameterized Algorithms. In MJ. Atallah, & M. Blanton (Eds.) Algorithms and Theory of Computation Handbook: General Concepts and Techniques. (pp. 1 - 30). Boca Raton, FL, United States: CRC Press
[Chapter]Authored by: McCartin, C.
Allender, E., & McCartin, CM. (2001). Basic complexity. In R. Downey, & DH. Eds (Eds.) Aspects of complexity: Minicourses in algorithmics, complexity and computational algebra: Mathematics Workshop, Kaikoura, January 7-15, 2000. (pp. 1 - 28). Berlin, Germany: Walter de Gruyter
[Chapter]Authored by: McCartin, C.

Thesis

McCartin, CM. (2003). Contributions to parameterized complexity. (Doctoral Thesis, Victoria University of Wellington)
[Doctoral Thesis]Authored by: McCartin, C.

Conference

Al-Mutawa, HA., Dietrich, J., Marsland, S., & McCartin, C. (2014). On the shape of circular dependencies in java programs. Proceedings of the Australian Software Engineering Conference, ASWEC. (pp. 48 - 57).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., Marsland, S., McCartin, C.
Shah, SMA., Dietrich, J., & McCartin, C. (2013). On the automation of dependency-breaking refactorings in java. IEEE International Conference on Software Maintenance, ICSM. (pp. 160 - 169).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Lowcay, C., Marsland, S., & McCartin, C. (2013). Constrained switching in graphs: A constructive proof. Proceedings - 2013 International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2013. (pp. 599 - 604).
[Conference Paper in Published Proceedings]Authored by: Marsland, S., McCartin, C.
Lowcay, C., Marsland, S., & McCartin, C. (2013). Network parameters in practice: A case study using the target set selection problem. Proceedings - 2013 International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2013. (pp. 521 - 529).
[Conference Paper in Published Proceedings]Authored by: Marsland, S., McCartin, C.
Dietrich, J., McCartin, C., Tempero, E., & Shah, SMA. (2012). On the existence of high-impact refactoring opportunities in programs. Conferences in Research and Practice in Information Technology Series. Vol. 122 (pp. 37 - 47).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Dietrich, J., & McCartin, C. (2012). Scalable motif detection and aggregation. In R. Zhang, & Y. Zhang (Eds.) Proceedings of the Twenty-Third Australasian Database Conference-Volume 124. (pp. 31 - 40). Australia: Australasian Database Conference (ADC 2012)
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Shah, SMA., Dietrich, J., & McCartin, C. (2012). Making smart moves to untangle programs. Proceedings of the European Conference on Software Maintenance and Reengineering, CSMR. (pp. 359 - 364).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Shah, SMA., Dietrich, J., & McCartin, C. (2012). On the automated modularisation of java programs using service locators. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7306 LNCS (pp. 132 - 147).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Dietrich, J., McCartin, C., Tempero, E., & Ali Shah, SM. (2010). Barriers to modularity - An empirical study to assess the potential for modularisation of Java programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6093 LNCS (pp. 135 - 150).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Dietrich, J., Yakovlev, V., McCartiny, C., Jenson, G., & Duchrow, M. (2008). Cluster analysis of Java dependency graphs. SOFTVIS 2008 - Proceedings of the 4th ACM Symposium on Software Visualization. (pp. 91 - 94).
[Conference Paper in Published Proceedings]Authored by: Dietrich, J., McCartin, C.
Downey, RG., Fellows, MR., & McCartin, C. (2006). Parameterized approximation problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4169 LNCS (pp. 121 - 129).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Downey, RG., & McCartin, C. (2005). Bounded persistence pathwidth. Conferences in Research and Practice in Information Technology Series. Vol. 41
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Downey, RG., & McCartin, C. (2004). Online problems, pathwidth, and persistence. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3162 (pp. 13 - 24).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Downey, RG., & McCartin, C. (2004). Some new directions and questions in parameterized complexity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3340 (pp. 12 - 26).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
McCartin, C. (2002). Parameterized counting problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2420 (pp. 556 - 567).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Dujmovic, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., . . . Wood, DR. (2002). A fixed-parameter approach to two-layer planarization. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2265 LNCS (pp. 1 - 15).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., . . . Wood, DR. (2001). On the parameterized complexity of layered graph drawing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2161 (pp. 488 - 499).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.
Fellows, MR., McCartin, C., Rosamond, FA., & Stege, U. (2000). Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1974 (pp. 240 - 251).
[Conference Paper in Published Proceedings]Authored by: McCartin, C.

Supervision and Teaching

Summary of Doctoral Supervision

Position Current Completed
Supervisor 0 1
CoSupervisor 3 1

Current Doctoral Supervision

CoSupervisor of:

  • Li Sui - PhD
    An Investigation into the Unsoundness of Static Program Analysis
  • Wendy Ye - PhD
    Semantically Meaningful Sample Databases for Constraint Verification
  • Mehmood Baryalai - PhD
    A Platform for Practical Homomorphic Encryption in Neural Network Classification

Completed Doctoral Supervision

Supervisor of:

CoSupervisor of:

Massey Contact Centre Mon - Fri 8:30am to 5:00pm 0800 MASSEY (+64 6 350 5701) TXT 5222 contact@massey.ac.nz Web chat Staff Alumni News Māori @ Massey