Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991. ,
Blockers for the Stability Number and the Chromatic Number, Graphs and Combinatorics, vol.31, issue.1, pp.73-90, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01126259
The most vital nodes with respect to independent set and vertex cover, Discrete Applied Mathematics, vol.159, issue.17, pp.1933-1946, 2011. ,
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid, Discrete Mathematics, vol.310, pp.132-146, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00974959
Graph modification problems (dagstuhl seminar 14071), Dagstuhl Reports, vol.4, issue.2, pp.38-59, 2014. ,
Hadwiger's Conjecture is True for Almost Every Graph, European Journal of Combinatorics, vol.1, issue.3, pp.195-199, 1980. ,
Transversals of longest paths, Discrete Mathematics, vol.343, issue.3, p.111717, 2020. ,
Intersection of longest paths in graph classes, Discrete Applied Mathematics, 2019. ,
Nonempty intersection of longest paths in series?parallel graphs, Discrete Mathematics, vol.340, issue.3, pp.287-304, 2017. ,
Minimum d-blockers and d-transversals in graphs, Journal of Combinatorial Optimization, vol.22, issue.4, pp.857-872, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00973849
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, p.2020 ,
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. ,
Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017. ,
Contraction and deletion blockers for perfect graphs and H-free graphs, Theoretical Computer Science, vol.746, pp.49-72, 2018. ,
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, Journal of Discrete Algorithms, vol.8, issue.1, pp.36-49, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00178912
Computation of hadwiger number and related contraction problems: Tight lower bounds, p.2020 ,
Graph modification problems: A modern perspective, Proc. of the 9th International Frontiers in Algorithmics Workshop (FAW), vol.9130, pp.3-6, 2015. ,
Blocking dominating sets for H-free graphs via edge contractions, Proc. of the 30th International Symposium on Algorithms and Computation, vol.149, pp.1-24, 2019. ,
Reducing the domination number of graphs via edge contractions, Proc. of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 138 of LIPIcs, vol.41, pp.1-41, 2019. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Hadwiger Number of Graphs with Small Chordality, SIAM Journal on Discrete Mathematics, vol.29, issue.3, pp.1427-1451, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01178217
Contracting Graphs to Paths and Trees, Algorithmica, vol.68, issue.1, pp.109-132, 2012. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01076841
Obtaining a Bipartite Graph by Contracting Few Edges, SIAM Journal on Discrete Mathematics, vol.27, issue.4, pp.2143-2156, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01178184
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. ,
Lossy kernels for graph contraction problems, Proc. of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 65 of LIPIcs, vol.23, pp.1-23, 2016. ,
The node-deletion problem for hereditary properties is NP-complete, Journal of Computer and System Sciences, vol.20, issue.2, pp.219-230, 1980. ,
Minimum vertex blocker clique problem, Networks, vol.64, issue.1, pp.48-64, 2014. ,
Critical vertices and edges inH-free graphs, Discrete Applied Mathematics, vol.257, pp.361-367, 2019. ,
Transversals of Longest Paths and Cycles, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.335-341, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00793271
Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986. ,
On the NP-hardness of edge-deletion and -contraction problems, Discrete Applied Mathematics, vol.6, issue.1, pp.63-78, 1983. ,
Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, pp.253-264, 1978. ,