T. Biedl, J. Marks, and K. Ryall, Graph Multidrawing: Finding Nice Drawings Without Defining Nice, Graph Drawing, 1998.
DOI : 10.1007/3-540-37623-2_26

L. Groves, Z. Michalewicz, P. V. Elia, and C. Z. Janikow, Genetic algorithms for drawing directed graphs, for Intelligent Systems, 1990.

A. Markus, Experiments with genetic algorithms for displaying graphs, Proceedings 1991 IEEE Workshop on Visual Languages, pp.62-67, 1991.
DOI : 10.1109/WVL.1991.238849

C. Kosak, J. Marks, and S. Shieber, Automating the layout of network diagrams with specified visual organization, IEEE Transactions on Systems, Man, and Cybernetics, vol.24, issue.3, pp.440-454, 1994.
DOI : 10.1109/21.278993

U. A. Gen, D. Grafos, and D. T. Eloranta, TimGA: A Genetic Algorithm for Drawing Undirected Graphs, Computer, vol.9, issue.2, pp.155-171, 2001.

D. Goldberg and J. Holland, Genetic algorithms and machine learning, Machine Learning, pp.95-99, 1988.

D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, 1989.

H. Barbosa and A. Barreto, An interactive genetic algorithm with coevolution of weights for multiobjective problems, Proceedings of the Genetic and Evolutionary, pp.203-210, 2001.

M. Srinivas, L. Patnaik, and I. Cybernetics, Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Transactions on Systems, Man, and Cybernetics, vol.24, issue.4, pp.656-667, 1994.
DOI : 10.1109/21.286385

D. Goldberg, K. Deb, and J. Clark, Genetic algorithms, noise, and the sizing of populations Complex systems, 1991.

C. Ramsey and J. Grefenstette, Case-based initialization of genetic algorithms, Conference on Genetic Algorithms, 1993.

S. Louis and J. Johnson, Solving similar problems using genetic algorithms and case-based memory, International Conference on Genetic Algorithms, 1997.

S. Louis and J. Mcdonnell, Learning With Case-Injected Genetic Algorithms, IEEE Transactions on Evolutionary Computation, vol.8, issue.4, 2004.
DOI : 10.1109/TEVC.2004.823466

D. Ashlock, K. Bryden, and S. Corns, Small population effects and hybridization, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 2008.
DOI : 10.1109/CEC.2008.4631152

J. Lehman and K. Stanley, Exploiting open-endedness to solve problems through the search for novelty, Artificial Life, vol.11, p.329, 2008.

J. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, vol.18, issue.9, 1975.
DOI : 10.1145/361002.361007

A. Frick, A. Ludwig, and H. Mehldau, A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration), Graph Drawing, 1995.
DOI : 10.1007/3-540-58950-3_393

J. Friedman, J. Bentley, and R. Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software, vol.3, issue.3, 1977.
DOI : 10.1145/355744.355745