E. Agullo, On the out-of-core factorization of large sparse matrices, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00563463

E. Agullo, A. Guermouche, and J. Excellent, Reducing the I/O volume in an out-of-core sparse multifrontal solver A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory, High Performance Computing ? HiPC2007; 14th International Conference, pp.260-280, 2007.

D. M. Alber and L. N. Olson, Parallel coarse-grid selection, Numerical Linear Algebra with Applications, pp.611-643, 2007.

H. Alt, N. Blum, K. Mehlhorn, and M. Paul, Computing a maximum cardinality matching in a bipartite graph in time O(n1.5), Information Processing Letters, vol.37, issue.4, pp.237-240, 1991.
DOI : 10.1016/0020-0190(91)90195-N

P. R. Amestoy, T. A. Davis, and I. S. Duff, An Approximate Minimum Degree Ordering Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.
DOI : 10.1137/S0895479894278952
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8417

P. R. Amestoy, I. S. Duff, and J. Excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers, Computer methods in applied mechanics and engineering, pp.501-520, 2000.

P. R. Amestoy, I. S. Duff, J. Excellent, and J. Koster, A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
DOI : 10.1137/S0895479899358194
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, I. S. Duff, and C. Vömel, Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.2, pp.544-565, 2004.
DOI : 10.1137/S0895479802419877

P. R. Amestoy, A. Guermouche, J. Excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006.
DOI : 10.1016/j.parco.2005.07.004
URL : https://hal.archives-ouvertes.fr/hal-00358623

C. Ashcraft, Compressed Graphs and the Minimum Degree Algorithm, SIAM Journal on Scientific Computing, vol.16, issue.6, pp.1404-1411, 1995.
DOI : 10.1137/0916081

C. Ashcraft and R. Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Transactions on Mathematical Software, vol.15, issue.4, pp.291-309, 1989.
DOI : 10.1145/76909.76910

C. Ashcraft and J. W. Liu, A partition improvement algorithm for generalized nested dissection Robust ordering of sparse matrices using multisection, Boeing Computer Services SIAM Journal on Matrix Analysis and Applications, issue.14, pp.19-816, 1996.

O. Axelsson, Iterative solution methods, 1994.
DOI : 10.1017/CBO9780511624100

S. Barnard and H. D. Simon, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, pp.101-117, 1994.

M. Benzi, Preconditioning Techniques for Large Linear Systems: A Survey, Journal of Computational Physics, vol.182, issue.2, pp.418-477, 2002.
DOI : 10.1006/jcph.2002.7176
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.2907

M. Benzi, J. C. Haws, and M. T?ma, Preconditioning Highly Indefinite and Nonsymmetric Matrices, SIAM Journal on Scientific Computing, vol.22, issue.4, pp.1333-1353, 2000.
DOI : 10.1137/S1064827599361308
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.2845

M. Benzi, C. D. Meyer, and M. T?ma, A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method, SIAM Journal on Scientific Computing, vol.17, issue.5, pp.1135-1149, 1996.
DOI : 10.1137/S1064827594271421

M. Benzi, D. B. Szyld, and A. Van-duin, Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems, SIAM Journal on Scientific Computing, vol.20, issue.5, pp.1652-1670, 1999.
DOI : 10.1137/S1064827597326845

M. Benzi and M. T?ma, Orderings for Factorized Sparse Approximate Inverse Preconditioners, SIAM Journal on Scientific Computing, vol.21, issue.5, pp.1851-1868, 2000.
DOI : 10.1137/S1064827598339372

C. Berge, TWO THEOREMS IN GRAPH THEORY, Proceedings of the National Academy of Sciences of the USA, pp.842-844, 1957.
DOI : 10.1073/pnas.43.9.842

M. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo, Support-Graph Preconditioners, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.4, pp.930-951, 2006.
DOI : 10.1137/S0895479801384019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2762

M. V. Bhat, W. G. Habashi, J. W. Liu, V. N. Nguyen, and M. F. Peeters, A Note on Nested Dissection for Rectangular Grids, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.1, pp.14-253, 1993.
DOI : 10.1137/0614020

R. H. Bisseling, Combinatorial problems in high-performance computing, Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing, issue.09061, 2009.

