D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Graph Partitioning and Graph Clustering -10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, vol.588, 2012.

S. L. Bezrukov and B. Rovan, On partitioning grids into equal parts, Computers and Artificial Intelligence, vol.16, issue.2, 1997.

R. H. Bisseling and W. F. Mccoll, Scientific computing on bulk synchronous parallel architectures, Technology and Foundations: Information Processing '94, pp.509-514, 1994.

R. H. Bisseling and W. Meesen, Communication balancing in parallel sparse matrix-vector multiplication, ETNA, vol.21, pp.47-65, 2005.

R. H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, 2004.
DOI : 10.1093/acprof:oso/9780198529392.001.0001

B. Bollobás and I. Leader, Edge-isoperimetric inequalities in the grid, Combinatorica, vol.32, issue.4, pp.299-314, 1991.
DOI : 10.1007/BF01275667

E. Boman, K. Devine, L. A. Fisk, R. Heaphy, B. Hendrickson et al., Parallel Partitioning, Load-balancing, and Data Management Services; User's Guide, Sandia National Lab, 2007.

T. N. Bui, C. Jones, ¨. V. , and C. Aykanat, Finding good approximate vertex and edge partitions is NP-hard Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, Inf. Proc. Lett. IEEE T. Par. and Dist. Sys, vol.42, issue.10 7, pp.153-159, 1992.

M. Christen, O. Schenk, and H. Burkhart, PATUS: A Code Generation and Autotuning Framework for Parallel Iterative Stencil Computations on Modern Microarchitectures, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.676-687, 2011.
DOI : 10.1109/IPDPS.2011.70

K. Datta, S. Kamil, S. Williams, L. Oliker, J. Shalf et al., Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors, SIAM Review, vol.51, issue.1, pp.129-159, 2009.
DOI : 10.1137/070693199

A. E. Feldmann, Fast balanced partitioning is hard even on grids and trees, Theoretical Computer Science, vol.485, pp.61-68, 2013.
DOI : 10.1016/j.tcs.2013.03.014

J. R. Gilbert, G. L. Miller, and S. Teng, Geometric Mesh Partitioning: Implementation and Experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998.
DOI : 10.1137/S1064827594275339
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3807

B. Hendrickson, Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract), Proc. of the 5th Int. Symp. on Solving Irregularly Structured Problems in Parallel, ser. IRREGULAR '98, pp.218-225, 1998.

S. Kamil, C. Chan, L. Oliker, J. Shalf, and S. Williams, An auto-tuning framework for parallel multicore stencil computations, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp.1-12, 2010.
DOI : 10.1109/IPDPS.2010.5470421

G. Karypis and V. Kumar, MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices

G. Karypis, V. Kumar, R. Aggarwal, and S. Shekhar, hMeTiS: A Hypergraph Partitioning Package Version 1.0.1, 1998.

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, 1990.
DOI : 10.1007/978-3-322-92106-2

B. Uçar and C. Aykanat, Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies, SIAM Journal on Scientific Computing, vol.25, issue.6, pp.1837-1859, 2004.
DOI : 10.1137/S1064827502410463

B. V. Uçar-and¨uand¨-and¨u, On the scalability of hypergraph models for sparse matrix partitioning, PDP 2010, pp.593-600, 2010.

]. B. Uçar, ¨. U. , and C. Aykanat, A matrix partitioning interface to PaToH in MATLAB, Parallel Computing, vol.36, pp.5-6, 2010.

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

D. Wang and P. Wang, Discrete Isoperimetric Problems, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.860-870, 1977.
DOI : 10.1137/0132073