Michael T. Hallett

Available identifiers

Publication	Date of Publication	Type
Frege on Creation	2020-08-19	Paper
Beyond NP-completeness for problems of bounded width (extended abstract)	2016-09-01	Paper
Absoluteness and the Skolem Paradox	2012-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q3526581	2008-09-25	Paper
A faster FPT algorithm for the maximum agreement forest problem	2007-12-19	Paper
A fixed-parameter approach to 2-layer planarization	2006-08-11	Paper
Analogs & duals of the MAST problem for sequences & trees	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3043700	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4472468	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4796197	2003-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4501141	2000-09-03	Paper
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4252027	2000-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4249534	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4324697	1995-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q3803101	1986-01-01	Paper
Towards a Theory of Mathematical Research Programmes (I)	1979-01-01	Paper
Towards a Theory of Mathematical Research Programmes (II)	1979-01-01	Paper

This page was built for person: Michael T. Hallett