M. Bollhöfer, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra and its Applications, vol.338, issue.1-3, pp.201-218, 2001.
DOI : 10.1016/S0024-3795(01)00385-8

M. Bollhöfer and O. Schenk, Combinatorial Aspects in Sparse Elimination Methods, GAMM-Mitteilungen, vol.23, issue.3, pp.342-367, 2006.
DOI : 10.1002/gamm.201490037

E. G. Boman, D. Chen, B. Hendrickson, and S. Toledo, Maximum-weightbasis preconditioners, Numerical Linear Algebra with Applications, pp.695-721, 2004.

E. G. Boman and B. Hendrickson, Support Theory for Preconditioning, SIAM Journal on Matrix Analysis and Applications, vol.25, issue.3, pp.694-717, 2003.
DOI : 10.1137/S0895479801390637
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.7787

F. Boman and . Ozgüner, A parallel distance-2 graph coloring algorithm for distributed memory computers, Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC-05), pp.796-806, 2005.

R. Bridson and W. Tang, A Structural Diagnosis of Some IC Orderings, SIAM Journal on Scientific Computing, vol.22, issue.5, pp.1527-1532, 2001.
DOI : 10.1137/S1064827599353841

R. A. Brualdi, The symbiotic relationship of combinatorics and matrix theory, Linear Algebra and its Applications, of Encyclopedia of Mathematics and its Applications, pp.162-164, 1992.

R. A. Brualdi and D. M. Cvetkovi´ccvetkovi´c, A Combinatorial Approach to Matrix Theory and its Applications, 2009.
DOI : 10.1201/9781420082241

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.

R. Burkard, M. Dell-'amico, S. Martello, A. Problems, . Siam et al., Duff and Uçar 40 A fine-grain hypergraph model for 2D decomposition of sparse matrices Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS, pp.10-673, 1999.

U. V. , C. Aykanat, and B. Uçar, On two-dimensional sparse matrix partitioning: Models, methods, and a recipe, SIAM Journal on Scientific Computing, vol.32, pp.656-683, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00536961

D. Chen and S. Toledo, Vaidya's preconditioners: Implementation and experimental study, Electronic Transactions on Numerical Analysis, vol.16, pp.30-49, 2003.

E. Chow, A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners, SIAM Journal on Scientific Computing, vol.21, issue.5, pp.1804-1822, 2000.
DOI : 10.1137/S106482759833913X

E. Chow, R. D. Falgout, J. J. Hu, R. S. Tuminaro, and U. M. Yang, 10. A Survey of Parallelization Techniques for Multigrid Solvers, Parallel Processing for Scientific Computing of Software, Environments, and Tools, SIAM, pp.179-201, 2006.
DOI : 10.1137/1.9780898718133.ch10

E. Chow and Y. Saad, Experimental study of ILU preconditioners for indefinite matrices, Journal of Computational and Applied Mathematics, vol.86, issue.2, pp.387-414, 1997.
DOI : 10.1016/S0377-0427(97)00171-4

S. S. Clift and W. Tang, Weighted graph based ordering techniques for preconditioned conjugate gradient methods, BIT Numerical Mathematics, vol.16, issue.3, pp.30-47, 1995.
DOI : 10.1007/BF01732977

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

E. Cuthill and J. Mckee, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th national conference on -, pp.157-172, 1969.
DOI : 10.1145/800195.805928

T. A. Davis, Direct Methods for Sparse Linear Systems, no. 2 in Fundamentals of Algorithms, Society for Industrial and Applied Mathematics, 2006.
DOI : 10.1137/1.9780898718881

T. A. Davis and I. S. Duff, An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.1, pp.140-158, 1997.
DOI : 10.1137/S0895479894246905

E. F. D-'azevedo, P. A. Forsyth, and W. Tang, Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems Towards a cost-effective ILU preconditioner with high level fill, SIAM Journal on Matrix Analysis and Applications BIT Numerical Mathematics, vol.13, pp.944-961, 1992.

H. De-sterck, R. D. Falgout, J. W. Nolting, and U. M. Yang, Distancetwo interpolation for parallel algebraic multigrid, Numerical Linear Algebra with Applications, pp.115-139, 2008.

