The Structure of W 4 -Immersion-Free Graphs. ArXiv e-prints 1602, p.2002, 2016. ,
A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996. ,
Fast Algorithms forK4Immersion Testing, Journal of Algorithms, vol.30, issue.2, pp.344-378, 1999. ,
DOI : 10.1006/jagm.1998.0991
An O(log OPT)-approximation for covering/packing minor models of ? r . Algorithmica, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01481784
Designing FPT Algorithms for Cut Problems Using Randomized Contractions, SIAM Journal on Computing, vol.45, issue.4, pp.1171-1229, 2016. ,
DOI : 10.1137/15M1032077
URL : http://arxiv.org/pdf/1207.4079
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990. ,
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765
Marcin Pilipczuk, Micha? Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015. ,
A minimum degree condition forcing complete graph immersion, Combinatorica, vol.36, issue.3, pp.279-298, 2014. ,
DOI : 10.1112/jlms/s1-36.1.221
URL : http://arxiv.org/pdf/1101.2630
A Structure Theorem for Strong Immersions, Journal of Graph Theory, vol.110, issue.1, pp.152-163, 2016. ,
DOI : 10.1016/j.jctb.2014.07.003
Complete graph immersions and minimum degree. ArXiv e-prints 1512.00513, 2015. ,
Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, 2006. ,
Planar F- Deletion: Approximation and optimal FPT algorithms. ArXiv e-prints 1204, 2012. ,
Planar Fdeletion: Approximation, kernelization and optimal FPT algorithms, Proceedings of FOCS 2012, pp.470-479, 2012. ,
Bidimensionality and kernels, Proceedings of SODA 2010, pp.503-510, 2010. ,
Algorithmic Applications of Tree-Cut Width, Proceedings of MFCS 2015, pp.348-360, 2015. ,
DOI : 10.1007/978-3-662-48054-0_29
Uniform kernelization complexity of hitting forbidden minors, ACM Trans. Algorithms, vol.1335, issue.3, pp.1-35, 2017. ,
Packing and covering immersion models of planar subcubic graphs, Proceedings of WG 2016, pp.74-84, 2016. ,
Linear kernels for edge deletion problems to immersion-closed graph classes. ArXiv e-prints 1609.07780 URL: https, 2016. ,
Effective computation of immersion obstructions for unions of graph classes, J. Comput. Syst. Sci, vol.80, issue.1, pp.207-216, 2014. ,
A weak immersion relation on graphs and its applications, Discrete Mathematics, vol.230, issue.1-3, pp.189-206, 2001. ,
DOI : 10.1016/S0012-365X(00)00080-7
URL : http://doi.org/10.1016/s0012-365x(00)00080-7
Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.479-488, 2011. ,
DOI : 10.1145/1993636.1993700
URL : http://arxiv.org/abs/1011.1827
On an edge ranking problem of trees and graphs, Discrete Appl. Math, vol.30, issue.1, pp.43-52, 1991. ,
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions, Proceedings of ICALP 2013, pp.613-624, 2013. ,
DOI : 10.1007/978-3-642-39206-1_52
URL : https://hal.archives-ouvertes.fr/lirmm-00829999
An FPT 2-approximation for tree-cut decomposition, Algorithmica, pp.1-20, 2016. ,
DOI : 10.1007/s00453-016-0245-5
URL : https://hal.archives-ouvertes.fr/lirmm-01225569
Edge ranking of graphs is hard, Discrete Applied Mathematics, vol.85, issue.1, pp.71-86, 1998. ,
DOI : 10.1016/S0166-218X(98)00029-8
Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006. ,
DOI : 10.1016/j.tcs.2005.10.007
URL : http://doi.org/10.1016/j.tcs.2005.10.007
Immersions in Highly Edge Connected Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.503-520, 2014. ,
DOI : 10.1137/130924056
URL : http://arxiv.org/pdf/1305.1331
Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications, 2006. ,
Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995. ,
DOI : 10.1006/jctb.1995.1006
Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986. ,
DOI : 10.1016/0095-8956(86)90030-4
Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004. ,
DOI : 10.1016/j.jctb.2004.08.001
Graph minors XXIII. Nash-Williams' immersion conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.2, pp.181-205, 2010. ,
DOI : 10.1016/j.jctb.2009.07.003
Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994. ,
Cutwidth I: A linear time fixed parameter algorithm, Journal of Algorithms, vol.56, issue.1, pp.1-24, 2005. ,
DOI : 10.1016/j.jalgor.2004.12.001
The structure of graphs not admitting a fixed immersion, Journal of Combinatorial Theory, Series B, vol.110, pp.47-66, 2015. ,
DOI : 10.1016/j.jctb.2014.07.003