Complexity of Finding Embeddings in a k-Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987. ,
Metric Dimension of Bounded Tree-length Graphs, SIAM Journal on Discrete Mathematics, vol.31, issue.2, pp.1217-1243, 2017. ,
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015. ,
A $c^k n$ 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016. ,
(Meta) Kernelization, Journal of the ACM, vol.63, issue.5, pp.1-69, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01483628
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs, Journal of Algorithms, vol.21, issue.2, pp.358-402, 1996. ,
To Approximate Treewidth, Use Treelength!, SIAM Journal on Discrete Mathematics, vol.30, issue.3, pp.1424-1436, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01348965
Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, vol.109, issue.1-2, pp.49-82, 1993. ,
Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015. ,
The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2007. ,
On the Tree-Width of Planar Graphs, Electronic Notes in Discrete Mathematics, vol.34, pp.593-596, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00408481
Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017. ,
Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00307800
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs, Algorithmica, vol.69, issue.4, pp.884-905, 2013. ,
On the Complexity of Computing Treebreadth, Algorithmica, vol.82, issue.6, pp.1574-1600, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02528905
Parallel recognition of series-parallel graphs, Information and Computation, vol.98, issue.1, pp.41-55, 1992. ,
Improved Approximation Algorithms for Minimum Weight Vertex Separators, SIAM Journal on Computing, vol.38, issue.2, pp.629-657, 2008. ,
S-functions for graphs, Journal of Geometry, vol.8, issue.1-2, pp.171-186, 1976. ,
Approximate tree decompositions of planar graphs in linear time, Theoretical Computer Science, vol.645, pp.60-90, 2016. ,
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth, Algorithmica, vol.72, issue.3, pp.758-777, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00671861
Algorithms on negatively curved spaces, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.119-132, 2006. ,
On the complexity of computing treelength, Discrete Applied Mathematics, vol.158, issue.7, pp.820-827, 2010. ,
Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986. ,
Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994. ,
The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982. ,