H. De-sterck, U. M. Yang, and J. J. Heys, Reducing Complexity in Parallel Algebraic Multigrid Preconditioners, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.4, pp.1019-1039, 2006.
DOI : 10.1137/040615729

J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. Liu, A Supernodal Approach to Sparse Partial Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.3, pp.720-755, 1999.
DOI : 10.1137/S0895479895291765

K. D. Devine, E. G. Boman, and G. Karypis, 6. Partitioning and Load Balancing for Emerging Parallel Applications and Architectures, Frontiers of Scientific Computing, 2006.
DOI : 10.1137/1.9780898718133.ch6

F. Dobrian, External Memory Algorithms for Factoring Sparse Matrices, 2001.

J. J. Dongarra, J. Du-croz, I. S. Duff, and S. Hammarling, A set of level 3 Basic Linear Algebra Subprograms, ACM Transactions on Mathematical Software, pp.16-17, 1990.

I. S. Duff, Analysis of Sparse Systems On permutations to block triangular form Algorithm 575: Permutations for a zero-free diagonal On algorithms for obtaining a maximum transversal, Full matrix techniques in sparse Gaussian elimination Proceedings of 1981 Dundee Biennal Conference on Numerical Analysis, pp.61-339, 1972.

I. S. Duff, A. M. Erisman, and J. K. Reid, On George???s Nested Dissection Method, Direct Methods for Sparse Matrices, pp.686-695, 1976.
DOI : 10.1137/0713056

I. S. Duff and J. Koster, The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.889-901, 1999.
DOI : 10.1137/S0895479897317661

I. S. Duff and G. A. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT, vol.55, issue.4, pp.29-635, 1989.
DOI : 10.1007/BF01932738

I. S. Duff, J. K. Reid, . Hmso, and U. London, Algorithm 529: Permutations to block triangular form An implementation of Tarjan's algorithm for the block triangularization of a matrix MA27?A set of Fortran subroutines for solving sparse symmetric sets of linear equations The multifrontal solution of indefinite sparse symmetric linear equations A note on the work involved in no-fill sparse matrix factorization The multifrontal solution of unsymmetric sets of linear equations, ACM Transactions on Mathematical Software ACM Transactions on Mathematical Software ACM Transactions on Mathematical Software IMA Journal on Numerical Analysis SIAM Journal on Scientific and Statistical Computing, vol.4, issue.5, pp.189-192, 1978.

I. S. Duff, D. Ruiz, and B. Uçar, Computing a class of bipartite matchings in parallel, Presentation at SIAM 13th Conference on Parallel Processing for Scientific Computing (PP08), 2008.

I. S. Duff and B. Uçar, On the Block Triangular Form of Symmetric Matrices, SIAM Review, vol.52, issue.3, 2008.
DOI : 10.1137/080720036
URL : https://hal.archives-ouvertes.fr/ensl-00536955

I. S. Duff, H. A. Van, and . Vorst, Developments and trends in the parallel solution of linear systems, Parallel Computing, vol.25, issue.13-14, pp.1931-1970, 1999.
DOI : 10.1016/S0167-8191(99)00077-0

A. L. Dulmage and N. S. Mendelsohn, Coverings of bipartite graphs, Journal canadien de math??matiques, vol.10, issue.0, pp.517-534, 1958.
DOI : 10.4153/CJM-1958-052-0

S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman, Yale sparse matrix package I: The symmetric codes, International Journal for Numerical Methods in Engineering, vol.2, issue.8, pp.1145-1151, 1982.
DOI : 10.1002/nme.1620180804

S. C. Eisenstat and J. W. Liu, The Theory of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.3, pp.686-705, 2005.
DOI : 10.1137/S089547980240563X

M. Elkin, Y. Emek, D. A. Spielman, and S. Teng, Lower-Stretch Spanning Trees, SIAM Journal on Computing, vol.38, issue.2, pp.608-628, 2008.
DOI : 10.1137/050641661
URL : http://arxiv.org/abs/cs/0411064

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

M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

D. Fritzsche, A. Frommer, and D. B. Szyld, Extensions of Certain Graph-based Algorithms for Preconditioning, SIAM Journal on Scientific Computing, vol.29, issue.5, pp.2144-2161, 2007.
DOI : 10.1137/060661284

