1. T. Akutsu. An RNC algorithm for finding a largest common subtree of two trees. IEICE Transactions on Information and Systems, vol. E75-D, no. 1, pp. 95–101, Jan. 1992
2. T. Akutsu. On determining the congruity of point sets in higher dimensions. These proceedings.
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 14–23, Oct. 1992
4. B. Berger and J. Rompel. A better performance guarantee for approximate graph coloring. Algorithmica, vol. 5, no. 4, pp. 459–466, 1990.
5. C. Branden and J. Tooze. Introduction to Protein Structure, Garland Publishing Inc., New York, 1991