J. D. Teresco, K. D. Devine, and J. E. Flaherty, Partitioning and Dynamic Load Balancing for the Numerical Solution of Partial Differential Equations, Numerical Solution of Partial Differential Equations on Parallel Computers, pp.55-88, 2006.
DOI : 10.1007/3-540-31619-1_2

A. E. Caldwell, A. B. Kahng, A. A. Kennings, and I. L. Markov, Hypergraph partitioning for VLSI CAD, Proceedings of the 36th ACM/IEEE conference on Design automation conference , DAC '99, pp.349-354, 1999.
DOI : 10.1145/309847.309955

E. Demir, C. Aykanat, and B. B. Cambazoglu, Clustering spatial networks for aggregate query processing: A hypergraph approach, Information Systems, vol.33, issue.1, pp.1-17, 2008.
DOI : 10.1016/j.is.2007.04.001

B. Hendrickson and K. Devine, Dynamic load balancing in computational mechanics, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.485-500, 2000.
DOI : 10.1016/S0045-7825(99)00241-8

C. Aykanat, B. B. Cambazoglu, F. Findik, and T. Kurc, Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.77-99, 2007.
DOI : 10.1016/j.jpdc.2006.05.005

U. V. Catalyurek, E. G. Boman, K. D. Devine, D. Bozda?-g, R. T. Heaphy et al., A repartitioning hypergraph model for dynamic load balancing, Journal of Parallel and Distributed Computing, vol.69, issue.8, pp.711-724, 2009.
DOI : 10.1016/j.jpdc.2009.04.011

C. Aykanat, B. B. Cambazoglu, and B. Uçar, Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices, Journal of Parallel and Distributed Computing, vol.68, issue.5, pp.609-625, 2008.
DOI : 10.1016/j.jpdc.2007.09.006
URL : https://hal.archives-ouvertes.fr/hal-00803479

B. Hendrickson and T. G. Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, issue.12, pp.1519-1534, 2000.
DOI : 10.1016/S0167-8191(00)00048-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.5005

M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, 1979.

B. Hendrickson and R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput, vol.16, issue.2, 1995.

R. Leland and B. Hendrickson, A multilevel algorithm for partitioning graphs, 1995 ACM/IEEE conference on Supercomputing, 1995.

G. Karypis and V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '96, pp.96-129, 1998.
DOI : 10.1145/369028.369103

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

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

P. Sanders and C. Schulz, Think Locally, Act Globally: Highly Balanced Graph Partitioning, Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), ser. LNCS, pp.164-175, 2013.
DOI : 10.1007/978-3-642-38527-8_16
URL : http://algo2.iti.kit.edu/documents/kahip/highly_balanced.pdf

V. Atalyrek and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool Zoltan: Parallel partitioning, load balancing and data-management services, 1999.

J. Ciarlet, P. , and F. Lamour, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Numerical Algorithms, vol.2, issue.1, pp.193-214, 1996.
DOI : 10.1007/BF02141748

R. Battiti and A. Bertossi, Differential greedy for the 0-1 equicut problem, Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location, pp.3-21, 1997.

S. Jain, C. Swamy, and K. Balaji, Greedy algorithms for k-way graph partitioning, the 6th international conference on advanced computing, 1998.

R. Diekmann, R. Preis, F. Schlimbach, and C. Walshaw, Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM, Parallel Computing, vol.26, issue.12, pp.1555-1581, 2000.
DOI : 10.1016/S0167-8191(00)00043-0

D. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes et al., Benchmarking for graph clustering and partitioning, " in Encyclopedia of Social Network Analysis and Mining, pp.73-82, 2014.

M. Predari and A. Esnard, Coupling-aware graph partitioning algorithms: Preliminary study, 2014 21st International Conference on High Performance Computing (HiPC), pp.1-10, 2014.
DOI : 10.1109/HiPC.2014.7116879
URL : https://hal.archives-ouvertes.fr/hal-01069578