A. H. Gebremedhin, F. Manne, and A. Pothen, What Color Is Your Jacobian? Graph Coloring for Computing Derivatives, SIAM Review, vol.47, issue.4, pp.47-629, 2005.
DOI : 10.1137/S0036144504444711

M. W. Gee, C. M. Siefert, J. J. Hu, R. S. Tuminaro, and M. G. Sala, smoothed aggregation user's guide, 2006.

G. A. Geist and E. G. Ng, Task scheduling for parallel sparse Cholesky factorization, International Journal of Parallel Programming, vol.27, issue.4, pp.291-314, 1989.
DOI : 10.1007/BF01407861

A. George, Nested Dissection of a Regular Finite Element Mesh, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.10-345, 1973.
DOI : 10.1137/0710032

A. George and J. W. Liu, An automatic nested dissection algorithm for irregular finite element problems A fast implementation of the minimum degree algorithm using quotient graphs A minimal storage implementation of the minimum degree algorithm The evolution of the minimum degree ordering algorithm, SIAM Journal on Numerical Analysis ACM Transactions on Mathematical Software SIAM Journal on Numerical Analysis N.J. SIAM Review, vol.15, issue.17, pp.1053-1069, 1978.

A. George, J. W. Liu, and E. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube, Parallel Computing, vol.10, issue.3, pp.287-298, 1989.
DOI : 10.1016/0167-8191(89)90101-4

A. George and D. R. Mcintyre, On the Application of the Minimum Degree Algorithm to Finite Element Systems, SIAM Journal on Numerical Analysis, vol.15, issue.1, pp.90-112, 1978.
DOI : 10.1137/0715006

A. George, W. G. Poole, and R. G. Voigt, Grid Problems, SIAM Journal on Numerical Analysis, vol.15, issue.4, pp.662-673, 1978.
DOI : 10.1137/0715044

A. J. George, Computer Implementation of the Finite Element Method, 1971.

J. R. Gilbert, A Note on the NP-Completeness of Vertex Elimination on Directed Graphs, SIAM Journal on Algebraic Discrete Methods, vol.1, issue.3, pp.292-294, 1980.
DOI : 10.1137/0601033

J. R. Gilbert and J. W. Liu, Elimination Structures for Unsymmetric Sparse $LU$ Factors, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.2, pp.334-352, 1993.
DOI : 10.1137/0614024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8919

J. R. Gilbert, C. Moler, and R. Schreiber, Sparse Matrices in MATLAB: Design and Implementation, SIAM Journal on Matrix Analysis and Applications, vol.13, issue.1, pp.333-356, 1992.
DOI : 10.1137/0613024

J. R. Gilbert and T. Peierls, Sparse Partial Pivoting in Time Proportional to Arithmetic Operations, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.5, pp.862-874, 1988.
DOI : 10.1137/0909058

J. R. Gilbert and R. Schreiber, Highly Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.5, pp.1151-1172, 1992.
DOI : 10.1137/0913067
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2953

J. R. Gilbert and R. E. Tarjan, The analysis of a nested dissection algorithm, Numerische Mathematik, vol.2, issue.4, pp.377-404, 1987.
DOI : 10.1007/BF01396660

J. R. Gilbert and S. Toledo, High-performance out-of-core sparse LU factorization, 9th SIAM Conference on Parallel Processing for Scientific Computing (CDROM), p.10, 1999.

R. Greenlaw, A model classifying algorithms as inherently sequential with applications to graph searching, Information and Computation, pp.133-149, 1992.

K. D. Gremban, Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems, 1996.

K. D. Gremban, G. L. Miller, and M. Zagha, Performance evaluation of a new parallel preconditioner, Proceedings of 9th International Parallel Processing Symposium, pp.65-69, 1995.
DOI : 10.1109/IPPS.1995.395915

M. J. Grote and T. Huckle, Parallel Preconditioning with Sparse Approximate Inverses, SIAM Journal on Scientific Computing, vol.18, issue.3, pp.838-853, 1997.
DOI : 10.1137/S1064827594276552
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1183

S. Guattery, Graph embedding techniques for bounding condition numbers of incomplete factor preconditioners, 1997.

