C. J. Alpert and A. B. Kahng, Recent directions in netlist partitioning: a survey, Integration, the VLSI Journal, vol.19, issue.1-2, pp.1-81, 1995.
DOI : 10.1016/0167-9260(95)00008-4

C. Aykanat, 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, 2008.
DOI : 10.1016/j.jpdc.2007.09.006

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

D. A. Bader, . Meyerhenke, . Henning, . Sanders, . Peter et al., Graph Partitioning and Graph Clustering -10th DI- MACS Implementation Challenge Workshop, Georgia Institute of Technology, Proceedings, volume 588 of Contemporary Mathematics, p.588, 2012.

R. Barat, C. Cédric, and P. , Multiconstraints graph partitioning for load balancing of multi-physics simulations, Conférence d'informatique en Parallélisme, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01417532

S. T. Barnard and H. D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, vol.38, issue.2, pp.101-117, 1994.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

. Ben-kiki, . Oren, C. Evans, D. Net, and . Ingy, Yaml ain't markup language (yaml TM ) version 1.2. URL http, 2009.

M. J. Berger and S. H. Bokhari, A Partitioning Strategy for Nonuniform Problems on Multiprocessors, IEEE Transactions on Computers, vol.36, issue.5, pp.36570-580, 1987.
DOI : 10.1109/TC.1987.1676942

W. A. Beyer and A. Zardecki, The Early History of the Ham Sandwich Theorem, The American Mathematical Monthly, vol.111, issue.1, pp.58-614145019, 2004.
DOI : 10.2307/4145019

R. H. Bisseling, . Meesen, and . Wouter, Communication balancing in parallel sparse matrix-vector multiplication, ETNA. Electronic Transactions on Numerical Analysis [electronic only], vol.21, pp.47-65, 2005.

S. Blackburn, . Diwan, . Amer, . Hauswirth, . Matthias et al., Can you trust your experimental results?

E. Boman, . Devine, . Karen, L. Fisk, . Ann et al., Zoltan 3.0: Parallel Partitioning , Load-balancing, and Data Management Services; User's Guide. Sandia National Laboratories, 2007.

T. N. Bui and C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, Society for Industrial and Applied Mathematics (SIAM), 1993.

A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz, Recent advances in graph partitioning, Algorithm Engineering: Selected Results and Surveys, 2015.

X. Cai and N. Bouhmala, A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes, Applied Mathematical Modelling, vol.31, issue.9, pp.1711-1728, 2007.
DOI : 10.1016/j.apm.2006.06.007

U. Catalyurek and C. Aykanat, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.7, pp.673-693, 1999.
DOI : 10.1109/71.780863

URL : http://www.cs.bilkent.edu.tr/~aykanat/papers/99ieeetpds.ps

U. V. Catalyurek and C. Aykanat, Patoh: Partitioning tool for hypergraphs. User's manual. URL https, 2011.

U. V. Catalyurek, E. G. Boman, K. D. Devine, D. Bozdag, R. Heaphy et al., Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-11, 2007.
DOI : 10.1109/IPDPS.2007.370258

URL : http://www.sandia.gov/~egboman/papers/Catalyurek_IPDPS07.pdf

U. Catalyurek and C. Aykanat, Decomposing irregularly sparse matrices for parallel matrix-vector multiplication, Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, pp.75-86, 1996.

C. Chekuri and S. Khanna, On multi-dimensional packing problems, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '99, pp.185-194, 1999.

C. Chevalier, G. Grospellier, F. Ledoux, and J. C. Weill, Load balancing for mesh based multi-physics simulations in the arcane framework, Proceedings of 8th International Conference on Engineering Computational Technology, pp.47-62, 2012.

C. Chevalier, . Safro, and . Ilya, Comparison of Coarsening Schemes for Multilevel Graph Partitioning, pp.191-205978, 2009.
DOI : 10.1007/978-3-642-11169-3_14

M. Deveci, K. Kaya, B. Uçar, and Ü. V. Çatalyürek, Fast and High Quality Topology-Aware Task Mapping, 2015 IEEE International Parallel and Distributed Processing Symposium, pp.197-206, 2015.
DOI : 10.1109/IPDPS.2015.93

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

