1. H. L. Bodlaender, M. R. Fellows, and M. Hallett. Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy. In Proceedings of the 26th Annual Symposium on Theory of Computing, pages 449–458, New York, 1994. ACM Press.
2. H. L. Bodlaender, M. R. Fellows, and T. J. Warnow. Two strikes against perfect phylogeny. In Proceedings 19th International Colloquium on Automata, Languages and Programming, pages 273–283, Berlin, 1992. Springer Verlag, Lecture Notes in Computer Science, vol. 623.
3. H. L. Bodlaender and T. Kloks. A simple linear time algorithm for triangulating three-colored graphs. J. Algorithms, 15:160–172, 1993.
4. J. A. Ellis, I. H. Sudborough, and J. Turner. The vertex separation and search number of a graph. Information and Computation, 113:50–79, 1994.
5. M. R. Fellows, M. T. Halett, and H. T. Wareham. DNA physical mapping: Three ways difficult (extended abstract). In T. Lengauer, editor, Proceedings 1st Annual European Symposium on Algorithms ESA '93, pages 157–168. Springer Verlag, Lecture Notes in Computer Science, vol. 726, 1993.