A. Guermouche and J. Excellent, Constructing memory-minimizing schedules for multifrontal methods, ACM Transactions on Mathematical Software, vol.32, issue.1, pp.17-32, 2006.
DOI : 10.1145/1132973.1132975
URL : https://hal.archives-ouvertes.fr/hal-00358620

A. Gupta, T. J. Ibm-research-division, . Watson-research, and . Center, Fast and effective algorithms for graph partitioning and sparse matrix ordering Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices, SIAM Journal on Matrix Analysis and Applications, vol.117, pp.24-529, 1996.
DOI : 10.1137/s089547980139604x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5557

I. Gustafsson, A class of first order factorization methods, BIT, vol.10, issue.2, pp.142-156, 1978.
DOI : 10.1007/BF01931691

F. G. Gustavson, FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX, Sparse Matrix Computations, pp.275-289, 1976.
DOI : 10.1016/B978-0-12-141050-6.50021-0

M. Halappanavar, Algorithms for vertex-weighted matching in graphs, 2008.

M. Hall and J. , An Algorithm for Distinct Representatives, The American Mathematical Monthly, vol.63, issue.10, pp.716-717, 1956.
DOI : 10.2307/2309562

P. Hall, On representatives of subsets, Journal of the London Mathematical Society, pp.1-10, 1935.

M. T. Heath, E. Ng, and B. W. Peyton, Parallel Algorithms for Sparse Linear Systems, SIAM Review, vol.33, issue.3, pp.420-460, 1991.
DOI : 10.1137/1033099

P. Heggernes, S. C. Eisenstat, G. Kumfert, and A. Pothen, The computational complexity of the minimum degree algorithm, Proceedings of NIK 2001? 14th Norwegian Computer Science Conference, pp.98-109, 2001.
DOI : 10.2172/15002765

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

B. Hendrickson and R. Leland, The Chaco user's guide, version 2.0, Sandia National Laboratories A multilevel algorithm for partitioning graphs, Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), p.28, 1995.

B. Hendrickson and A. Pothen, Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science, High Performance Computing for Computational Science?VECPAR, 2006.
DOI : 10.1007/978-3-540-71351-7_21

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

P. Hénon, P. Ramet, and J. Roman, On finding approximate supernodes for an efficient block-ILU(k) factorization, Parallel Computing, vol.34, issue.6-8, pp.345-362, 2008.
DOI : 10.1016/j.parco.2007.12.003

V. E. Henson and U. M. Yang, BoomerAMG: A parallel algebraic multigrid solver and preconditioner, Applied Numerical Mathematics, vol.41, issue.1, pp.155-177, 2002.
DOI : 10.1016/S0168-9274(01)00115-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.5259

A. J. Hoffman, M. S. Martin, and D. J. Rose, Complexity Bounds for Regular Finite Difference and Finite Element Grids, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.10-364, 1973.
DOI : 10.1137/0710033

J. E. Hopcroft and R. M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

D. Hysom and A. Pothen, A Scalable Parallel Algorithm for Incomplete Factor Preconditioning, SIAM Journal on Scientific Computing, vol.22, issue.6, pp.2194-2215, 2001.
DOI : 10.1137/S1064827500376193

B. M. Irons, A frontal solution program for finite element analysis, International Journal for Numerical Methods in Engineering, vol.3, issue.1, pp.5-32, 1970.
DOI : 10.1002/nme.1620020104

J. A. Jess and H. G. Kees, A Data Structure for Parallel L/U Decomposition, IEEE Transactions on Computers, vol.31, issue.3, pp.31-231, 1982.
DOI : 10.1109/TC.1982.1675979

A. Joshi, Topics in Optimization and Sparse Linear Systems, 1996.

G. Karypis and V. Kumar, Parallel threshold-based ILU factorization MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices version 4.0, Supercomputing '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), pp.1-24, 1997.

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

H. Kim, J. Xu, and L. Zikatanov, A multigrid method based on graph matching for convection-diffusion equations, Numerical Linear Algebra with Applications, pp.181-195, 2003.

I. Koutis, Combinatorial and algebraic tools for multigrid algorithms, 2007.

H. W. Kuhn, The Hungarian method for the assignment problem, Statement for Naval Research Logistics, Naval Research Logistics, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Desing and Analysis of Algorithms The Benjamin, 1994.

