A. Abboud, V. V. Williams, and J. Wang, Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs, SODA 2016. SIAM, pp.377-391, 2016.
DOI : 10.1137/1.9781611974331.ch28
URL : https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch28

D. Berend and T. Tassa, Improved bounds on Bell numbers and on moments of sums of random variables, Probability and Mathematical Statistics, vol.30, pp.185-205, 2010.

L. Hans and . Bodlaender, Dynamic programming on graphs with bounded treewidth, ICALP 1988, pp.105-118, 1988.

L. Hans and . Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on computing, vol.25, pp.1305-1317, 1996.

L. Hans and . Bodlaender, Treewidth: Algorithmic techniques and results, MFCS 1997, pp.19-36, 1997.

L. Hans and . Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical computer science, vol.209, pp.1-45, 1998.

A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive paging with locality of reference, Journal of Computer and System Sciences, vol.50, issue.2, pp.244-258, 1995.
DOI : 10.1145/103418.103422
URL : http://www.ics.uci.edu/~irani/pubs/access_jcss.ps

B. Calder, C. Krintz, S. John, and T. Austin, Cache-conscious data placement, ASPLOS 1998, pp.139-149, 1998.
DOI : 10.1145/291069.291036
URL : http://www.cs.umd.edu/class/spring1999/cmsc732/papers/calder-asplos98.ps

K. Chatterjee and A. Goharshady and R. Ibsen-Jensen and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components, POPL '16 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.733-747, 2016.
DOI : 10.1145/2914770.2837624

K. Chatterjee and A. Goharshady and A. Pavlogiannis, JTDec: A Tool for Tree Decompositions in Soot, ATVA 2017, pp.59-66, 2017.
DOI : 10.1007/978-3-319-68167-2_4
URL : https://repository.ist.ac.at/845/1/2017_Chatterjee_JTDec.pdf

K. Chatterjee and R. Ibsen-Jensen and A. Goharshady and A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, ACM Trans. Program. Lang. Syst, vol.40, p.43, 2018.
DOI : 10.1145/3210257

K. Chatterjee, R. Ibsen-jensen, and A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, CAV 2015, pp.140-157, 2015.
DOI : 10.1007/978-3-319-21690-4_9
URL : http://arxiv.org/pdf/1504.07384

K. Chatterjee, R. Ibsen-jensen, A. Pavlogiannis, and P. Goyal, Faster algorithms for algebraic path properties in recursive state machines with constant treewidth, POPL 2015, pp.97-109, 2015.
DOI : 10.1145/2775051.2676979

M. Cygan, ?. Fedor-v-fomin, D. Kowalik, D. Lokshtanov, and . Marx, Marcin Pilipczuk, Micha? Pilipczuk, and Saket Saurabh. 2015. Parameterized algorithms

C. Ding and K. Kennedy, Improving cache performance in dynamic applications through data and computation reorganization at run time, PLDI 1999, pp.229-241, 1999.
DOI : 10.1145/301618.301670
URL : http://www.cs.umd.edu/class/spring1999/cmsc732/papers/irreg-pldi99.ps

W. Ding and M. Kandemir, CApRI: CAche-conscious data reordering for irregular codes, ACM SIGMETRICS Performance Evaluation Review, vol.42, pp.477-489, 2014.

D. Fedor-v-fomin, M. Lokshtanov, S. Pilipczuk, M. Saurabh, and . Wrochna, Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, SODA 2017. SIAM, pp.1419-1432, 2017.

J. Gustedt, J. A. Ole-a-maehle, and . Telle, The treewidth of Java programs, pp.86-97, 2002.
DOI : 10.1007/3-540-45643-0_7
URL : https://hal.archives-ouvertes.fr/inria-00072269

H. Han and C. Tseng, Exploiting locality for irregular scientific codes, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.606-618, 2006.

. Rahman-lavaee, The hardness of data packing, POPL 2016. ACM, pp.232-242, 2016.

K. Panagiotou and A. Souza, On adequate performance measures for paging, STOC 2006. ACM, pp.487-496, 2006.
DOI : 10.1145/1132516.1132587
URL : http://www.mpi-inf.mpg.de/%7Ekpanagio/Paging.pdf

E. Petrank and D. Rawitz, The hardness of cache conscious data placement, POPL 2002, pp.101-112, 2002.
DOI : 10.1145/565816.503283

N. Robertson and P. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, pp.49-64, 1984.
DOI : 10.1006/jctb.1999.1919
URL : https://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of algorithms, vol.7, pp.309-322, 1986.
DOI : 10.1006/jctb.1999.1919
URL : https://doi.org/10.1006/jctb.1999.1919

D. Daniel, R. E. Sleator, and . Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM, vol.28, pp.202-208, 1985.

O. Khalid and . Thabit, Cache management by the compiler, 1982.

M. Thorup, All structured programs have small tree width and good register allocation, Information and Computation, vol.142, pp.159-181, 1998.

. Thomas-van-dijk, Computing treewidth with LibTW, Pieter van den Heuvel, and Wouter Slob, 2006.

A. William, S. A. Wulf, and . Mckee, Hitting the memory wall: implications of the obvious, ACM SIGARCH computer architecture news, vol.23, pp.20-24, 1995.

C. Zhang, C. Ding, M. Ogihara, Y. Zhong, and Y. Wu, A hierarchical model of data locality, POPL 2006. ACM, pp.16-29, 2006.

Y. Zhong, M. Orlovich, X. Shen, and C. Ding, Array regrouping and structure splitting using whole-program reference affinity, PLDI, pp.255-266, 2004.