J. Abello, S. G. Kobourov, and R. Yusufov, Visualizing Large Graphs with Compound-Fisheye Views and Treemaps, Proc. Graph Drawing, pp.431-441, 2004.
DOI : 10.1007/978-3-540-31843-9_44

J. Abello, F. Van-ham, and N. Krishnan, ASK-GraphView: A Large Scale Graph Visualization System, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.669-676, 2006.
DOI : 10.1109/TVCG.2006.120

A. T. Adai, S. V. Date, S. Wieland, and E. M. Marcotte, LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological Networks, Journal of Molecular Biology, vol.340, issue.1, pp.179-190, 2004.
DOI : 10.1016/j.jmb.2004.04.047

M. Amiel, G. Melançon, and C. Rozenblat, Réseaux multi-niveaux : l'exemple deséchanges deséchanges aériens mondiaux de passagers, Mappemonde, vol.79, 2005.

D. Archambault, T. Munzner, and D. Auber, Topolayout : Multi-level graph layout by topological features, IEEE Information Visualization 2005 Poster Compendium, pp.3-4, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00306601

D. Archambault, T. Munzner, and D. Auber, Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components, Proc. Vis, pp.813-820, 2006.
DOI : 10.1109/TVCG.2006.177
URL : https://hal.archives-ouvertes.fr/hal-00306602

D. Archambault, T. Munzner, and D. Auber, Grouse : Feature-Based and Steerable Graph Hierarchy Exploration, Eurographics/ IEEE-VGTC Symposium on Visualization, pp.67-74, 2007.

D. Archambault, T. Munzner, and D. Auber, TopoLayout: Multilevel Graph Layout by Topological Features, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.2, pp.305-317, 2007.
DOI : 10.1109/TVCG.2007.46
URL : https://hal.archives-ouvertes.fr/hal-00306601

D. Archambault, T. Munzner, and D. Auber, GrouseFlocks: Steerable Exploration of Graph Hierarchy Space, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.4
DOI : 10.1109/TVCG.2008.34
URL : https://hal.archives-ouvertes.fr/inria-00338627

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

D. Auber, Y. Chiricota, F. Jourdan, and G. Melançon, Multiscale visualization of small world networks, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.75-81, 2003.
DOI : 10.1109/INFVIS.2003.1249011
URL : https://hal.archives-ouvertes.fr/lirmm-00269770

