O. Andrei, A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems, Thèse de doctorat, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00337558

O. Andrei and H. Kirchner, A Port Graph Calculus for Autonomic Computing and Invariant Verification, Proc. of the 5 th Int, 2009.
DOI : 10.1016/j.entcs.2009.10.015
URL : https://hal.archives-ouvertes.fr/inria-00418560

D. Auber, Tulip ??? A Huge Graph Visualization Framework, Graph Drawing Software, Mathematics and Visualization Series, pp.105-126, 2003.
DOI : 10.1007/978-3-642-18638-7_5

D. Auber, S. Grivet, J. Domenger, and E. G. Melançon, Bubble tree drawing algorithm, Int. Conf. on Computer Vision and Graphics, pp.633-641, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108872

C. Buchheim, M. Jünger, and E. S. Leipert, Improving Walker???s Algorithm to Run in Linear Time, Graph Drawing, 10 th Int. Symp., GD 2002, pp.347-364, 2002.
DOI : 10.1007/3-540-36151-0_32

L. P. Cordella, P. Foggia, C. Sansone, and E. M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.10, pp.1367-1372, 2004.
DOI : 10.1109/TPAMI.2004.75

K. G. Freivalds, J. Goos, and . Hartmanis, Curved Edge Routing, 13 th Int. Symp. on Fundamentals of Computation Theory, pp.126-137, 2001.
DOI : 10.1007/3-540-44669-9_14

Y. Frishman, A. Et, and . Tal, Online Dynamic Graph Drawing, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.4, pp.727-740, 2008.
DOI : 10.1109/TVCG.2008.11

E. R. Gansner, E. Koutsofios, S. C. North, and K. Vo, A technique for drawing directed graphs, IEEE Transactions on Software Engineering, vol.19, issue.3, pp.214-230, 1993.
DOI : 10.1109/32.221135

I. Herman, G. Melançon, and E. M. Delest, Tree Visualisation and Navigation Clues for Information Visualisation, Computer Graphics Forum, vol.17, issue.2, pp.153-165, 1998.
DOI : 10.1111/1467-8659.00235

C. Kirchner, F. Kirchner, and E. H. Kirchner, Strategic computations and deductions Reasoning in Simple Type Theory, Logic and the Foundations of Mathematics, pp.339-364, 2008.

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

B. Lee, C. S. Parr, C. Plaisant, B. B. Bederson, V. D. Veklser et al., Visualizing Networks with Enhanced Tree Layouts: Can Interaction Tame Complexity?, IEEE Trans. on Visualization and Computer Graphics, Special Issue on Visual Analytics, vol.12, issue.6, pp.1414-1426, 2006.

E. Loubier, B. Et, and . Dousset, Visualisation and analysis of relational data by considering temporal dimension, ICEIS 2007 9 th Int. Conf. on Enterprise Information Systems, pp.550-553, 2007.

K. Misue, P. Eades, W. Lai, and E. 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

P. Saffrey and H. Purchase, The " mental map " versus " static aesthetic " compromise in dynamic graphs: a user study, Proc. of the 9 th Conf. on Australasian user interface, pp.85-94, 2008.

E. R. Tufte, Envisioning Information, 1990.

J. R. Ullmann, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.7741