Treewidth of treewidth-bounded graphs, Treewidth, pp.173-183 ,
The role of planarity in connectivity problems parameterized by treewidth, Theoretical Computer Science, vol.570, pp.1-14, 2015. ,
URL : https://hal.archives-ouvertes.fr/dumas-00854884
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02989938
The Role of Planarity in Connectivity Problems Parameterized by Treewidth, Parameterized and Exact Computation, vol.115, pp.63-74, 2014. ,
URL : https://hal.archives-ouvertes.fr/dumas-00854884
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds, SIAM Journal on Discrete Mathematics, vol.34, issue.3, pp.1623-1648, 2020. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02989938
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02989938
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.951-970, 2020. ,
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015. ,
On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009. ,
Graph Theory, Graph Theory. Graduate Texts in Mathematics, 2008. ,
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms, Algorithmica, vol.81, issue.10, pp.3890-3935, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01994406
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?, Algorithmica, vol.81, issue.10, pp.4043-4068, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01730228
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-00353765
Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015. ,
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.150-159, 2011. ,
Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017. ,
Parameterized Approximation, Texts in Computer Science, pp.623-644, 2013. ,
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms, Journal of the ACM, vol.63, issue.4, pp.1-60, 2016. ,
Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973. ,
Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001. ,
A Near-Optimal Planarization Algorithm, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1802-1811, 2013. ,
Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982. ,
Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011. ,
Slightly Superexponential Parameterized Problems, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.760-776, 2011. ,
A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics, vol.231, pp.211-216, 2017. ,
On the vertex cover $$P_3$$ P 3 problem parameterized by treewidth, Journal of Combinatorial Optimization, vol.34, issue.2, pp.414-425, 2016. ,
Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, pp.253-264, 1978. ,