K. Agrawal, J. T. Fineman, J. Krage, C. E. Leiserson, and S. Toledo, Cache-conscious scheduling of streaming applications, Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures, SPAA '12, pp.236-245, 2012.
DOI : 10.1145/2312005.2312049

URL : http://dspace.mit.edu/bitstream/1721.1/90261/1/Leiserson_Cache-conscious.pdf

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

Ü. V. Çatalyürek and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Bilkent University, Dept. Comp. Engineering, 1999.

T. F. Coleman and W. Xu, Parallelism in structured Newton computations, Parallel Computing: Architectures, Algorithms and Applications, pp.295-302, 2007.
DOI : 10.1137/070701005

T. F. Coleman and W. Xu, Fast (Structured) Newton Computations, SIAM Journal on Scientific Computing, vol.31, issue.2, pp.1175-1191, 2009.
DOI : 10.1137/070701005

T. F. Coleman and W. Xu, Automatic Differentiation in MATLAB using ADMAT with Applications, 2016.
DOI : 10.1137/1.9781611974362

J. Cong, Z. Li, and R. Bagrodia, Acyclic multi-way partitioning of Boolean networks, Proceedings of the 31st annual conference on Design automation conference , DAC '94, pp.670-675, 1994.
DOI : 10.1145/196244.196609

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-1, 2011.
DOI : 10.1145/2049662.2049663

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002.
DOI : 10.1007/s101070100263

URL : http://arxiv.org/pdf/cs/0102001

V. Elango, F. Rastello, L. Pouchet, J. Ramanujam, and P. Sadayappan, On Characterizing the Data Access Complexity of Programs, ACM SIGPLAN Notices, vol.50, issue.1, pp.567-580, 2015.
DOI : 10.1016/j.jcss.2010.06.012

URL : https://hal.archives-ouvertes.fr/hal-01104556

N. Fauzia, V. Elango, M. Ravishankar, J. Ramanujam, F. Rastello et al., Beyond reuse distance analysis, ACM Transactions on Architecture and Code Optimization, vol.10, issue.4, pp.1-5329, 2013.
DOI : 10.1145/2541228.2555309

URL : https://hal.archives-ouvertes.fr/hal-00920031

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

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

B. Hendrickson and R. Leland, The Chaco user's guide, version 1.0, 1993.

J. Herrmann, J. Kho, B. Uçar, K. Kaya, and Ü. V. Çatalyürek, Acyclic Partitioning of Large Directed Acyclic Graphs, 2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), pp.371-380, 2017.
DOI : 10.1109/CCGRID.2017.101

URL : https://hal.archives-ouvertes.fr/hal-01672010

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, Optimal Sequential Partitions of Graphs, Journal of the ACM, vol.18, issue.1, pp.34-40, 1971.
DOI : 10.1145/321623.321627

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

M. R. Kristensen, S. A. Lund, T. Blum, K. Skovhede, and B. Vinter, Bohrium: A Virtual Machine Approach to Portable Parallelism, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, pp.312-321, 2014.
DOI : 10.1109/IPDPSW.2014.44

M. R. Kristensen, S. A. Lund, T. Blum, and J. Avery, Fusion of Parallel Array Operations, Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, PACT '16, pp.71-85, 2016.
DOI : 10.1109/MCSE.2011.37

O. Moreira, M. Popp, and C. Schulz, Graph partitioning with acyclicity constraints

O. Moreira, M. Popp, and C. Schulz, Evolutionary acyclic graph partitioning. CoRR, abs, 1709.

J. Nossack and E. Pesch, A branch-and-bound algorithm for the acyclic partitioning problem, Computers & Operations Research, vol.41, pp.174-184, 2014.
DOI : 10.1016/j.cor.2013.08.013

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

L. Pouchet, Polybench: The polyhedral benchmark suite, p.2012

P. Sanders and C. Schulz, Engineering Multilevel Graph Partitioning Algorithms, Algorithms ? ESA 2011: 19th Annual European Symposium, pp.469-480, 2011.
DOI : 10.1137/S1064827598337373

URL : http://algo2.iti.kit.edu/documents/kahip/engineering_multilevel.pdf

C. Walshaw, Multilevel Refinement for Combinatorial Optimisation Problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.
DOI : 10.1023/B:ANOR.0000039525.80601.15

URL : http://staffweb.cms.gre.ac.uk/~c.walshaw/papers/fulltext/WalshawAoOR04.pdf

E. S. Wong, E. F. Young, and W. K. Mak, Clustering based acyclic multi-way partitioning, Proceedings of the 13th ACM Great Lakes Symposium on VLSI , GLSVLSI '03, pp.203-206, 2003.
DOI : 10.1145/764808.764860

URL : http://www.cse.cuhk.edu.hk/~fyyoung/paper/gvlsi03.pdf