E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Multifrontal QR Factorization for Multicore Architectures over Runtime Systems, Euro-Par 2013 Parallel Processing, pp.521-532978, 2013.
DOI : 10.1007/978-3-642-40047-6_53

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

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

D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics, 2007.

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Hérault et al., PaRSEC: Exploiting Heterogeneity to Enhance Scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.
DOI : 10.1109/MCSE.2013.98

P. Charrier and J. Roman, Algorithmic study and complexity bounds for a nested dissection solver, Numerische Mathematik, vol.8, issue.4, pp.463-476, 1989.
DOI : 10.1007/BF01396049

N. Christofides, Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , tech. report, DTIC Document, 1976.

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, 2011.
DOI : 10.1145/2049662.2049663

J. Dongarra, J. D. Croz, S. Hammarling, and I. S. Duff, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, pp.16-17, 1990.

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

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

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

R. W. Hamming, Error detecting and error correcting codes, Bell System Tech, J, vol.26, pp.147-160, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x

URL : http://campus.unibo.it/10913/1/hamming1950.pdf

P. Hénon, P. Ramet, and J. Roman, PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems, Parallel Computing, vol.28, issue.2, pp.301-321, 2002.
DOI : 10.1016/S0167-8191(01)00141-7

J. D. Hogg, J. K. Reid, and J. A. Scott, Design of a Multicore Sparse Cholesky Factorization Using DAGs, SIAM Journal on Scientific Computing, vol.32, issue.6, pp.3627-3649, 2010.
DOI : 10.1137/090757216

D. S. Johnson and L. A. Mcgeoch, The traveling salesman problem: A case study in local optimization, Local Search in Combinatorial Optimization, pp.215-310, 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

X. Lacoste, Scheduling and Memory Optimizations for Sparse Direct Solver on Multicore/Multi-gpu Cluster Systems, 2015.

X. Lacoste, M. Faverge, P. Ramet, S. Thibault, and G. Bosilca, Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, pp.29-38, 2014.
DOI : 10.1109/IPDPSW.2014.9

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

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.6528

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.11-134, 1990.
DOI : 10.1137/0611010

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

R. Luce and E. G. Ng, On the Minimum FLOPs Problem in the Sparse Cholesky Factorization, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.1, pp.1-21, 2014.
DOI : 10.1137/130912438

G. L. Miller, S. Teng, and S. A. , Vavasis, A unified geometric approach to graph separators, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp.538-547, 1991.

G. L. Miller and S. A. , Vavasis, Density graphs and separators, Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.331-336, 1991.

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

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. Rosenkrantz, R. E. Stearns, and P. M. Lewis, An Analysis of Several Heuristics for the Traveling Salesman Problem, SIAM Journal on Computing, vol.6, issue.3, pp.563-581, 1977.
DOI : 10.1137/0206041

W. M. Sid-lakhdar, Scaling the Solution of Large Sparse Linear Systems Using Multifrontal Methods on Hybrid Shared-Distributed Memory Architectures, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01111259

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