Catherine McCartin

Available identifiers

Publication	Date of Publication	Type
Bounding the maximum size of a minimal definitive set of quartets	2012-10-23	Paper
Parameterized approximation of dominating set problems	2010-06-09	Paper
A 3-approximation algorithm for the subtree distance between phylogenies	2009-05-13	Paper
On the parameterized complexity of layered graph drawing	2008-12-02	Paper
Parameterized Approximation Problems	2008-06-03	Paper
A faster FPT algorithm for the maximum agreement forest problem	2007-12-19	Paper
Online promise problems with online width metrics	2007-01-22	Paper
A fixed-parameter approach to 2-layer planarization	2006-08-11	Paper
Parameterized counting problems	2005-12-29	Paper
Developments in Language Theory	2005-12-22	Paper
Parameterized and Exact Computation	2005-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q3043700	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4472448	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4708603	2003-06-18	Paper
On the parametric complexity of schedules to minimize tardy tasks.	2003-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q4796197	2003-03-02	Paper
Basic complexity	2002-07-22	Paper
An improved algorithm for the jump number problem	2002-07-14	Paper

This page was built for person: Catherine McCartin