1. Altenberg, L.: Fitness Distance Correlation Analysis: An Instructive Counterexample. In: Back, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 57–64. Morgan Kaufmann, San Francisco (1997)
2. Collins, M.: Finding Needles in Haystacks is Harder with Neutrality. In: Beyer, H.-G., O’Reilly, U.-M., Arnold, D.V., Banzhaf, W., Blum, C., Bonabeau, E.W., Cantu-Paz, E., Dasgupta, D., Deb, K., Foster, J.A., de Jong, E.D., Lipson, H., Llora, X., Mancoridis, S., Pelikan, M., Raidl, G.R., Soule, T., Tyrrell, A.M., Watson, J.-P., Zitzler, E. (eds.) GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, June 2005, vol. 2, pp. 1613–1618. ACM Press, New York (2005)
3. Galván-López, E.: An Analysis of the Effects of Neutrality on Problem Hardness for Evolutionary Algorithms. PhD thesis, School of Computer Science and Electronic Engineering, University of Essex, United Kingdom (2009)
4. Lecture Notes in Computer Science;E. Galván-López,2008
5. Lecture Notes in Computer Science;E. Galván-López,2006