M. Predari and A. Esnard, A k-way greedy graph partitioning with initial 715 fixed vertices for parallel applications, 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pp.280-287, 2016.
DOI : 10.1109/pdp.2016.109

J. D. Teresco, K. D. Devine, and J. E. Flaherty, Partitioning and Dynamic Load Balancing for the Numerical Solution of Partial Differential Equations, p.720
DOI : 10.1007/3-540-31619-1_2

N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt, Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models, Journal of Parallel and Distributed Computing, vol.64, issue.8, pp.908-920, 2004.
DOI : 10.1016/j.jpdc.2004.03.017

B. Hendrickson, R. W. Leland, and R. V. Driessche, Enhancing data locality by using terminal propagation, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences, pp.565-574, 1996.
DOI : 10.1109/HICSS.1996.495507
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7373

B. Hendrickson, R. W. Leland, and R. V. Driessche, Skewed graph partitioning, Eighth SIAM Conference on Parallel Processing for Scientific Compu- 730 ting, 1997.

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.67-77, 2007.
DOI : 10.1016/j.jpdc.2006.05.005

U. V. Catalyurek, E. G. Boman, K. D. Devine, D. Bozda?-g, and R. T. , Hea- 735 phy, L. A. Riesen, A repartitioning hypergraph model for dynamic load balancing, J. Parallel Distrib. Comput, issue.8, pp.69-711, 2009.

S. Plimpton, S. Attaway, B. Hendrickson, J. Swegle, C. Vaughan et al., Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics, Journal of Parallel and Distributed Computing, vol.50, issue.1-2, pp.104-122, 1998.
DOI : 10.1006/jpdc.1998.1433
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.8159

K. Brown, S. Attaway, S. Plimpton, and B. Hendrickson, Parallel strategies for crash and impact simulations, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.2-4, 2000.
DOI : 10.1016/S0045-7825(99)00235-2

C. Walshaw, M. Cross, and K. Mcmanus, Multiphase mesh partitioning, Applied Mathematical Modelling, vol.25, issue.2, pp.123-140, 2000.
DOI : 10.1016/S0307-904X(00)00041-X
URL : http://doi.org/10.1016/s0307-904x(00)00041-x

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

G. Karypis and V. Kumar, Multilevel algorithms for multi-constraint graph 750 partitioning, Proceedings of the 1998 ACM/IEEE Conference on Supercomputing , SC '98, pp.1-13, 1998.
DOI : 10.1109/sc.1998.10018
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.6199

G. Karypis, Multi-Constraint Mesh Partitioning for Contact/Impact Computations, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, SC '03, p.56, 2003.
DOI : 10.1145/1048935.1050206
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.8230

P. Maria, Load balancing for parallel coupled simulations, 2016.

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

A. E. Dunlop and B. W. Kernighan, A Procedure for Placement of Standard-Cell VLSI Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.4, issue.1, pp.92-98, 1985.
DOI : 10.1109/TCAD.1985.1270101

]. 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.765-68, 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
DOI : 10.1137/0916028

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6013

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.780-175, 1982.
DOI : 10.1109/dac.1982.1585498
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.9485

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

U. V. Catalyurek and C. Aykanat, PaToH : A Multilevel Hypergraph Partitioning Tool, p.790, 1999.

B. Vastenhouw and R. H. Bisseling, A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication, SIAM Review, vol.47, issue.1, pp.67-95, 2005.
DOI : 10.1137/S0036144502409019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.5652

H. D. Simon and S. Teng, How Good is Recursive Bisection?, SIAM Journal on Scientific Computing, vol.18, issue.5, pp.1436-1445, 1995.
DOI : 10.1137/S1064827593255135
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4680

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3906

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, 805 in Proceedings of the DIMACS Workshop on Network Design : Connectivity and Facilities Location, pp.3-21, 1997.
DOI : 10.1090/dimacs/040/02
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3261

D. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes et al., Benchmarking for Graph Clustering and Partitioning, Encyclopedia of Social Network Analysis and Mining
DOI : 10.1007/978-1-4614-6170-8_23