Bodlaender H, Downey R G, Fellows M, Hallett M, Wareham HT (1995) Parameterized Complexity Analysis in Computational Biology. Comput Appl Bioscience 11(1):49-57. PMID: 7796275
Bodlaender H, Fellows, M, Hallett M (1994)
Beyond NP-completeness for problems of bounded width, 26 th Annual Symposium on Theory of Computing (STOC) Montreal 449-458.
Bodlaender H, Downey R, Fellows M, Hallett M, Wareham HT (1994) Parameterized Complexity Analysis in Computational Biology, IEEE Workshop on Shape and Pattern Matching in Computational Biology.
Downey R, Fellows M, Hallett M, Kapron B, Wareham T (1994) The Parameterized Complexity of Some Problems From Logic and Linguistics, International Logic Programming Symposium. In: Informal Proceedings of the Workshop: Structural Complexity and Recursion-theoretic methods in Logic Programming. Cornell University Tech. Report.
Downey R, Fellows M, Hallett M, Kapron B, Wareham T (1994) The Parameterized Complexity of Some Problems from Logic and Linguistics, Logic in St. Petersburg. Lecture Notes in Computer Science no. 813. Springer-Verlag, Berlin 89-101.
Hallett M, Wareham HT (1994) A compendium of parameterized complexity results. Newsletter ACM SIGACT News, col. 25, issue 3, p122-123
Fellows M, Hallett M, Wareham T (1993). DNA Physical Mapping: 3 Ways Difficult. 1st European Symposium on Algorithms, ESA ’93. In: Springer-Verlag Lectures Notes (726) on Computer Science ESA ’93. ed. Tom Lengauer 157-168.