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

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

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

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. Davis, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, 1994.
DOI : 10.1145/2049662.2049663

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

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

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

Y. F. Hu and J. A. Scott, Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers. Numerical Linear Algebra with Applications, pp.877-894, 2005.

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.

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pp.291-307, 1970.

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

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

J. K. Reid and J. A. Scott, Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix, SIAM Journal on Matrix Analysis and Applications, vol.28, issue.3, pp.805-821, 2006.
DOI : 10.1137/050629938