C. J. Alpert and A. B. Kahng, Recent directions in netlist partitioning: A survey, VLSI Journal, vol.19, issue.1-2, pp.1-81, 1995.

B. Cevdet-aykanat, . Barla, B. Cambazoglu, and . Uçar, Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices, Journal of Parallel and Distributed Computing, vol.68, issue.5, pp.609-625, 2008.

S. T. Barnhard and H. D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, vol.6, issue.2, pp.67-95, 1994.

R. H. Bisseling and W. Meesen, Communication balancing in parallel sparse matrix-vector multiplication, Electronic Transactions on Numerical Analysis, vol.21, pp.47-65, 2005.

T. N. Bui and C. Jones, A heuristic for reducing fill-in sparse matrix factorization, Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, pp.445-452, 1993.

M. 12ümit-v.-Ç-atalyürek, K. Deveci, A. Kaya, and . Bora-uç-ar,

Ü. V. and C. Aykanat, A hypergraph model for mapping repeated sparse matrixvector product computations onto multicomputers, Proc. International Conference on High Performance Computing, vol.7, pp.673-693, 1995.

Ü. V. and C. Aykanat, Patoh: A multilevel hypergraph partitioning tool, 1999.

Ü. 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, issue.2, pp.656-683, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00536961

, 10th DIMACS implementation challenge: Graph partitioning and graph clustering, 2011.

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proc. 19th Design Automation Conference, pp.175-181, 1982.

B. Hendrickson and T. G. Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, pp.1519-1534, 2000.

B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, Proc. Supercomputing, 1995.

G. Karypis, Multilevel hypergraph partitioning, 2002.

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

T. Lengauer, Combinatorial algorithms for integrated circuit layout, 1990.

A. Trifunovic and W. Knottenbelt, Parkway 2.0: A parallel multilevel hypergraph partitioning tool, Proc. ISCIS, vol.3280, pp.789-800, 2004.

B. Uçar and C. Aykanat, Minimizing communication cost in fine-grain partitioning of sparse matrices, Computer and Information Sciences -ISCIS, vol.2869, pp.926-933, 2003.

B. Uçar and C. Aykanat, Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies, SIAM J. Sci. Comput, vol.25, pp.1837-1859, 2004.

C. Walshaw, M. G. Everett, and M. Cross, Parallel dynamic graph partitioning for adaptive unstructured meshes, Journal of Parallel Distributed Computing, vol.47, pp.102-108, 1997.