C. Chevalier, Conception et mise en oeuvre d'outils efficaces pour le partitionnement et la distributionparalì eles deprobì eme numériques de très grande taille, 2007.

C. Chevalier and I. Safro, Comparison of Coarsening Schemes for Multilevel Graph Partitioning, Learning and Intelligent Optimization, pp.191-205, 2009.
DOI : 10.1007/978-3-642-11169-3_14

N. Chrisochoides and D. Nave, Parallel Delaunay mesh generation kernel, International Journal for Numerical Methods in Engineering, vol.177, issue.2, pp.161-176, 2003.
DOI : 10.1002/nme.765

T. Coupez, H. Digonnet, and R. Ducloux, Parallel meshing and remeshing, Applied Mathematical Modelling, vol.25, issue.2, pp.153-175, 2000.
DOI : 10.1016/S0307-904X(00)00045-7

URL : https://hal.archives-ouvertes.fr/hal-00536635

K. Devine, B. Hendrickson, E. Boman, M. St-john, C. Vaughan et al., Zoltan: A dynamic load-balancing library for parallel applications; user´suser´s guide, Sandia National Laboratories Tech. Rep, 1999.

J. J. Dongarra, J. Du-croz, S. Hammarling, and R. J. Hanson, An extended set of FORTRAN basic linear algebra subprograms, ACM Transactions on Mathematical Software, vol.14, issue.1, pp.1-17, 1988.
DOI : 10.1145/42288.42291

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th Design Automation Conference, pp.175-181, 1982.

M. Isenburg, Y. Liu, J. Shewchuk, and J. Snoeyink, Streaming computation of Delaunay triangulations, ACM Transactions on Graphics, vol.25, issue.3, pp.1049-1056, 2006.
DOI : 10.1145/1141911.1141992

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

L. Ing-lutz, Parallel mesh generation In Solving Irregularly Structured Problems in Parallel, pp.1-12, 1997.

O. Lawlor, S. Chakravorty, T. Wilmarth, N. Choudhury, I. Dooley et al., ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applications, Engineering with Computers, vol.15, issue.3-4, pp.215-235, 2006.
DOI : 10.1007/s00366-006-0039-5

R. Löhner, Some useful renumbering strategies for unstructured grids, International Journal for Numerical Methods in Engineering, vol.1, issue.19, pp.3259-3270, 1993.
DOI : 10.1002/nme.1620361904

R. Löhner, Renumbering strategies for unstructured-grid solvers operating on shared-memory, cache-based parallel machines Computer methods in applied mechanics and engineering, pp.95-109, 1998.

A. Loseille and F. Alauzet, Shrimp User Guide. A Fast Mesh Renumbering and Domain Partionning Method
URL : https://hal.archives-ouvertes.fr/inria-00362994

B. Maerten, D. Roose, A. Basermann, J. Fingberg, and G. Lonsdale, DRAMA: A Library for Parallel Dynamic Load Balancing of Finite Element Applications???, Euro-Par'99 Parallel Processing, pp.313-316, 1999.
DOI : 10.1007/3-540-48311-X_40

L. Oliker, R. Biswas, N. Harold, and . Gabow, Parallel tetrahedral mesh adaptation with dynamic load balancing, Parallel Computing, vol.26, issue.12, pp.1583-1608, 2000.
DOI : 10.1016/S0167-8191(00)00047-8