Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Catherine McCartin
2010 – today
- 2012
[j10]Max Dietrich, Catherine McCartin, Charles Semple: Bounding the maximum size of a minimal definitive set of quartets. Inf. Process. Lett. 112(16): 651-655 (2012)- [c14]Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah: On the Existence of High-Impact Refactoring Opportunities in Programs. ACSC 2012: 37-48
- [c13]
- [c12]Syed M. Ali Shah, Jens Dietrich, Catherine McCartin: Making Smart Moves to Untangle Programs. CSMR 2012: 359-364
- [c11]Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin: On the Automated Modularisation of Java Programs Using Service Locators. Software Composition 2012: 132-147
- 2010
- [c10]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: 135-150
- [i1]Jens Dietrich, Catherine McCartin, Ewan D. Tempero, Syed M. Ali Shah: On the Detection of High-Impact Refactoring Opportunities in Programs. CoRR abs/1006.1747 (2010)
2000 – 2009
- 2008
- [j9]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): 267-292 (2008)
- [j8]Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
- [j7]Magnus Bordewich, Catherine McCartin, Charles Semple: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008)
- [c9]Jens Dietrich, Vyacheslav Yakovlev, Catherine McCartin, Graham Jenson, Manfred Duchrow: Cluster analysis of Java dependency graphs. SOFTVIS 2008: 91-94
- 2007
- [j6]Rodney G. Downey, Catherine McCartin: Online promise problems with online width metrics. J. Comput. Syst. Sci. 73(1): 57-72 (2007)
- [j5]Michael T. Hallett, Catherine McCartin: A Faster FPT Algorithm for the Maximum Agreement Forest Problem. Theory Comput. Syst. 41(3): 539-550 (2007)
- 2006
- [j4]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): 159-182 (2006)
- [j3]
- [c8]Rodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
- 2005
- [c7]
- 2004
- [c6]Rodney G. Downey, Catherine McCartin: Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory 2004: 12-26
- [c5]Rodney G. Downey, Catherine McCartin: Online Problems, Pathwidth, and Persistence. IWPEC 2004: 13-24
- 2003
- [j2]Michael R. Fellows, Catherine McCartin: On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 2(298): 317-324 (2003)
- 2002
- [c4]
- 2001
- [j1]Catherine McCartin: An improved algorithm for the jump number problem. Inf. Process. Lett. 79(2): 87-92 (2001)
- [c3]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: 488-499
- [c2]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: 1-15
- 2000
- [c1]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: 240-251
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-22 21:57 CEST by the dblp team