1. Berman, Len and Juris Hartmanis. “On Isomorphisms and Density of NP-and other Complete Sets”, SIAM J. on Comput., 6(2), 1977, 305–322.
2. Coppersmith, Don and Joan Feigenbaum. “Finite Graphs with Two Inequivalent Factorizations Under the Composition Operator”, IBM Research Report RC11149, 1985, submitted to Journal of Combinatorial Theory, Series B.
3. Feigenbaum, Joan and Alejandro A. Schäffer, “Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism”, to appear in SIAM J. on Comput.
4. Mahaney, Stephen R. “On the Number of p-isomorphism Classes of NP-complete Sets”, Proc. 22nd Annual IEEE Symposium on the Foundations of Computer Science, 22, 1981, 271–278.
5. Plaisted, David. “Some Polynomial and Integer Divisibility Problems are NP-hard”, Proc. 17th Annual IEEE Symposium on the Foundations of Computer Science, 17, 1976, 264–267.