K. Andrews, Visualizing cyberspace: Information visualization in the Harmony Internet browser, Proc. IEEE Symp. Inform. Visual, pp.97-105, 1995.

S. Bridgeman and R. Tamassia, A User Study in Similarity Measures for Graph Drawing, Journal of Graph Algorithms and Applications, vol.6, issue.3, pp.225-254, 2002.
DOI : 10.7155/jgaa.00053

W. Buntine, Graphical models for knowledge discovery Advances in Knowledge Discovery and Data Mining, pp.59-83, 1996.

C. A. Coello-coello, D. A. Van-veldhuizen, and G. B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems of Genetic Algorithms and Evolutionary Computation, 2002.

M. Carpano, Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.10, issue.11, pp.10-705, 1980.
DOI : 10.1109/TSMC.1980.4308390

G. Di-battista, P. Eades, R. Tamassia, and I. , Tollis: 1999, Graph drawing -Algorithms for the visualization of graphs

P. Eades, W. Lai, K. Misue, and K. Sugiyama, Preserving the mental map of a diagram, Proc. of Compugraphics, pp.24-33, 1991.

P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs, Algorithmica, vol.7, issue.2, pp.379-403, 1994.
DOI : 10.1007/BF01187020

T. Eschbach, W. Günther, R. Drechsler, and B. Becker, Crossing Reduction by Windows Optimization, Proc. of the 10 th Int. Symposium on Graph Drawing, pp.285-294, 2002.
DOI : 10.1007/3-540-36151-0_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5331

E. Gansner, S. North, and K. Vo, A program that draws directed graphs'. Software - Practice and Experience, pp.1047-1062, 1988.
DOI : 10.1002/spe.4380181104
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3837

M. Garey and D. Johnson, Crossing Number is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.4, issue.3, pp.312-316, 1983.
DOI : 10.1137/0604033

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

L. Groves, Z. Michalewicz, P. Elia, and C. Janikow, Genetic Algorithms for Drawing Directed Graphs, Proc. of the 5 th Int. Symp. on Methodologies for Intelligent Systems, pp.268-276, 1990.

I. Herman, G. Melançon, and S. Marshall, Graph visualization and navigation in information visualization: A survey, IEEE Transactions on Visualization and Computer Graphics, vol.6, issue.1, pp.24-43, 2000.
DOI : 10.1109/2945.841119

H. Kargupta, K. Deb, and D. Goldberg, Ordering genetic algorithms and deception, Proc. Parallel Problem Solving from Nature, pp.47-56, 1992.

M. J. Kraak and A. Brown, Web Cartography: Developments and Prospects. Taylor&Francis, 2000.
DOI : 10.4324/9780203305768

P. Kuntz, B. Pinaud, and R. Lehn, Elements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs, Metaheuristics: Computer Decision-Making, pp.405-420, 2004.
DOI : 10.1007/978-1-4757-4137-7_19
URL : https://hal.archives-ouvertes.fr/inria-00335923

M. Laguna, R. Marti, and V. Valls, Arc crossing minimization in hierarchical digraphs with tabu search, Computers & Operations Research, vol.24, issue.12, pp.1175-1186, 1997.
DOI : 10.1016/S0305-0548(96)00083-4

E. Mäkinen and M. Sieranta, Genetic algorithms for drawing bipartite graphs, International Journal of Computer Mathematics, vol.17, issue.3-4, pp.3-4, 1994.
DOI : 10.1111/j.1749-6632.1970.tb56499.x

R. Marti, Arc crossing minimization in graphs with GRASP, IIE Transactions, vol.2, issue.10, pp.913-919, 2001.
DOI : 10.1007/BF02125456

C. Matuszewski, R. Schönfeld, and P. Molitor, Using Sifting for k-Layer Straightline Crossing Minimization, Proc. of the 7 th Int. Symposium on Graph Drawing, pp.217-224, 1999.
DOI : 10.1007/3-540-46648-7_22

P. Mutzel and M. Jünger, Graph drawing software, 2003.

S. North, Incremental layout in DynaDAG, Proc. of Graph Drawing'95, pp.409-418, 1996.
DOI : 10.1007/BFb0021824

A. Ochoa-rodrìguez and A. Rosete-suàrez, Automatic Graph Drawing by Genetic Search, Proc. of the 11 th Int. Conf. on CAD, CAM, Robotics and Manufactories of the Future, pp.982-987, 1995.

A. Papakostas, J. Six, and I. Tollis, Experimental and theoretical results in interactive orthogonal graph drawing, Proc. of Graph Drawing'96 of Lecture Notes in Computer Sciences, pp.371-386, 1997.
DOI : 10.1007/3-540-62495-3_61

H. Purchase, Effective information visualisation: a study of graph drawing aesthetics and algorithms, Interacting with Computers, vol.13, issue.2, 2000.
DOI : 10.1016/S0953-5438(00)00032-1

L. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis et al., A browser for directed graphs, Software -Practice and Experience, pp.61-76, 1987.
DOI : 10.1002/spe.4380170107

K. Sugiyama, S. Tagawa, and M. Toda, Methods for Visual Understanding of Hierarchical System Structures, IEEE Transactions on Systems, Man, and Cybernetics, vol.11, issue.2, pp.109-125, 1981.
DOI : 10.1109/TSMC.1981.4308636

A. G. Tettamanzi, Drawing Graphs with Evolutionary Algorithms, Proc. of Conf. on Adaptive Computing in Design and Manufacture, ACDM, pp.325-338, 1998.
DOI : 10.1007/978-1-4471-1589-2_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5073

J. Utech, J. Branke, H. Schmeck, and P. Eades, An evolutionary algorithm for drawing directed graphs, Proc. of the Int. Conf. on Imaging Science, Systems and Technology, pp.154-160, 1998.

J. Warfield, Crossing Theory and Hierarchy Mapping, IEEE Transactions on Systems, Man, and Cybernetics, vol.7, issue.7, pp.505-523, 1977.
DOI : 10.1109/TSMC.1977.4309760

D. Whitley and N. Yoo, Modeling simple genetic algorithms for permutation problems Fundations of Genetic Algorithms III, pp.163-184, 1995.