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
Partitioning and Dynamic Load Balancing for the Numerical Solution of Partial Differential Equations, p.720 ,
DOI : 10.1007/3-540-31619-1_2
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
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
Skewed graph partitioning, Eighth SIAM Conference on Parallel Processing for Scientific Compu- 730 ting, 1997. ,
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
Hea- 735 phy, L. A. Riesen, A repartitioning hypergraph model for dynamic load balancing, J. Parallel Distrib. Comput, issue.8, pp.69-711, 2009. ,
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
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
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
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
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
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
Load balancing for parallel coupled simulations, 2016. ,
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 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
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
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
Computers and Intractibility : A Guide to the Theory of NP-Completeness, 1979. ,
An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput, vol.16, issue.2 ,
DOI : 10.1137/0916028
A multilevel algorithm for partitioning graphs, 1995 ACM/IEEE conference on Supercomputing, 1995. ,
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
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
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
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
PaToH : A Multilevel Hypergraph Partitioning Tool, p.790, 1999. ,
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
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
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
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
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
Benchmarking for Graph Clustering and Partitioning, Encyclopedia of Social Network Analysis and Mining ,
DOI : 10.1007/978-1-4614-6170-8_23