S. Bharathi and A. Chervenak, Scheduling data-intensive workflows on storage constrained resources, Proceedings of the 4th Workshop on Workflows in Support of Large-Scale Science, WORKS '09, 2009.
DOI : 10.1145/1645164.1645167
URL : http://www.isi.edu/~annc/papers/works2009.pdf

A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz, Recent advances in graph partitioning, Algorithm Engineering, pp.117-158, 2016.

T. A. Davis, Direct Methods for Sparse Linear Systems. Fundamentals of Algorithms, Society for Industrial and Applied Mathematics, 2006.
DOI : 10.1137/1.9780898718881

R. Diekmann, R. Preis, F. Schlimbach, and C. Walshaw, Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM, Graph Partitioning and Parallel Computing, pp.1555-1581, 2000.
DOI : 10.1016/S0167-8191(00)00043-0

W. Donath and A. Hoffman, Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices, IBM Technical Disclosure Bulletin, vol.15, issue.3, pp.938-944, 1972.

W. E. Donath and A. J. Hoffman, Lower Bounds for the Partitioning of Graphs, IBM Journal of Research and Development, vol.17, issue.5, pp.420-425, 1973.
DOI : 10.1147/rd.175.0420

L. Eyraud-dubois, L. Marchal, O. Sinnen, and F. Vivien, Parallel Scheduling of Task Trees with Limited Memory, ACM Transactions on Parallel Computing, vol.2, issue.2, p.13, 2015.
DOI : 10.1145/321607.321620
URL : https://hal.archives-ouvertes.fr/hal-01160118

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, 19th Design Automation Conference, pp.175-181, 1982.
DOI : 10.1145/800263.809204
URL : http://www.comp.nus.edu.sg/~cs5234/2007-08/Lectures/L07/paper-fm.pdf

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, On Optimal Tree Traversals for Sparse Matrix Factorization, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.556-567, 2011.
DOI : 10.1109/IPDPS.2011.60
URL : https://hal.archives-ouvertes.fr/hal-00945078

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

C. Lam, T. Rauber, G. Baumgartner, D. Cociorva, and P. Sadayappan, Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, issue.2, pp.63-75, 2011.
DOI : 10.1016/j.cl.2010.09.003

A. H. Land and A. G. Doig, An automatic method for solving discrete programming problems. 50 Years of Integer Programming, pp.105-132, 1958.
DOI : 10.1007/978-3-540-68279-0_5
URL : http://jmvidal.cse.sc.edu/library/land60a.pdf

J. W. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, vol.12, issue.3, pp.249-264, 1986.
DOI : 10.1145/7921.11325

J. W. Liu, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.3, 1987.
DOI : 10.1137/0608031

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.
DOI : 10.1137/0611010

L. Lovász, Random walks on graphs. Combinatorics, Paul erdos is eighty, pp.1-46, 1993.

G. L. Miller, S. Teng, and S. A. Vavasis, A unified geometric approach to graph separators, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.538-547, 1991.
DOI : 10.1109/SFCS.1991.185417

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling dataintensiveworkflows onto storage-constrained distributed resources, CC- Grid'07, pp.401-409, 2007.
DOI : 10.1109/ccgrid.2007.101
URL : http://www.isi.edu/~deelman/ccgrid07.pdf

L. A. Sanchis, Multiple-way network partitioning, IEEE Transactions on Computers, vol.38, issue.1, pp.62-81, 1989.
DOI : 10.1109/12.8730

S. Schamberger, On partitioning FEM graphs using diffusion, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., p.277, 2004.
DOI : 10.1109/IPDPS.2004.1303358

R. Sethi and J. Ullman, The Generation of Optimal Code for Arithmetic Expressions, Journal of the ACM, vol.17, issue.4, pp.715-728, 1970.
DOI : 10.1145/321607.321620

H. Simon, Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering, vol.2, issue.2-3, pp.135-148, 1991.
DOI : 10.1016/0956-0521(91)90014-V

I. Stanton and G. Kliot, Streaming graph partitioning for large distributed graphs, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.1222-1230
DOI : 10.1145/2339530.2339722
URL : http://www.eecs.berkeley.edu/~isabelle/papers/kdd325-stanton.pdf

R. N°-9115 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399