1. , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. (1974).
2. The Characteristic Polyomial Does Not Uniquely Determine the Topology of a Molecule
3. Problems polynomially equivalent to graph isomorphism. Proceedings of the Symposium on New Directions and Recent Results in Algorithms and Complexity. Carnegie-Mellon University (April 1976).
4. and , Linear algorithms to recognize interval graphs and test for consecutive ones property. Proceedings of the 7th Annual ACM Symposium on the Theory of Computing. (May 1975) 255–265.
5. Computational Complexity: theory and practice. Currents in the Theory of Computing. Ed. Prentice-Hall, Englewood Cliffs, N. J. (1973) 35–89.