The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Catherine McCartin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rodney G. Downey, Catherine McCartin
    Bounded Persistence Pathwidth. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:51-56 [Conf]
  2. Rodney G. Downey, Catherine McCartin
    Some New Directions and Questions in Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:12-26 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:240-251 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  6. Rodney G. Downey, Michael R. Fellows, Catherine McCartin
    Parameterized Approximation Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:121-129 [Conf]
  7. Rodney G. Downey, Catherine McCartin
    Online Problems, Pathwidth, and Persistence. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:13-24 [Conf]
  8. Catherine McCartin
    Parameterized Counting Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:556-567 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  10. Catherine McCartin
    Parameterized counting problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:147-182 [Journal]
  11. Catherine McCartin
    An improved algorithm for the jump number problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:2, pp:87-92 [Journal]
  12. Rodney G. Downey, Catherine McCartin
    Online promise problems with online width metrics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:57-72 [Journal]
  13. Michael R. Fellows, Catherine McCartin
    On the parametric complexity of schedules to minimize tardy tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:317-324 [Journal]

  14. Cluster analysis of Java dependency graphs. [Citation Graph (, )][DBLP]


  15. Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs. [Citation Graph (, )][DBLP]


  16. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  17. On the Detection of High-Impact Refactoring Opportunities in Programs [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002