default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCatherine McCartin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Jens Dietrich
, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz:
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). ICDE 2023: 3897-3898- 2022
- [j12]Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz:
Efficient Sink-Reachability Analysis via Graph Reduction. IEEE Trans. Knowl. Data Eng. 34(11): 5321-5335 (2022)
2010 – 2019
- 2014
- [j11]Callum Lowcay, Stephen Marsland, Catherine McCartin:
Network parameters and heuristics in practice: a case study using the target set selection problem. J. Complex Networks 2(4): 373-393 (2014) - [c18]Hussain A. Al-Mutawa, Jens Dietrich, Stephen Marsland, Catherine McCartin:
On the Shape of Circular Dependencies in Java Programs. Australian Software Engineering Conference 2014: 48-57 - 2013
- [c17]Syed Muhammad Ali Shah, Jens Dietrich, Catherine McCartin:
On the Automation of Dependency-Breaking Refactorings in Java. ICSM 2013: 160-169 - [c16]Callum Lowcay, Stephen Marsland, Catherine McCartin:
Network Parameters in Practice: A Case Study Using the Target Set Selection Problem. SITIS 2013: 521-529 - [c15]Callum Lowcay, Stephen Marsland, Catherine McCartin:
Constrained Switching in Graphs: A Constructive Proof. SITIS 2013: 599-604 - 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]Jens Dietrich, Catherine McCartin:
Scalable Motif Detection and Aggregation. ADC 2012: 31-40 - [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. SC@TOOLS 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
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]Catherine McCartin:
Parameterized counting problems. Ann. Pure Appl. Log. 138(1-3): 147-182 (2006) - [c8]Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems. IWPEC 2006: 121-129 - 2005
- [c7]Rodney G. Downey, Catherine McCartin:
Bounded Persistence Pathwidth. CATS 2005: 51-56 - 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. 298(2): 317-324 (2003) - 2002
- [c4]Catherine McCartin:
Parameterized Counting Problems. MFCS 2002: 556-567 - 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. GD 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
