1. Gál, A., Halevi, S., Lipton, R., Petrank, E.: Computing from partial solutions. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp. 34–45. IEEE Computer Society Press, Los Alamitos (1999)
2. Große, A., Rothe, J., Wechsung, G.: Relating partial and complete solutions and the complexity of computing smallest solutions. In: Proceedings of the Seventh Italian Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2202, pp. 339–356. Springer, Berlin (2001)
3. Große, A., Rothe, J., Wechsung, G.: Computing complete graph isomorphisms and Hamiltonian cycles from partial ones. Theory Comput. Syst. 35, 81–93 (2002)
4. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Basel (1993)
5. Lozano, A., Torán, J.: On the nonuniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, pp. 118–129, 1992