T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, 1990.

Ü. V. and C. Aykanat, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.7, pp.673-693, 1999.

Ü. V. , C. Aykanat, and B. Uçar, On twodimensional 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

Ü. V. , C. Aykanat, and E. Kayaaslan, Hypergraph partitioning-based fill-reducing ordering for symmetric matrices, SIAM Journal on Scientific Computing, vol.33, issue.4, pp.1996-2023, 2011.

Ü. V. , E. Boman, K. Devine, D. Bozdag, R. Heaphy et al., A repartitioning hypergraph model for dynamic load balancing, Journal of Parallel and Distributed Computing, vol.69, issue.8, pp.711-724, 2009.

R. H. Bisseling, J. Byrka, S. Cerav-erbas, N. Gvozdenovi?, M. Lorenz et al., Partitioning a call graph, Proceedings Study Group Mathematics with Industry, 2005.

R. H. Bisseling and I. Flesch, Mondriaan sparse matrix partitioning for attacking cryptosystems by a parallel block lanczos algorithm-A case study, Parallel Computing, vol.32, issue.7-8, pp.551-567, 2006.

S. Shekhar, C. Lu, S. Chawla, and S. Ravada, Efficient join-index-based spatial-join processing: A clustering approach, IEEE Transactions on, vol.14, issue.6, pp.1400-1421, 2002.

D. Liu and M. Wu, A hypergraph based approach to declustering problems, Distributed and Parallel Databases, vol.10, pp.269-288, 2001.

M. M. Ozdal and C. Aykanat, Hypergraph models and algorithms for data-pattern-based clustering, Data Mining and Knowledge Discovery, vol.9, pp.29-57, 2004.

G. Karypis and V. Kumar, hMeTiS: A hypergraph partitioning package, 1998.

A. Caldwell, A. Kahng, and I. Markov, Improved algorithms for hypergraph bipartitioning, Proceedings of the ASP-DAC 2000, pp.661-666, 2000.

B. Vastenhouw and R. H. Bisseling, A two-dimensional data distribution method for parallel sparse matrix-vector multiplication, SIAM Review, vol.47, issue.1, pp.67-95, 2005.

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

Ü. V. and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, 1999.

E. Boman, K. Devine, R. Heaphy, B. Hendrickson, V. Leung et al., Zoltan 3.0: Parallel Partitioning

, User's Guide, Sandia National Laboratories, 2007.

B. Uçar, Ü. V. , and C. Aykanat, A matrix partitioning interface to PaToH in Matlab, Parallel Computing, vol.36, issue.5-6, pp.254-272, 2010.

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.

G. Karypis, Multilevel hypergraph partitioning, pp.2-25, 2002.

K. Devine, E. Boman, R. Heaphy, R. Bisseling, and .. V. , Parallel hypergraph partitioning for scientific computing, Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS), 2006.

F. Manne and R. H. Bisseling, A parallel approximation algorithm for the weighted maximum matching problem, Parallel Processing and Applied Mathematics, ser. Lecture Notes in Computer Science, vol.4967, pp.708-717, 2008.

Ü. V. , F. Dobrian, A. Gebremedhin, M. Halappanavar, and A. Pothen, Distributed-memory parallel algorithms for matching and coloring, 2011 International Symposium on Parallel and Distributed Processing, pp.1966-1975, 2011.

M. Halappanavar, J. Feo, O. Villa, A. Tumeo, and A. Pothen, Approximate weighted matching on emerging manycore and multithreaded architectures, International Journal of High Performance Computing Applications, 2011.

M. M. Patwary, R. H. Bisseling, and F. Manne, Parallel greedy graph matching using an edge partitioning approach, Proceedings of the fourth international workshop on Highlevel parallel programming and applications, ser. HLPP '10, pp.45-54, 2010.

A. Abou-rjeili and G. Karypis, Multilevel algorithms for partitioning power-law graphs, 20th International Parallel and Distributed Processing Symposium (IPDPS), p.10, 2006.

C. Chevalier and I. Safro, Comparison of Coarsening Schemes for Multilevel Graph Partitioning, Learning and Intelligent Optimization, ser. Lecture Notes in Computer Science, T. Stützle, vol.5851, pp.191-205, 2009.

H. N. Gabow, An efficient implementation of Edmonds' algorithm for maximum matching on graphs, J. ACM, vol.23, pp.221-234, 1976.

G. , Validity of the single processor approach to achieving large-scale computing capabilities, Proceedings of AFIP'67, pp.483-485, 1967.