P. R. Amestoy, I. S. Duff, J. Excellent, and J. Koster, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Math. Anal, vol.23, issue.1, pp.15-41, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, I. S. Duff, J. Excellent, and X. S. Li, Analysis and comparison of two general sparse solvers for distributed memory computers, ACM T. Math. Software, vol.27, issue.4, pp.388-421, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00856654

P. R. Amestoy, A. Guermouche, J. Excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Comput, vol.32, issue.2, pp.136-156, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070599

M. Arioli, J. W. Demmel, and I. S. Duff, Solving sparse linear systems with sparse backward error, SIAM J. Math. Anal, vol.10, issue.2, pp.165-190, 1989.

E. Boros, V. Gurvich, and I. Zverovich, Neighborhood hypergraphs of bipartite graphs, J. Graph Theor, vol.58, issue.1, pp.69-95, 2008.

R. Burkard, M. Dell'amico, and S. Martello, Assignment Problems, 2009.

C. J. Colbourn and B. D. Mckay, A correction to Colbourn's paper on the complexity of matrix symmetrizability, Inform. Process. Lett, vol.11, pp.96-97, 1980.

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

T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM T. Math. Software, vol.38, issue.1, 2011.

I. S. Duff and J. Koster, The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM J. Math. Anal, vol.20, issue.4, pp.889-901, 1999.

I. S. Duff and J. Koster, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Math. Anal, vol.22, pp.973-996, 2001.

A. V. Goldberg and R. Kennedy, An efficient cost scaling algorithm for the assignment problem, Math. Program, vol.71, issue.2, pp.153-177, 1995.

, HSL: A collection of Fortran codes for large-scale scientific computation, 2016.

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

E. Lawler, Combinatorial Optimization: Networks and Matroids, 2001.

X. S. Li and J. W. Demmel, Making sparse Gaussian elimination scalable by static pivoting, Proceedings of the 1998 ACM/IEEE Conference on Supercomputing, pp.1-17, 1998.

M. Olschowka and A. Neumaier, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl, vol.240, pp.131-151, 1996.

R. Portase and B. Uçar, On matrix symmetrization and sparse direct solvers, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01398951

B. Uçar, Heuristics for a matrix symmetrization problem, Proceedings of Parallel Processing and Applied Mathematics (PPAM'07), pp.718-727, 2008.