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, 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, J. Excellent, and X. S. Li, Analysis and comparison of two general sparse solvers for distributed memory computers, ACM Transactions on Mathematical Software, vol.27, issue.4, pp.388-421, 2001.
DOI : 10.1145/504210.504212
URL : https://hal.archives-ouvertes.fr/hal-00808296

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

M. Arioli, J. W. Demmel, and I. S. Duff, Solving Sparse Linear Systems with Sparse Backward Error, SIAM Journal on Matrix Analysis and Applications, vol.10, issue.2, pp.165-190, 1989.
DOI : 10.1137/0610013

E. Boros, V. Gurvich, and I. Zverovich, Neighborhood hypergraphs of bipartite graphs, Journal of Graph Theory, vol.24, issue.1, pp.69-95, 2008.
DOI : 10.1002/jgt.20293

C. J. Colbourn and B. D. Mckay, A correction to Colbourn's paper on the complexity of matrix symmetrizability, Information Processing Letters, vol.11, issue.2, pp.96-97, 1980.
DOI : 10.1016/0020-0190(80)90012-5

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 Transactions on Mathematical Software, vol.38, issue.1, pp.1-125, 2011.
DOI : 10.1145/2049662.2049663

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 J. Koster, On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.4, pp.973-996, 2001.
DOI : 10.1137/S0895479899358443

A. V. Goldberg and R. Kennedy, An efficient cost scaling algorithm for the assignment problem, Mathematical Programming, vol.2, issue.2, pp.153-177, 1995.
DOI : 10.1007/BF01585996

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.

E. Lawler, Combinatorial Optimization: Networks and Matroids, unabridged reprint of Combinatorial Optimization: Networks and Matroids, 2001.

X. S. Li and J. W. , 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 and its Applications, vol.240, pp.131-151, 1996.
DOI : 10.1016/0024-3795(94)00192-8

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

B. Uçar, Heuristics for a Matrix Symmetrization Problem, Proceedings of Parallel Processing and Applied Mathematics (PPAM'07), pp.718-727, 2008.
DOI : 10.1007/978-3-540-68111-3_75