D. Auber and F. Jourdan, Interactive Refinement of Multi-scale Network Clusterings, Ninth International Conference on Information Visualisation (IV'05), pp.703-709, 2005.
DOI : 10.1109/IV.2005.65
URL : https://hal.archives-ouvertes.fr/hal-00307633

S. Baase and A. V. Gelder, Computer algorithms : introduction to design and analysis, 2000.

G. , D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing : Algorithms for the Visualization of Graphs, 1999.
DOI : 10.1007/978-3-642-00219-9

M. Becker and I. Rojas, A graph layout algorithm for drawing metabolic pathways, Bioinformatics, vol.17, issue.5, pp.461-467, 2001.
DOI : 10.1093/bioinformatics/17.5.461

R. Bourqui, D. Auber, V. Lacroix, and F. Jourdan, Metabolic network visualization using constraint planar graph drawing algorithm, Tenth International Conference on Information Visualisation (IV'06), pp.489-496, 2006.
DOI : 10.1109/IV.2006.75
URL : https://hal.archives-ouvertes.fr/hal-00427907

R. Bourqui, D. Auber, and P. Mary, How to Draw Clustered Weighted Graphs using a Multilevel Force-directed Graph Drawing Algorithm, Proc. the 11th Int

R. Bourqui and F. Jourdan, Revealing Subnetwork Roles using Contextual Visualization: Comparison of Metabolic Networks, 2008 12th International Conference Information Visualisation, pp.638-643, 2008.
DOI : 10.1109/IV.2008.93
URL : https://hal.archives-ouvertes.fr/hal-00343889

R. Bourqui, V. Lacroix, L. Cottret, D. Auber, P. Mary et al., Metabolic network visualization eliminating node redundance and preserving metabolic pathways, BMC Systems Biology, vol.1, issue.1, pp.1752-0509, 2007.
DOI : 10.1186/1752-0509-1-29
URL : https://hal.archives-ouvertes.fr/hal-00434765

F. Brandenburg, M. Forster, A. Pick, M. Raitner, and F. Schreiber, BioPath ??? Exploration and Visualization of Biochemical Pathways, Graph Drawing Softwares, Mathematics and Visualization, pp.215-236
DOI : 10.1007/978-3-642-18638-7_10

U. Brandes, A faster algorithm for betweenness centrality*, The Journal of Mathematical Sociology, vol.113, issue.2, pp.163-177, 2001.
DOI : 10.1016/S0378-8733(97)00007-5

U. Brandes, T. Dwyer, and F. Schreiber, Visualizing Related Metabolic Pathways in Two and a Half Dimensions, Proc. Graph Drawing 2003 (GD'03), pp.11-122, 2003.
DOI : 10.1007/978-3-540-24595-7_10

C. Buchheim, M. Jünger, and S. Leipert, Improving Walker???s Algorithm to Run in Linear Time, Proc. Graph Drawing, pp.344-353, 2002.
DOI : 10.1007/3-540-36151-0_32

H. Byelas and A. Telea, Visualization of areas of interest in software architecture diagrams, Proceedings of the 2006 ACM symposium on Software visualization , SoftVis '06, pp.105-114, 2006.
DOI : 10.1145/1148493.1148509

L. Cai and D. G. , Tree Spanners, Proc. of the Twenty- Third Southeastern Conference on Combinatorics, Graph Theory and Computing, pp.65-76, 1992.
DOI : 10.1137/S0895480192237403

L. Cai and D. G. , Tree Spanners, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.359-387, 1995.
DOI : 10.1137/S0895480192237403

R. Caspi, H. Foerster, C. Fulcher, R. Hopkinson, J. Ingraham et al., MetaCyc: a multiorganism database of metabolic pathways and enzymes, Nucleic Acids Research, vol.34, issue.90001, pp.511-516, 2006.
DOI : 10.1093/nar/gkj128

B. Cheswick, H. Burch, and S. Branigan, Mapping and visualizing the internet, ATEC '00 : Proc. of the annual conference on USENIX Annual Technical Conference, pp.1-1, 2000.

Y. Chiricota, F. Jourdan, and G. Melançon, Software components capture using graph clustering, MHS2003. Proceedings of 2003 International Symposium on Micromechatronics and Human Science (IEEE Cat. No.03TH8717), 2003.
DOI : 10.1109/WPC.2003.1199205
URL : https://hal.archives-ouvertes.fr/lirmm-00269464

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2005.

M. De-berg, O. Cheong, M. Van-kreveld, and M. Overmars, Computational Geomtry : Algorithm and Application, 2008.

E. W. Dijkstra, A short introduction to the art of programming, Technische Hogeschool Eindhoven, 1971.

U. Dogrusoz, E. Giral, A. Cetintas, A. Civril, and E. Demir, A Compound Graph Layout Algorithm for Biological Pathways, Proc. Graph Drawing, pp.442-447, 2004.
DOI : 10.1007/978-3-540-31843-9_45

S. Santos and K. Brodlie, Gaining understanding of multivariate and multidimensional data through visualization, Computers & Graphics, vol.28, issue.3, pp.311-325, 2004.
DOI : 10.1016/j.cag.2004.03.013

J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan, Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation, Communications of the ACM, vol.31, issue.11, pp.311343-1354, 1988.
DOI : 10.1145/50087.50096

T. Dwyer and P. Eckersley, WilmaScope ??? A 3D Graph Visualization System, Graph Drawing Softwares, Mathematics and Visualization, pp.55-75, 2003.
DOI : 10.1007/978-3-642-18638-7_3

T. Dwyer, K. Marriott, and P. Stuckey, Fast Node Overlap Removal, Proc. Graph Drawing 2005 (GD'05), pp.153-164, 2005.
DOI : 10.1007/11618058_15

T. Dwyer, K. Marriott, and P. Stuckey, Fast Node Overlap Removal???Correction
DOI : 10.1007/978-3-540-70904-6_44

P. Eades, A heuristic for graph drawing, Congressus Numerantium, pp.149-160, 1984.

P. Eades and Q. Feng, Multilevel visualization of clustered graphs, Proc. Graph Drawing 1996 (GD'96), pp.101-112, 1996.
DOI : 10.1007/3-540-62495-3_41

P. Eades, Q. Feng, and X. Lin, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, Proc. Graph Drawing 1996 (GD'96), pp.113-128, 1996.

P. Eades, Q. Feng, and H. Nagamochi, Drawing Clustered Graphs on an Orthogonal Grid, Journal of Graph Algorithms and Applications, vol.3, issue.4, pp.3-29, 1999.
DOI : 10.7155/jgaa.00016

P. Eades and M. L. Huang, Navigating Clustered Graphs Using Force-Directed Methods, Journal of Graph Algorithms and Applications, vol.4, issue.3, pp.157-181, 2000.
DOI : 10.7155/jgaa.00029

M. Eiglsperger and M. Kaufmann, Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size, Proc. Graph Drawing 2001 (GD'01), pp.124-138, 2001.
DOI : 10.1007/3-540-45848-4_11

M. Eiglsperger, M. Siebenhaller, and M. Kaufmann, An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing, Proc. Graph Drawing, pp.155-166, 2004.

B. S. Everitt and G. Dunn, Applied Multivariate Data Analysis, 1991.
DOI : 10.1002/9781118887486

S. Fortune, A sweepline algorithm for Voronoi diagrams, SCG '86 : Proc. of the second annual symposium on Computational geometry, pp.313-322, 1986.

H. De-fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol.13, issue.1, pp.41-51, 1990.
DOI : 10.1007/BF02122694

M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

L. C. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry, vol.40, issue.1, pp.35-41, 1977.
DOI : 10.2307/3033543

A. Frick, A. Ludwig, and H. Mehldau, A Fast Adaptive Layout Algorithm for Undirected Graphs, Proc. Graph Drawing 1994 (GD'94), pp.388-403, 1994.

T. M. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Software-Practice and Experience, pp.1129-1164, 1991.
DOI : 10.1002/spe.4380211102

G. W. Furnas, The FISHEYE view : A new look at structured files, 1981.

S. D. Gabouje and E. Zimányi, Generic visualization of biochemical networks : A new compound graph layout algorithm, Poster Proc. of the 4th International Workshop on Efficient and Experimental Algorithms (WEA 05), 2005.

P. Gajer, M. T. Goodrich, and S. G. Kobourov, A multi-dimensional approach to force-directed layouts of large graphs, Computational Geometry, vol.29, issue.1, pp.3-18, 2004.
DOI : 10.1016/j.comgeo.2004.03.014

P. Gajer and S. G. Kobourov, GRIP : Graph dRawing with Intelligent Placement, Proc. Graph Drawing, pp.222-228, 2000.

E. R. Gansner, Y. Koren, and S. C. North, Topological Fisheye Views for Visualizing Large Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.11, issue.4, pp.457-468, 2005.
DOI : 10.1109/TVCG.2005.66

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

M. Granitzer, W. Kienreich, V. Sabol, K. Andrews, and W. Klieber, Evaluating a System for Interactive Exploration of Large, Hierarchically Structured Document Repositories, IEEE Symposium on Information Visualization, pp.127-134, 2004.
DOI : 10.1109/INFVIS.2004.19

S. Grivet, D. Auber, J. Domenger, and G. Melançon, BUBBLE TREE DRAWING ALGORITHM, International Conference on Computer Vision and Graphics, pp.633-641, 2004.
DOI : 10.1007/1-4020-4179-9_91
URL : https://hal.archives-ouvertes.fr/lirmm-00108872

C. Gutwenger and P. Mutzel, Planar Polyline Drawings with Good Angular Resolution, Proc. Graph Drawing, pp.167-182, 1998.
DOI : 10.1007/3-540-37623-2_13

S. Hachul and M. Jünger, Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm, Proc. Graph Drawing, pp.285-295, 2004.
DOI : 10.1007/978-3-540-31843-9_29

S. Hachul and M. Jünger, An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs, Proc. Graph Drawing 2005 (GD'05), pp.235-250, 2005.
DOI : 10.1007/11618058_22

D. Harel and Y. Koren, Drawing graphs with non-uniform vertices, Proceedings of the Working Conference on Advanced Visual Interfaces, AVI '02, pp.157-166, 2002.
DOI : 10.1145/1556262.1556288

D. Harel and Y. Koren, Graph drawing by high dimensional embedding, Proc. Graph Drawing, pp.207-219, 2002.

D. Harel and Y. Koren, Graph Drawing by High-Dimensional Embedding, Journal of Graph Algorithms and Applications, vol.8, issue.2, pp.195-214, 2004.
DOI : 10.7155/jgaa.00089

I. Herman, M. S. Marshall, and G. Melançon, 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

P. R. Hinton, Statistics Explained : A Guide for Social Science Students. Routledge, 1995.

D. Holten, Hierachical Edge Bundles : Visualization of Adjacency Relations in Hierarchical Data, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.805-812, 2006.

J. E. Hopcroft and R. E. Tarjan, Dividing a Graph into Triconnected Components, SIAM Journal on Computing, vol.2, issue.3, pp.135-158, 1973.
DOI : 10.1137/0202012

M. L. Huang and P. Eades, A Fully Animated Interactive System for Clustering and Navigating Huge Graphs, Proc. Graph Drawing 1998 (GD'98), pp.374-383, 1998.
DOI : 10.1007/3-540-37623-2_29

P. Jaccard, Distribution de la flore alpine dans la Bassin de Dranses et dans quelques régions voisines, Bulletin de la Société Vaudoise des Sciences Naturelles, vol.37, pp.241-272, 1901.

T. J. Jankun-kelly and K. Ma, MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.59-66, 2003.
DOI : 10.1109/INFVIS.2003.1249009

G. Joshi-tope, M. Gillespie, I. Vastrik, P. D. Eustachio, E. Schmidt et al., Reactome: a knowledgebase of biological pathways, Nucleic Acids Research, vol.33, issue.Database issue, pp.428-432, 2005.
DOI : 10.1093/nar/gki072

F. Jourdan and G. Melançon, A Tool for Metabolic and Regulatory Pathways Visual Analysis, Visualization and Data Analysis, VDA, pp.46-55, 2003.

T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, pp.7-15, 1989.

M. Kanehisa and S. Goto, KEGG: Kyoto Encyclopedia of Genes and Genomes, Nucleic Acids Research, vol.28, issue.1, pp.27-30, 2000.
DOI : 10.1093/nar/28.1.27

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.46, issue.1, pp.4-32, 1996.
DOI : 10.1007/BF02086606

D. R. Karger, D. Koller, and S. J. Phillips, Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths, SIAM Journal on Computing, vol.22, issue.6, pp.1199-1217, 1993.
DOI : 10.1137/0222071

P. Karp, S. Paley, and P. Romero, The Pathway Tools software, Bioinformatics, vol.18, issue.Suppl 1, pp.225-232, 2002.
DOI : 10.1093/bioinformatics/18.suppl_1.S225

P. Karp, M. Riley, M. Saier, and I. Paulsen, The EcoCyc and MetaCyc databases, Nucleic Acids Research, vol.28, issue.1, pp.56-59, 2000.
DOI : 10.1093/nar/28.1.56

P. D. Karp, C. A. Ouzounis, C. Moore-kochlacs, L. Goldovsky, P. Kaipa et al., Expansion of the BioCyc collection of pathway/genome databases to 160 genomes, Nucleic Acids Research, vol.33, issue.19, pp.6083-6089, 2005.
DOI : 10.1093/nar/gki892

M. Kaufmann and D. Wagner, Drawing Graphs : Methods and Models, 2001.

I. M. Keseler, J. Collado-vides, S. Gama-castro, J. Ingraham, S. Paley et al., EcoCyc: a comprehensive database resource for Escherichia coli, Nucleic Acids Research, vol.33, issue.Database issue, pp.334-337, 2005.
DOI : 10.1093/nar/gki108

P. Koenig, G. Melancon, C. Bohan, and B. Gautier, Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data, 2007 11th International Conference Information Visualization (IV '07)
DOI : 10.1109/IV.2007.36
URL : https://hal.archives-ouvertes.fr/lirmm-00153862

Y. Koren, L. Carmel, and D. Harel, ACE : A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs, Proc. IEEE Symposium on Information Visualization, pp.137-144, 2002.

M. Krummenacker, S. Paley, L. Mueller, T. Yan, and P. D. Karp, Querying and computing with BioCyc databases, Bioinformatics, vol.21, issue.16, pp.3454-3455, 2005.
DOI : 10.1093/bioinformatics/bti546

G. Kumar and M. Garland, Visual Exploration of Complex Time-Varying Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.805-812, 2006.
DOI : 10.1109/TVCG.2006.193

P. Kuntz, B. Pinaud, and R. Lehn, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm, Journal of Heuristics, vol.11, issue.2, pp.23-36, 2006.
DOI : 10.1007/s10732-006-4296-7
URL : https://hal.archives-ouvertes.fr/inria-00335904

V. Lacroix, L. Cottret, P. Th?ath?-th?a-c-bault, and M. Sagot, An Introduction to Metabolic Networks and Their Structural Analysis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.4
DOI : 10.1109/TCBB.2008.79
URL : https://hal.archives-ouvertes.fr/hal-00355497

V. Lacroix, C. G. Fernandes, and M. Sagot, Motif Search in Graphs: Application to Metabolic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.360-368, 2006.
DOI : 10.1109/TCBB.2006.55
URL : https://hal.archives-ouvertes.fr/hal-00427984

A. Liebers, Planarizing Graphs - A Survey and Annotated Bibliography, Journal of Graph Algorithms and Applications, vol.5, issue.1, pp.1-74, 2001.
DOI : 10.7155/jgaa.00032

P. C. Lui and R. C. Geldmacher, On the deletion of nonplanar edges of a graph, Proc. on the 10th conf. on Comb., Graph Theory, and Comp, pp.727-738, 1977.

S. Mancoridis, B. S. Mitchell, Y. Chen, and E. R. Gansner, Bunch: a clustering tool for the recovery and maintenance of software system structures, Proceedings IEEE International Conference on Software Maintenance, 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360), pp.50-59, 1999.
DOI : 10.1109/ICSM.1999.792498

S. Mancoridis, B. S. Mitchell, C. Rorres, Y. Chen, and E. R. Gansner, Using automatic clustering to produce high-level system organizations of source code, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242), pp.45-53, 1998.
DOI : 10.1109/WPC.1998.693283

C. C. Mcgeoch, All-pairs shortest paths and the essential subgraph, Algorithmica, vol.9, issue.3, pp.426-441, 1995.
DOI : 10.1007/BF01190847

F. Mcsherry, Spectral methods for the data analysis, 2004.

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, issue.1, p.16132, 2001.
DOI : 10.1103/PhysRevE.64.016132

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.69, issue.6, p.66133, 2004.
DOI : 10.1103/PhysRevE.69.066133

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, p.26113, 2004.
DOI : 10.1103/PhysRevE.69.026113

M. E. Newman, D. J. Watts, and S. H. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences, vol.99, issue.Supplement 1, pp.992566-2572, 2002.
DOI : 10.1073/pnas.012582999

T. Nishizeki and M. S. Rahman, Planar Graph Drawing. Lecture Notes Series on Computing, 2004.

S. Pailey and P. Karp, The Pathway Tools cellular overview diagram and Omics Viewer, Nucleic Acids Research, vol.34, issue.13, pp.3771-3778, 2006.
DOI : 10.1093/nar/gkl334

G. Parker, G. Franck, and C. Ware, Visualization of Large Nested Graphs in 3D: Navigation and Interaction, Journal of Visual Languages & Computing, vol.9, issue.3, pp.299-317, 1998.
DOI : 10.1006/jvlc.1998.0086

D. Reniers and A. Telea, Extreme simplification and rendering of point sets using algebraic multigrid. Computing and Visualization in Science, pagè a para??trepara??tre, 2008.

S. Rusinkiewicz and M. Levoy, QSplat, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.343-352, 2000.
DOI : 10.1145/344779.344940

P. Saraiya, C. North, and K. Duca, Visualizing biological pathways: requirements analysis, systems evaluation and research agenda, Information Visualization, vol.4, issue.3, pp.1-15, 2004.
DOI : 10.1057/palgrave.ivs.9500102

S. E. Schaeffer, Stochastic Local Clustering for Massive Graphs, Proc. of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-05), pp.354-360, 2005.
DOI : 10.1007/11430919_42

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

F. Schreiber, High Quality Visualization of Biochemical Pathways in BioPath, In Silico Biology, vol.2, issue.2, pp.59-73, 2002.

F. Schreiber, Comparison of metabolic pathways using constraint graph drawing, APBC 03 : Proc. of the First Asia-Pacific bioinformatics conference on Bioinformatics, pp.105-110, 2003.

P. Shannon, A. Markiel, O. Ozierand, N. Baliga, J. Wang et al., Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction Networks, Genome Research, vol.13, issue.11, pp.2498-2504, 2003.
DOI : 10.1101/gr.1239303

B. Shneiderman, The eyes have it : A task by data type taxonomy for information visualization, Boulder Proc. of IEEE Conference on visual languages, pp.336-343, 1996.

P. Simonetto and D. Auber, Visualise Undrawable Euler Diagrams, 2008 12th International Conference Information Visualisation, pp.594-599, 2008.
DOI : 10.1109/IV.2008.78
URL : https://hal.archives-ouvertes.fr/hal-00319119

M. Sirava, T. Schäfer, M. Eiglsperger, M. Kaufmann, O. Kohlbacher et al., BioMiner--modeling, analyzing, and visualizing biochemical pathways and networks, Bioinformatics, vol.18, issue.Suppl 2, pp.219-230, 2002.
DOI : 10.1093/bioinformatics/18.suppl_2.S219

J. M. Six and I. C. Tollis, A Framework for Circular Drawings of Networks, Proc. Graph Drawing 1999 (GD'99), pp.107-116, 1999.
DOI : 10.1007/3-540-46648-7_11

K. Sugiyamaa, 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

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

S. T. Teoh and K. Ma, RINGS: A Technique for Visualizing Large Hierarchies, Proc. Graph Drawing, pp.268-275, 2002.
DOI : 10.1007/3-540-36151-0_25

S. Van-dongen, Graph Clustering by Flow Simulation, 2000.

J. J. Van-wijk and A. A. Wim, Smooth and efficient zooming and panning, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.75-81, 2003.
DOI : 10.1109/INFVIS.2003.1249004

G. F. Voronoi, Nouveles applications des paramètres continusàcontinus`continusà la théorie de formas quadratiques, J Reine Angew Math, vol.134, pp.198-287, 1908.

X. Wang and I. Miyamoto, Generating customized layouts, Proc. Graph Drawing 1995 (GD'95), pp.504-515, 1996.
DOI : 10.1007/BFb0021835

C. Ware, Information Visualization : Perception for Design, 2000.

K. Wegner and U. Kummer, A new dynamical layout algorithm for complex biochemical reaction networks, BMC Bioinformatics, vol.6, issue.212, 2005.

D. J. Welsh and M. B. Powell, An upper bound to the chromaticnumber of a graph and its application to timetabling problems. The Computer journal, pp.85-86, 1967.

R. Wiese, M. Eiglsperger, and M. Kaufmann, yFiles : Visualization and automatic layout of graphs, Graph Drawing Softwares, Mathematics and Visualization, pp.173-192, 2003.

U. Zwick, Exact and Approximate Distances in Graphs ??? A Survey, Algorithms - ESA'01, 9th Ann European Symposium, pp.33-48, 2001.
DOI : 10.1007/3-540-44676-1_3