Faster parameterized algorithms for minor containment, Theoretical Computer Science, vol.412, issue.50, pp.7018-7028, 2011. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00736522
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. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02991215
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
Hitting minors on bounded treewidth graphs. III. Lower bounds, Journal of Computer and System Sciences, vol.109, pp.56-77, 2020. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02989938
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
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. ,
Graph modification problems (dagstuhl seminar 14071), Dagstuhl Reports, vol.4, issue.2, pp.38-59, 2014. ,
Linear-Time Algorithms for Eliminating Claws in Graphs, Lecture Notes in Computer Science, pp.14-26, 2020. ,
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
A survey of parameterized algorithms and the complexity of edge modification, 2013. ,
Parameterized Algorithms, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015. ,
Hitting forbidden subgraphs in graphs of bounded treewidth, Information and Computation, vol.256, pp.62-82, 2017. ,
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. ,
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions, Algorithmica, vol.58, issue.3, pp.790-810, 2009. ,
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
Efficient computation of representative families with applications in parameterized and exact algorithms, Journal of the ACM, vol.63, issue.4, pp.1-29, 2016. ,
Graph modification problems: A modern perspective, Proc. of the 9th International Frontiers in Algorithmics Workshop (FAW), vol.9130, pp.3-6, 2015. ,
On the Complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001. ,
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, Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1802-1811, 2014. ,
, Treewidth, Ton Kloks. Treewidth. Computations and Approximations, vol.82, p.15, 1994.
The node-deletion problem for hereditary properties is NP-complete, Journal of Computer and System Sciences, vol.20, issue.2, pp.219-230, 1980. ,
Lower bounds based on the Exponential Time Hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011. ,
A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics, vol.231, pp.211-216, 2017. ,
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach, Mathematical Foundations of Computer Science 2011, vol.6907, pp.520-531, 2011. ,
Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms, vol.10, issue.2, pp.1-26, 2014. ,