On the book thicknesses of various graphs, Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, vol.VIII, p.459, 1973. ,
, Some recent results in topological graph theory, vol.406, pp.76-108, 1974.
The book thickness of a graph, J. Comb. Theory, Ser. B, vol.27, issue.3, pp.320-331, 1979. ,
Embedding planar graphs in four pages, J. Comput. Syst. Sci, vol.38, issue.1, pp.36-67, 1989. ,
Graph treewidth and geometric thickness parameters, Discrete & Computational Geometry, vol.37, issue.4, pp.641-670, 2007. ,
A partial k -arboretum of graphs with bounded treewidth, Theor. Comput. Sci, vol.209, issue.1-2, pp.1-45, 1998. ,
Discovering treewidth, SOFSEM, vol.3381, pp.1-16, 2005. ,
The expression of graph properties and graph transformations in monadic second-order logic, in: Handbook of Graph Grammars, pp.313-400, 1997. ,
On the complexity of embedding planar graphs to minimize certain distance measures, Algorithmica, vol.5, issue.1, pp.93-109, 1990. ,
Graph minors. II. algorithmic aspects of tree-width, J. Algorithms, vol.7, issue.3, pp.309-322, 1986. ,
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Eur. J. Comb, vol.31, issue.5, pp.1217-1227, 2010. ,
On 3-pushdown graphs with large separators, Combinatorica, vol.9, issue.1, pp.9-19, 1989. ,
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. ,
On separators, segregators and time versus space, IEEE Conference on Computational Complexity, pp.286-294, 2001. ,
Monotone expanders: Constructions and applications, Theory of Computing, vol.6, pp.291-308, 2010. ,
Context-bounded model checking of concurrent software, Lecture Notes in Computer Science, vol.3440, pp.93-107, 2005. ,
Emptiness of ordered multi-pushdown automata is 2etime-complete, Int. J. Found. Comput. Sci, vol.28, issue.8, pp.945-976, 2017. ,
Multi-push-down languages and grammars, Int. J. Found. Comput. Sci, vol.7, issue.3, pp.253-292, 1996. ,
A robust class of context-sensitive languages, LICS, pp.161-170, 2007. ,
Reachability of multistack pushdown systems with scopebounded matching relations, CONCUR, vol.6901, pp.203-218, 2011. ,
MSO decidability of multi-pushdown systems via split-width, CONCUR, vol.7454, pp.547-561, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00776596
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
Adding nesting structure to words, J. ACM, vol.56, issue.3, p.43, 2009. ,
The tree width of auxiliary storage, pp.283-294, 2011. ,
, Handbook of Discrete and Combinatorial Mathematics, 2010.
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. ,