D. W. Archambault and H. C. Purchase, The "map" in the mental map: Experimental results in dynamic graph drawing, International Journal of Human-Computer Studies, vol.71, issue.11, pp.1044-1055, 2013.

A. Baraba?i and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

F. Chen, L. Piccinini, P. Poncelet, and A. Sallaberry, Node overlap removal algorithms: A comparative study, Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD), pp.179-192
URL : https://hal.archives-ouvertes.fr/hal-02302617

. Springer, , 2019.

M. Chimani, C. Gutwenger, M. Jünger, G. W. Klau, K. Klein et al., The open graph drawing framework (OGDF), Handbook on Graph Drawing and Visualization, pp.543-569, 2013.

T. Dwyer, K. Marriott, and P. J. Stuckey, Fast node overlap removal, Proceedings of the International Symposium on Graph Drawing (GD), pp.153-164, 2005.

P. Erdös and A. Rényi, On random graphs, Publicationes Mathematicae Debrecen, vol.6, pp.290-291, 1959.

S. Fadloun, P. Poncelet, J. Rabatel, M. Roche, and A. Sallaberry, Node overlap removal for 1d graph layout, Proceeding of the International Conference on Information Visualisation (IV), pp.224-229, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01542283

E. R. Gansner and Y. Hu, Efficient, proximity-preserving node overlap removal, Journal of Graph Algorithms and Applications, vol.14, issue.1, pp.53-74, 2010.

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering. Software: practice and experience, vol.30, pp.1203-1233, 2000.

D. Guo and M. Gahegan, Spatial ordering and encoding for geographic data mining and visualization, Journal of Intelligent Information Systems, vol.27, issue.3, pp.243-266, 2006.

S. Hachul and M. Jünger, Drawing large graphs with a potential-fieldbased multilevel algorithm, Proceedings of the International Symposium on Graph Drawing (GD), pp.285-295, 2004.

J. Haunert and L. Sering, Drawing road networks with focus regions, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.12, pp.2555-2562, 2011.

K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara, A layout adjustment problem for disjoint rectangles preserving orthogonal order, Proceedings of the International Symposium on Graph Drawing (GD), pp.183-197

. Springer, , 1998.

Y. Hu, Efficient, high-quality force-directed graph drawing, Mathematica Journal, vol.10, issue.1, pp.37-71, 2005.

X. Huang and W. Lai, Force-transfer: a new approach to removing overlapping nodes in graph layout, Proceedings of the Australasian Computer Science Conference (ACSC), pp.349-358, 2003.

X. Huang, W. Lai, A. Sajeev, and J. Gao, A new algorithm for removing node overlapping in graph visualization, Information Sciences, vol.177, issue.14, pp.2821-2844, 2007.

W. Li, P. Eades, and N. Nikolov, Using spring algorithms to remove node overlapping, Proceedings of the Asia-Pacific Symposium on Information Visualisation (APVis'05), pp.131-140, 2005.

K. A. Lyons, H. Meijer, and D. Rappaport, Algorithms for cluster busting in anchored graph drawing, Journal of Graph Algorithms and Applications, vol.2, issue.1, pp.1-24, 1998.

K. Marriott, P. Stuckey, V. Tam, and W. He, Removing node overlapping in graph layout using constrained optimization, Constraints, vol.8, issue.2, pp.143-171, 2003.

W. Meulemans, Efficient optimal overlap removal: Algorithms and experiments, Computer Graphics Forum, vol.38, issue.3, pp.713-723, 2019.

K. Misue, P. Eades, W. Lai, and K. Sugiyama, Layout adjustment and the mental map, Journal of Visual Languages & Computing, vol.6, issue.2, pp.183-210, 1995.

L. Nachmanson, A. Nocaj, S. Bereg, L. Zhang, and A. Holroyd, Node overlap removal by growing a tree, Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD), pp.33-43, 2016.

S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S. G. Kobourov et al., Computing stable demers cartograms, Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD), pp.46-60, 2019.

H. C. Purchase, Metrics for graph drawing aesthetics, Journal of Visual Languages & Computing, vol.13, issue.5, pp.501-516, 2002.

M. Sondag, B. Speckmann, and K. Verbeek, Stable treemaps via local moves, IEEE Transactions on Visualization and Computer Graphics, vol.24, issue.1, pp.729-738, 2018.

H. Strobelt, M. Spicker, A. Stoffel, D. A. Keim, and O. Deussen, Rolledout wordles: A heuristic method for overlap removal of 2D data representatives, Computer Graphics Forum, vol.31, issue.3, pp.1135-1144, 2012.

M. Van-garderen, B. Pampel, A. Nocaj, and U. Brandes, Minimumdisplacement overlap removal for geo-referenced data visualization, Computer Graphics Forum, vol.36, issue.3, pp.423-433, 2017.

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, pp.440-442, 1998.