1. Lecture Notes in Computer Science;L. Baptista,2000
2. Baptista, L., Lynce, I., Marques-Silva, J.P.: Complete Search Restart Strategies for Satisfiability. In: IJCAI 2001 Workshop on Stochastic Search Algorithms (IJCAI-SSA) (August 2001)
3. Bayardo, R., Schrag, R.: Using CSP look-back techniques to solve exceptionally hard SAT instances. In: Proceedings of CP 1996 (1996)
4. Bennett, F.E., Du, B., Zhang, H.: Conjugate orthogonal diagonal latin squares with missing subsquares. In: Wallis, W. (ed.) Designs 2002: Further Computational and Constructive Design Theory, ch. 2, Kluwer Academic Publishers, Boston (2003)
5. Bennett, F.E., Zhang, H.: Latin squares with self-orthogonal conjugates. Discrete Mathematics 284, 45–55 (2004)