A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996. ,
A partial k-arboretum of graphs with bounded treewidth, Theor. Comput. Sci, vol.209, issue.1-2, pp.1-45, 1998. ,
Kernelization, exponential lower bounds, Encyclopedia of Algorithms, pp.1013-1017, 2016. ,
Indian Corn Product, Scientific American, vol.31, issue.805supp, pp.12865-12865, 1891. ,
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
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree, Algorithmica, vol.75, issue.2, pp.363-382, 2015. ,
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming, Algorithms, vol.11, issue.7, p.98, 2018. ,
Parameterized Algorithms, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015. ,
On the Hardness of Losing Width, Theory of Computing Systems, vol.54, issue.1, pp.73-82, 2013. ,
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, Journal of the ACM, vol.61, issue.4, pp.1-27, 2014. ,
Extremal Graph Theory, Graph Theory, pp.169-201, 2005. ,
Parameterized Approximation, Texts in Computer Science, pp.623-644, 2013. ,
What Is Known About Vertex Cover Kernelization?, Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, vol.11011, pp.330-356, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02359026
Parameterized Complexity Theory, 2006. ,
Hitting forbidden minors: Approximation and kernelization, SIAM J. Discrete Math, vol.30, issue.1, pp.383-410, 2016. ,
Kernelization: Theory of Parameterized Preprocessing, 2019. ,
Vertex cover structural parameterization revisited, Proc. 42nd WG, vol.9941, pp.171-182, 2016. ,
Smaller parameters for vertex cover kernelization, Proc. 12th IPEC, vol.89, 2017. ,
Elimination distances, blocking sets, and kernels for vertex cover, Proc. 37nd STACS, vol.154, pp.1-36, 2020. ,
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
Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973. ,
Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter, Proc. 28th STACS, vol.9, pp.177-188, 2011. ,
Vertex cover kernelization revisited -upper and lower bounds for a refined parameter, Theory Comput. Syst, vol.53, issue.2, pp.263-299, 2013. ,
Polynomial kernels for hitting forbidden minors under structural parameterizations, Proc. 26th ESA, vol.112, 2018. ,
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, SIAM Journal on Discrete Mathematics, vol.32, issue.3, pp.1806-1839, 2018. ,
Representative Sets and Irrelevant Vertices: New Tools for Kernelization, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.450-459, 2012. ,
Kernelization ? Preprocessing with a Guarantee, The Multivariate Algorithmic Revolution and Beyond, pp.129-161, 2012. ,
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators, Theory of Computing Systems, vol.62, issue.8, pp.1910-1951, 2018. ,
Vertex packings: structural properties and algorithms, Math. Program, vol.8, pp.232-248, 1975. ,
Sparsity -Graphs, Structures, and Algorithms, Algorithms and combinatorics, vol.28, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00768681
Tree-depth, subgraph coloring and homomorphism bounds, Eur. J. Comb, vol.27, issue.6, pp.1022-1041, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00023821
Invitation to Fixed-Parameter Algorithms, 2006. ,
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, ACM Transactions on Computation Theory, vol.9, issue.4, pp.1-36, 2018. ,
The Erd?s-Pósa Property for Odd Cycles in Highly Connected Graphs, Combinatorica, vol.21, issue.2, pp.267-278, 2001. ,
Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986. ,
Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004. ,
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, Proc. 30th SODA, pp.1485-1500, 2019. ,