I. Lee, P. Raghavan, and E. G. Ng, Effective Preconditioning through Ordering Interleaved with Incomplete Factorization, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.4, pp.1069-1088, 2006.
DOI : 10.1137/040618357
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.6237

R. J. Lipton, D. J. Rose, and R. E. Tarjan, Generalized Nested Dissection, SIAM Journal on Numerical Analysis, vol.16, issue.2, pp.346-358, 1979.
DOI : 10.1137/0716027

R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, pp.177-189, 1979.
DOI : 10.1137/0136016

J. W. Liu, A compact row storage scheme for Cholesky factors using elimination trees 152. , On the storage requirement in the out-of-core multifrontal method for sparse factorization Equivalent sparse matrix reordering by elimination tree rotations The minimum degree ordering with constraints The role of elimination trees in sparse factorization The multifrontal method for sparse matrix solution: Theory and practice, ACM Transactions on Mathematical Software ACM Transactions on Mathematical Software ACM Transactions on Mathematical Software SIAM Journal on Scientific and Statistical Computing SIAM Journal on Scientific and Statistical Computing SIAM Journal on Matrix Analysis and Applications SIAM Review, vol.11, issue.155, pp.141-153, 1985.
DOI : 10.1145/6497.6499

J. W. Liu, E. G. Ng, and B. W. Peyton, On Finding Supernodes for Sparse Matrix Computations, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.1, pp.242-252, 1993.
DOI : 10.1137/0614019

W. Liu and A. H. Sherman, Comparative Analysis of the Cuthill???McKee and the Reverse Cuthill???McKee Ordering Algorithms for Sparse Matrices, SIAM Journal on Numerical Analysis, vol.13, issue.2, pp.198-213, 1976.
DOI : 10.1137/0713020

M. Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem, SIAM Journal on Computing, vol.15, issue.4, pp.1036-1053, 1986.
DOI : 10.1137/0215074

M. Manguoglu, A. Sameh, and O. Schenk, PSPIKE: A Parallel Hybrid Sparse Linear System Solver, Proc. Euro-Par 2009 Parallel Processing, pp.797-808, 2009.
DOI : 10.1007/s00450-009-0080-x

F. Manne and R. H. Bisseling, A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem, Parallel Processing and Applied Mathematics, pp.708-717, 2008.
DOI : 10.1007/978-3-540-68111-3_74

H. M. Markowitz, The Elimination form of the Inverse and its Application to Linear Programming, Management Science, vol.3, issue.3, pp.255-269, 1957.
DOI : 10.1287/mnsc.3.3.255

J. A. Meijerink, H. A. Van, and . Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M -matrix, Mathematics of Computation, pp.31-148, 1977.

O. Meshar, D. Irony, and S. Toledo, An out-of-core sparse symmetric-indefinite factorization method, ACM Transactions on Mathematical Software, vol.32, issue.3, pp.445-471, 2006.
DOI : 10.1145/1163641.1163645

E. G. Ng, B. W. Peyton, and P. Raghavan, A blocked incomplete Cholesky preconditioner for hierarchical-memory computers, in Iterative methods in scientific computation, IMACS Series in Computational Applied Mathematics, vol.5, pp.211-222, 1999.

M. Olschowka and A. Neumaier, A new pivoting strategy for Gaussian elimination, Linear Algebra and its Applications, vol.240, pp.131-151, 1996.
DOI : 10.1016/0024-3795(94)00192-8
URL : http://doi.org/10.1016/0024-3795(94)00192-8

J. O. Neil and D. B. Szyld, A block ordering method for sparse matrices, SIAM Journal on Scientific and Statistical Computing, vol.11, pp.811-823, 1990.

S. Parter, The Use of Linear Graphs in Gauss Elimination, SIAM Review, vol.3, issue.2, pp.119-130, 1961.
DOI : 10.1137/1003021

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. Pothen, Sparse Null Bases and Marriage Theorems, Graph matchings in combinatorial scientific computing Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061), 1984.

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software, vol.16, issue.4, pp.303-324, 1990.
DOI : 10.1145/98267.98287

A. Pothen, H. D. Simon, and K. Liou, Partitioning Sparse Matrices with Eigenvectors of Graphs, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.11-430, 1990.
DOI : 10.1137/0611030