. Deveci, . Mehmet, . Kaya, . Kamer, . Uçar et al., Hypergraph partitioning for multiple communication cost metrics: Model and methods, Journal of Parallel and Distributed Computing, vol.77, pp.69-83, 2015.
DOI : 10.1016/j.jpdc.2014.12.002

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

K. Devine, E. Boman, R. Heaphy, B. Hendrickson, and C. Vaughan, Zoltan data management services for parallel dynamic applications, Computing in Science & Engineering, vol.4, issue.2, pp.90-96, 2002.
DOI : 10.1109/5992.988653

K. D. Devine, E. G. Boman, R. T. Heaphy, R. H. Bisseling, and U. V. Catalyurek, Parallel hypergraph partitioning for scientific computing, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, pp.10-10, 2006.
DOI : 10.1109/IPDPS.2006.1639359

URL : http://gaston.sandia.gov/cfupload/ccim_pubs_prod/IPDPS06_final.pdf

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002.
DOI : 10.1007/s101070100263

W. E. Donath and A. J. Hoffman, Lower Bounds for the Partitioning of Graphs, IBM Journal of Research and Development, vol.17, issue.5, pp.420-425, 1973.
DOI : 10.1147/rd.175.0420

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th Design Automation Conference, DAC '82, pp.175-181, 1982.
DOI : 10.1145/800263.809204

M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory, Czechoslovak Mathematical Journal, vol.25, issue.4, pp.619-633, 1975.

. Forouzan and A. Behrouz, Data Communications and Networking, 2007.

O. Fortmeier, H. M. Bücker, B. O. Fagginger-auer, and R. H. Bisseling, A new metric enabling an exact hypergraph model for the communication volume in distributed-memory parallel applications, Parallel Computing, vol.39, issue.8, pp.319-335, 2013.
DOI : 10.1016/j.parco.2013.05.003

P. J. Frey and P. L. George, Maillages: applications aux éléments finis, URL, 1999.

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

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.47-63, 1974.
DOI : 10.1145/800119.803884

I. P. Gent and T. Walsh, Analysis of Heuristics for Number Partitioning, Computational Intelligence, vol.14, issue.3, pp.430-451, 1998.
DOI : 10.1111/0824-7935.00069

A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite, 1981.

T. Goehring and Y. Saad, Heuristic algorithms for automatic graph partitioning, 1995.

W. W. Hager and Y. Krylyuk, Graph Partitioning and Continuous Quadratic Programming, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.500-523, 1999.
DOI : 10.1137/S0895480199335829

URL : http://www.math.ufl.edu/~hager/papers/GP/SJD000500.pdf

B. Hendrickson, Graph partitioning and parallel solvers: Has the emperor no clothes?, Proc. Irregular'98, pp.218-225, 1998.
DOI : 10.1007/BFb0018541

B. Hendrickson and T. G. Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, issue.12, pp.1519-153410, 2000.
DOI : 10.1016/S0167-8191(00)00048-X

B. Hendrickson, L. , and R. , A multi-level algorithm for partitioning graphs, 1995.

M. Holtgrewe, . Sanders, . Peter, and C. Schulz, Engineering a scalable high quality graph partitioner. CoRR, abs/0910, p.910, 2004.
DOI : 10.1109/ipdps.2010.5470485

E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer software engineering series, URL, 1978.

E. Horowitz and S. Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM, vol.21, issue.2, pp.277-292, 1974.
DOI : 10.1145/321812.321823

L. Hyafil and R. L. Rivest, Graph partitioning and constructing optimal decision trees are polynomial complete problems, 1973.
DOI : 10.1016/0020-0190(76)90095-8

L. Hyafil and R. L. Rivest, Constructing optimal binary decision trees is NP-complete, Information Processing Letters, vol.5, issue.1, pp.15-17, 1976.
DOI : 10.1016/0020-0190(76)90095-8

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

