T. Ollmann, On the book thicknesses of various graphs, Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, vol.VIII, p.459, 1973.

P. Kainen, Some recent results in topological graph theory, vol.406, pp.76-108, 1974.

F. Bernhart and P. C. Kainen, The book thickness of a graph, J. Comb. Theory, Ser. B, vol.27, issue.3, pp.320-331, 1979.

M. Yannakakis, Embedding planar graphs in four pages, J. Comput. Syst. Sci, vol.38, issue.1, pp.36-67, 1989.

V. Dujmovic and D. R. Wood, Graph treewidth and geometric thickness parameters, Discrete & Computational Geometry, vol.37, issue.4, pp.641-670, 2007.

H. L. Bodlaender, A partial k -arboretum of graphs with bounded treewidth, Theor. Comput. Sci, vol.209, issue.1-2, pp.1-45, 1998.

H. L. Bodlaender, Discovering treewidth, SOFSEM, vol.3381, pp.1-16, 2005.

B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: Handbook of Graph Grammars, pp.313-400, 1997.

D. Bienstock and C. L. Monma, On the complexity of embedding planar graphs to minimize certain distance measures, Algorithmica, vol.5, issue.1, pp.93-109, 1990.

N. Robertson and P. D. Seymour, Graph minors. II. algorithmic aspects of tree-width, J. Algorithms, vol.7, issue.3, pp.309-322, 1986.

J. Böttcher, K. P. Pruessmann, A. Taraz, and A. Würfl, Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Eur. J. Comb, vol.31, issue.5, pp.1217-1227, 2010.

Z. Galil, R. Kannan, and E. Szemerédi, On 3-pushdown graphs with large separators, Combinatorica, vol.9, issue.1, pp.9-19, 1989.

Z. Galil, R. Kannan, and E. Szemerédi, On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines, J. Comput. Syst. Sci, vol.38, issue.1, pp.134-149, 1989.

R. Santhanam, On separators, segregators and time versus space, IEEE Conference on Computational Complexity, pp.286-294, 2001.

Z. Dvir and A. Wigderson, Monotone expanders: Constructions and applications, Theory of Computing, vol.6, pp.291-308, 2010.

S. Qadeer and J. Rehof, Context-bounded model checking of concurrent software, Lecture Notes in Computer Science, vol.3440, pp.93-107, 2005.

M. F. Atig, B. Bollig, and P. Habermehl, Emptiness of ordered multi-pushdown automata is 2etime-complete, Int. J. Found. Comput. Sci, vol.28, issue.8, pp.945-976, 2017.

L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi-reghizzi, Multi-push-down languages and grammars, Int. J. Found. Comput. Sci, vol.7, issue.3, pp.253-292, 1996.

S. L. Torre, P. Madhusudan, and G. Parlato, A robust class of context-sensitive languages, LICS, pp.161-170, 2007.

S. L. Torre and M. Napoli, Reachability of multistack pushdown systems with scopebounded matching relations, CONCUR, vol.6901, pp.203-218, 2011.

A. Cyriac, P. Gastin, and K. N. Kumar, MSO decidability of multi-pushdown systems via split-width, CONCUR, vol.7454, pp.547-561, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776596

S. Akshay, P. Gastin, and S. N. Krishna, Analyzing timed systems using tree automata, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, vol.59, p.14, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01407942

R. Alur and P. Madhusudan, Adding nesting structure to words, J. ACM, vol.56, issue.3, p.43, 2009.

P. Madhusudan and G. Parlato, The tree width of auxiliary storage, pp.283-294, 2011.

K. H. Rosen, Handbook of Discrete and Combinatorial Mathematics, 2010.

H. Enomoto and M. S. Miyauchi, Embedding graphs into a three page book with O(m log n) crossings of edges over the spine, SIAM J. Discrete Math, vol.12, issue.3, pp.337-341, 1999.