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. Ashcraft and J. W. Liu, Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.2, pp.325-354, 1998.
DOI : 10.1137/S0895479896308433

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

C. Aykanat, A. V. P?nar, and . Catalyürek, Permuting Sparse Rectangular Matrices into Block-Diagonal Form, SIAM Journal on Scientific Computing, vol.25, issue.6, pp.1860-1879, 2004.
DOI : 10.1137/S1064827502401953
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9163

M. Benzi and B. Uçar, Block triangular preconditioners for M-matrices and Markov chains, Electronic Transactions on Numerical Analysis, vol.26, pp.209-227, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00803523

R. H. Bisseling and W. Meesen, Communication balancing in parallel sparse matrix-vector multiplication, Electronic Transactions on Numerical Analysis, vol.21, pp.47-65, 2005.

E. Boman, K. Devine, L. A. Fisk, R. Heaphy, B. Hendrickson 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, Finding good approximate vertex and edge partitions is NP-hard, Information Processing Letters, vol.42, issue.3, pp.153-159, 1992.
DOI : 10.1016/0020-0190(92)90140-Q

T. N. Bui and C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, 6th SIAM Conference on Parallel Processing for Scientific Computing, pp.445-452, 1993.

¨. U. Catalyürek, C. Aykanat, E. V. Kayaaslan-]-¨-u, . V. Catalyürek12-]-¨-u, C. Catalyürek et al., Hypergraph partitioningbased fill-reducing ordering Hypergraph Models for Sparse Matrix Partitioning and Reordering Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication PaToH: A multilevel hypergraph partitioning tool, version 3.0 Catalyürek and C. Aykanat. A hypergraph-partitioning approach for coarse-grain decomposition, 15] ¨ U. V. ¸ Catalyürek, C. Aykanat, and B. Uçar. On two-dimensional sparse matrix partitioning: Models, methods, and a recipe, pp.673-693656, 1999.

T. A. Davis, Direct Methods for Sparse Linear Systems Number 2 in Fundamentals of Algorithms, Society for Industrial and Applied Mathematics, 2006.

C. Farhat and F. Roux, An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.1, pp.379-396, 1992.
DOI : 10.1137/0913020

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

B. Hendrickson and T. G. Kolda, Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing, SIAM Journal on Scientific Computing, vol.21, issue.6, pp.2048-2072, 2000.
DOI : 10.1137/S1064827598341475
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.156

B. Hendrickson and R. Leland, The Chaco user's guide, version 2.0. Sandia National Laboratories, 1995.

B. Hendrickson and E. Rothberg, Improving the Run Time and Quality of Nested Dissection Ordering, SIAM Journal on Scientific Computing, vol.20, issue.2, pp.468-489, 1998.
DOI : 10.1137/S1064827596300656

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

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, 1998.
DOI : 10.1109/SC.1998.10018
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.6199

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

X. S. Li, M. Shao, I. Yamazaki, and E. G. Ng, Factorization-based sparse solvers and preconditioners, Journal of Physics: Conference Series, p.12015, 2009.
DOI : 10.1088/1742-6596/180/1/012015

I. Moulitsas and G. Karypis, Partitioning algorithms for simultaneously balancing iterative and direct methods, 2004.

F. Pellegrini, SCOTCH 5.1 User's Guide, Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00410332

A. P?nar and B. Hendrickson, Partitioning for complex objectives, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, p.121, 2001.
DOI : 10.1109/IPDPS.2001.925098

Y. Saad, Iterative methods for sparse linear systems, SIAM, 2003.
DOI : 10.1137/1.9780898718003

L. A. Sanchis, Multiple-way network partitioning with different cost functions, IEEE Transactions on Computers, vol.42, issue.12, pp.1500-1504, 1993.
DOI : 10.1109/12.260640

K. Schloegel, G. Karypis, and V. Kumar, Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning, Euro-Par, pp.296-310, 2000.
DOI : 10.1007/3-540-44520-X_39

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, pp.1827-1859, 2004.

B. Uçar and C. Aykanat, Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods, SIAM Journal on Scientific Computing, vol.29, issue.4, pp.1683-1709, 2007.
DOI : 10.1137/040617431

B. Uçar and C. Aykanat, Revisiting Hypergraph Models for Sparse Matrix Partitioning, SIAM Review, vol.49, issue.4, pp.595-603, 2007.
DOI : 10.1137/060662459

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

I. Yamazaki, X. S. Li, and E. G. Ng, Partitioning, load balancing, and matrix ordering in a parallel hybrid solver, Presentation at SIAM Conference on Parallel Processing for Scientific Computing (PP10), 2010.