Catherine McCartin

From MaRDI portal
Person:456076


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Bounding the maximum size of a minimal definitive set of quartets
Information Processing Letters
2012-10-23Paper
Parameterized approximation of dominating set problems
Information Processing Letters
2010-06-09Paper
A 3-approximation algorithm for the subtree distance between phylogenies
Journal of Discrete Algorithms
2009-05-13Paper
On the parameterized complexity of layered graph drawing
Algorithmica
2008-12-02Paper
Parameterized Approximation Problems
Parameterized and Exact Computation
2008-06-03Paper
A faster FPT algorithm for the maximum agreement forest problem
Theory of Computing Systems
2007-12-19Paper
Online promise problems with online width metrics
Journal of Computer and System Sciences
2007-01-22Paper
A fixed-parameter approach to 2-layer planarization
Algorithmica
2006-08-11Paper
Parameterized counting problems
Annals of Pure and Applied Logic
2005-12-29Paper
Developments in Language Theory
Lecture Notes in Computer Science
2005-12-22Paper
Parameterized and Exact Computation
Lecture Notes in Computer Science
2005-08-23Paper
scientific article; zbMATH DE number 2084262 (Why is no real title available?)
 
2004-08-06Paper
scientific article; zbMATH DE number 2080206 (Why is no real title available?)
 
2004-08-04Paper
scientific article; zbMATH DE number 1929968 (Why is no real title available?)
 
2003-06-18Paper
On the parametric complexity of schedules to minimize tardy tasks.
Theoretical Computer Science
2003-05-25Paper
scientific article; zbMATH DE number 1875438 (Why is no real title available?)
 
2003-03-02Paper
Basic complexity
 
2002-07-22Paper
An improved algorithm for the jump number problem
Information Processing Letters
2002-07-14Paper


Research outcomes over time


This page was built for person: Catherine McCartin