M. H. Kalos and P. A. Whitlock, What is Monte Carlo?, pp.1-5, 2009.

N. Karmarkar and R. M. Karp, The differencing method of set partitioning, 1983.

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

G. Karypis, METIS -A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, 2013.

G. Bibliography-karypis, R. Aggarwal, V. Kumar, and S. Shekhar, Multilevel Hypergraph Partitioning: Application in VLSI Domain, Proceedings of the 34th Annual Design Automation Conference, DAC '97, pp.526-529, 1997.

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, pp.1-13, 1998.
DOI : 10.1109/SC.1998.10018

G. Karypis and V. Kumar, A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering, Journal of Parallel and Distributed Computing, vol.48, issue.1, pp.71-951403, 1997.
DOI : 10.1006/jpdc.1997.1403

G. Karypis, . Kumar, and . Vipin, Analysis of multilevel graph partitioning Supercomputing '95, Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, 1995.

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

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems, 2004.
DOI : 10.1007/978-3-540-24777-7

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

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

URL : http://www.cs.virginia.edu/cs432/documents/sa-1983.pdf

J. Koji?, Integer linear programming model for multidimensional two-way number partitioning problem, Computers & Mathematics with Applications, vol.60, issue.8, pp.2302-2308, 2010.
DOI : 10.1016/j.camwa.2010.08.024

R. E. Korf, From approximate to optimal solutions: A case study of number partitioning, Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp.95-266, 1995.

R. E. Korf, A complete anytime algorithm for number partitioning, Artificial Intelligence, vol.106, issue.2, pp.181-203, 1998.
DOI : 10.1016/S0004-3702(98)00086-1

URL : https://doi.org/10.1016/s0004-3702(98)00086-1

R. E. Korf, Multi-way number partitioning, Proceedings of the 21st International Jont Conference on Artifical Intelligence, IJCAI'09, pp.538-543, 2009.

R. E. Korf and E. L. Schreiber, Optimally scheduling small numbers of identical parallel machines, ICAPS. AAAI, 2013.

J. Kratica, . Koji?, . Jelena, and A. Savi?, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, Computers & Operations Research, vol.46, pp.59-68, 2014.
DOI : 10.1016/j.cor.2014.01.003

D. Lasalle and G. Karypis, A Parallel Hill-Climbing Refinement Algorithm for Graph Partitioning, 2016 45th International Conference on Parallel Processing (ICPP), pp.236-241, 2016.
DOI : 10.1109/ICPP.2016.34

W. Leinberger, G. Karypis, and V. Kumar, Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints, Proceedings of the 1999 International Conference on Parallel Processing, pp.404-412, 1999.
DOI : 10.1109/ICPP.1999.797428

K. Malan, A. Engelbrecht, and . Petrus, A survey of techniques for characterising fitness landscapes and some possible ways forward, Information Sciences, vol.241, pp.148-163, 2013.
DOI : 10.1016/j.ins.2013.04.015

S. Mertens, The easiest hard problem: Number partitioning, inst. f. Theor. Physik, 2003.

. Michiels, . Wil, J. H. Korst, E. H. Aarts, and . Van-leeuwen, Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem, STACS, volume 2607 of Lecture Notes in Computer Science, pp.583-595, 2003.
DOI : 10.1007/3-540-36494-3_51

S. Morais, Study and obtention of exact, and approximation, algorithms and heuristics for a mesh partitioning problem under memory constraints. Theses, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01447665

M. Ouyang, . Toulouse, . Michel, . Thulasiraman, . Krishnaiyan et al., Multilevel cooperative search, Proceedings of the 2000 international symposium on Physical design , ISPD '00, pp.192-198, 2000.
DOI : 10.1145/332357.332399

F. Pellegrini, Scotch and libScotch 5.1 User's Guide. User's manual. URL https, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00410332

F. Pellegrini, A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth Boundaries, Lecture Notes in Computer Science, vol.4641, pp.195-204, 2007.
DOI : 10.1007/978-3-540-74466-5_22

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

F. Pellegrini and J. Roman, Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, pp.493-498, 1996.
DOI : 10.1007/3-540-61142-8_588

