M. Wattenberg, Arc diagrams: visualizing structure in strings, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002., pp.110-116, 2002.
DOI : 10.1109/INFVIS.2002.1173155

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Petit, Experiments on the minimum linear arrangement problem, Journal of Experimental Algorithmics, vol.8, 2003.
DOI : 10.1145/996546.996554

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

Y. Koren and D. Harel, A Multi-scale Algorithm for the Linear Arrangement Problem, Proc. WG, ser, pp.296-309, 2002.
DOI : 10.1007/3-540-36379-3_26

I. Brog and P. J. Groenen, Modern Multidimensional Scaling: Theory and Applications, Journal of Educational Measurement, vol.40, issue.3, 1997.
DOI : 10.4135/9781412985130

T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, vol.31, issue.1, pp.7-15, 1989.
DOI : 10.1016/0020-0190(89)90102-6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

E. R. Gansner, Y. Koren, and S. North, Graph Drawing by Stress Majorization, Proc. Graph Drawing, ser. LNCS, pp.285-295, 2004.
DOI : 10.1007/978-3-540-31843-9_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

U. Brandes and C. Pich, An Experimental Study on Distance-Based Graph Drawing, Proc. Graph Drawing, ser, pp.218-229, 2009.
DOI : 10.1007/978-3-642-00219-9_21

C. Pich, Applications of multidimensional scaling to graph drawing, 2009.

Y. Koren and D. Harel, Axis-by-Axis Stress Minimization, Proc. Graph Drawing, ser. LNCS, pp.450-459, 2004.
DOI : 10.1007/978-3-540-24595-7_42

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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.
DOI : 10.1006/jvlc.1995.1010

K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara, A layout adjustment problem for disjoint rectangles preserving orthogonal order, Systems and Computers in Japan, vol.6, issue.2, pp.31-42, 2002.
DOI : 10.1002/scj.1104

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

T. Dwyer, K. Marriott, and P. J. Stuckey, Fast Node Overlap Removal, Proc. Graph Drawing, ser, pp.153-164, 2006.
DOI : 10.1007/11618058_15

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

X. Huang, W. Lai, A. S. Sajeev, and J. Gao, A new algorithm for removing node overlapping in graph visualization, Information Sciences, vol.177, issue.14, pp.2821-2844, 2007.
DOI : 10.1016/j.ins.2007.02.016

E. R. Gansner and Y. Hu, Efficient Node Overlap Removal Using a Proximity Stress Model, Proc. Graph Drawing, ser, pp.206-217, 2008.
DOI : 10.1007/978-3-642-00219-9_20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Abe, H. Oh, and K. Inoue, Algorithms for Removing Node Overlaps with Some Basis Nodes, Proc. SNPD, ser. Studies in Computational Intelligence, pp.93-102, 2015.
DOI : 10.1007/978-3-319-23509-7_7

S. Fadloun, P. Poncelet, J. Rabatel, M. Roche, and A. Sallaberry, Node overlap removal for 1d graph layout: Proof of theorem 1, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01521385

D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.

J. , D. Leeuw, and P. Mair, Multidimensional scaling using majorization: Smacof in r, Department of Statistics, 2011.
DOI : 10.18637/jss.v031.i03

URL : http://doi.org/10.18637/jss.v031.i03

S. Rufiange and M. J. Mcguffin, DiffAni: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation, IEEE Transactions on Visualization and Computer Graphics, vol.19, issue.12, pp.2556-2565, 2013.
DOI : 10.1109/TVCG.2013.149

R. L. Harris, Information Graphics: A Comprehensive Inllustrated Reference, 1999.

M. Bostock, V. Ogievetsky, and J. Heer, D 3 data-driven documents, IEEE TVCG, vol.17, issue.12, pp.2301-2309, 2011.
DOI : 10.1109/tvcg.2011.185

P. Saraiya, P. Lee, and C. North, Visualization of graphs with associated timeseries data, Proc. InfoVis), pp.225-232, 2005.

W. Li, P. Eades, and N. S. Nikolov, Using spring algorithms to remove node overlapping, Proc. APVIS, pp.131-140, 2005.

T. Dwyer, K. Marriott, and P. J. Stuckey, Fast Node Overlap Removal???Correction, Proc. Graph Drawing, ser, pp.446-447, 2007.
DOI : 10.1007/978-3-540-70904-6_44