1. Lect Notes Comput Sci;A. Biere,1999
2. T. Blickle and L. Thiele, A mathematical analysis of tournament selection, Proceedings of the Sixth ICGA, Morgan Kaufmann Publishers, San Francisco, Ca., 1995, pp. 9–16.
3. E. Cutchill and J. McKee, Reducing the bandwidth of sparse symmetric matrices, Proceedings 24th National of the ACM (1969), 157–172.
4. Y. Davidor, Epistasis Variance: A Viewpont of GA-Hardness, Proceedings of the Second Foundations of Genetic Algorithms Workshop, Morgan Kaufmann, 1991, pp. 23–35.
5. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of np-completeness, W.H. Freeman and Company, New York, 1979.