F. Pellegrini and J. Roman, Experimental analysis of the dual recursive bipartitioning algorithm for static mapping, 1996.

D. M. Pelt and R. H. Bisseling, A Medium-Grain Method for Fast 2D Bipartitioning of Sparse Matrices, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.529-539, 2014.
DOI : 10.1109/IPDPS.2014.62

J. R. Pilkington, J. R. Pilkington, S. B. Baden, and S. B. Baden, Partitioning with spacefilling curves, 1994.

P. C. Pop and O. Matei, A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem, pp.81-86, 2013.
DOI : 10.1007/978-3-642-44973-4_10

H. Richter and A. Engelbrecht, Recent Advances in the Theory and Application of Fitness Landscapes, 2013.
DOI : 10.1007/978-3-642-41888-4

F. J. Rodríguez, F. Glover, . García-martínez, . Carlos, R. Martí et al., GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Computers & Operations Research, vol.78, pp.243-254, 2017.
DOI : 10.1016/j.cor.2016.09.005

W. Ruml, J. T. Ngo, J. Marks, and S. M. Shieber, Easily searched encodings for number partitioning, Journal of Optimization Theory and Applications, vol.23, issue.2, pp.251-291, 1996.
DOI : 10.1007/BF02192530

L. A. Sanchis, Multiple-way network partitioning, IEEE Transactions on Computers, vol.38, issue.1, pp.62-81, 1989.
DOI : 10.1109/12.8730

P. Sanders and C. Schulz, Engineering Multilevel Graph Partitioning Algorithms, 2010.
DOI : 10.1137/S1064827598337373

URL : http://algo2.iti.kit.edu/documents/kahip/engineering_multilevel.pdf

S. Schlag, . Henne, . Vitali, . Heuer, . Tobias et al., -Level Recursive Bisection, 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2015.
DOI : 10.1137/1.9781611974317.5

E. L. Schreiber, Optimal Multi-Way Number Partitioning, pp.30-36, 2014.

R. Schroeppel and A. Shamir, A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems, SIAM Journal on Computing, vol.10, issue.3, pp.456-464, 1981.
DOI : 10.1137/0210033

N. Selvakkumaran and G. Karypis, Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.25, issue.3, pp.504-517854637, 2005.
DOI : 10.1109/TCAD.2005.854637

J. Shi and J. Malik, Motion segmentation and tracking using normalized cuts, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271), pp.1154-1160, 1998.

H. D. Simon, . Teng, and . Shang-hua, How Good is Recursive Bisection?, SIAM Journal on Scientific Computing, vol.18, issue.5, pp.1436-1445, 1997.
DOI : 10.1137/S1064827593255135

URL : http://www-sal.cs.uiuc.edu/~steng/horst.ps

B. Slininger, Fiedler's theory of spectral graph partitioning, 2013.

A. J. Soper, C. Walshaw, M. R. Cross, and D. Roose, A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning, Proceedings of SHPCC'94, pp.225-241, 1994.
DOI : 10.1023/B:JOGO.0000042115.44455.f3

URL : http://www.gre.ac.uk/~wc06/papers/ps/SoperGECC00.ps.gz

U. Von-luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, 2007.
DOI : 10.1017/CBO9780511810633

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 : https://doi.org/10.1016/s0307-904x(00)00041-x

C. Walshaw, Multilevel Refinement for Combinatorial Optimisation Problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.
DOI : 10.1023/B:ANOR.0000039525.80601.15

Y. C. Wei and C. K. Cheng, Ratio cut partitioning for hierarchical designs, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.10, issue.7, pp.911-921, 2006.
DOI : 10.1109/43.87601

Y. Wei and C. Cheng, Towards efficient hierarchical designs by ratio cut partitioning, IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, pp.298-301, 1989.

R. D. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience, pp.457-481, 1991.

B. Yakir, The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp, Mathematics of Operations Research, vol.21, issue.1, pp.85-99, 1996.
DOI : 10.1287/moor.21.1.85