A. Pothen and C. Sun, A Mapping Algorithm for Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, vol.14, issue.5, pp.1253-1257, 1993.
DOI : 10.1137/0914074

J. K. Reid and J. A. Scott, An out-of-core sparse Cholesky solver An efficient out-of-core sparse symmetric indefinite direct solver, 2006.

J. H. Reif, Depth-first search is inherently sequential, Information Processing Letters, vol.20, issue.5, pp.229-234, 1985.
DOI : 10.1016/0020-0190(85)90024-9

J. Riedy and J. Demmel, Parallel weighted bipartite matching and applications, Presentation at SIAM 11th Conference on Parallel Processing for Scientific Computing (PP04), 2004.

D. J. Rose, A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS, Convergent regular splittings for singular M -matrices, pp.183-217, 1972.
DOI : 10.1016/B978-1-4832-3187-7.50018-0

D. J. Rose and R. E. Tarjan, Algorithmic Aspects of Vertex Elimination on Directed Graphs, SIAM Journal on Applied Mathematics, vol.34, issue.1, pp.176-197, 1978.
DOI : 10.1137/0134014

D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

D. J. Rose and G. F. Whitten, Automatic nested dissection, Proceedings of the 1974 annual conference on , ACM 74, pp.82-88, 1974.
DOI : 10.1145/800182.810384

V. Rotkin and S. Toledo, The design and implementation of a new out-of-core sparse cholesky factorization method, ACM Transactions on Mathematical Software, vol.30, issue.1, pp.19-46, 2004.
DOI : 10.1145/974781.974783

J. W. Ruge and K. Stüben, 4. Algebraic Multigrid, pp.73-130, 1987.
DOI : 10.1137/1.9781611971057.ch4

Y. Saad, ILUT: A dual threshold incomplete LU factorization, Numerical Linear Algebra with Applications 189. , Finding exact and approximate block structures for ILU preconditioning Iterative Methods for Sparse Linear Systems, Multilevel ILU with reorderings for diagonal dominance, pp.387-402, 1994.

M. Sala and M. Heroux, Robust algebraic preconditioners with IFPACK 3.0, Tech, 2005.

R. Schreiber, A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982.
DOI : 10.1145/356004.356006

J. Schulze, Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods, Bit Numerical Mathematics, vol.41, issue.4, pp.800-841, 2001.
DOI : 10.1023/A:1021908421589

H. D. Simon, Incomplete LU Preconditioners for Conjugate-Gradient-Type Iterative Methods, Proceedings of the 1985 Reservoir Simulation Symposium, pp.387-396, 1985.
DOI : 10.2118/13533-PA

B. Speelpenning, The generalized element method, 1978.

D. A. Spielman and S. Teng, Solving sparse, symmetric, diagonally dominant linear systems in time O(m 1.31 ) Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, 44th Annual IEEE Symposium on Foundations of Computer Science STOC'04: Proceedings of the 36th annual ACM symposium on Theory of computing, pp.416-427, 2003.

K. Stüben, A review of algebraic multigrid, Journal of Computational and Applied Mathematics, vol.128, issue.1-2, pp.281-309, 2001.
DOI : 10.1016/S0377-0427(00)00516-1

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, Data Structures and Network Algorithms CBMS-NSF Regional Conference Series in Applied Mathematics, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

W. F. Tinney and J. W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proceedings of the IEEE, pp.1801-1809, 1967.
DOI : 10.1109/PROC.1967.6011

S. Toledo, A. Uchitel, R. Wyrzykowski, K. Karczewski, and J. Dongarra, A Supernodal Out-of-Core Sparse Gaussian-Elimination Method, 7th International Conference on Parallel Processing and Applied Mathematics, pp.728-737, 2007.
DOI : 10.1007/978-3-540-68111-3_76

R. S. Tuminaro and C. Tong, Parallel Smoothed Aggregation Multigrid : Aggregation Strategies on Massively Parallel Machines, ACM/IEEE SC 2000 Conference (SC'00), p.5, 2000.
DOI : 10.1109/SC.2000.10008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1080

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

P. M. Vaidya, Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation, 1991.

R. A. Willoughby, A characterization of matrix irreducibility, of International Series of Numerical Mathematics, pp.131-143, 1975.

M. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010