Linked tree-decompositions of represented infinite matroids, Journal of Combinatorial Theory, Series B, vol.101, issue.3, pp.123-140, 2011. ,
Two short proofs concerning tree-decompositions, Combinatorics, Probability and Computing, vol.11, issue.6, pp.541-547, 2002. ,
A (c k n) 5-Approximation Algorithm for Treewidth, SIAM Journal of Computing, vol.45, issue.2, pp.317-378, 2016. ,
, Meta) kernelization. Journal of the ACM, vol.63, issue.5, p.44, 2016.
Cutwidth approximation in linear time, Proceedings of the Second Great Lakes Symposium on VLSI, pp.70-73, 1992. ,
k-Blocks: A Connectivity Invariant for Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1876-1891, 2014. ,
An O(log OP T )-approximation for covering and packing minor models of ?r. Algorithmica, 2017. ,
Minors in graphs of large ?r-girth, European Journal of Combinatorics, vol.65, pp.106-121, 2017. ,
A unified treatment of linked and lean tree-decompositions, Journal of Combinatorial Theory, Series B, vol.130, pp.114-143, 2018. ,
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, Proceedings of FOCS 2012, pp.470-479, 2012. ,
Algorithmic applications of tree-cut width, Mathematical foundations of computer science 2015. Part II, vol.9235, pp.348-360, 2015. ,
Branch-width and well-quasi-ordering in matroids and graphs, Journal of Combinatorial Theory, Series B, vol.84, issue.2, pp.270-290, 2002. ,
A generalization of the Grid Theorem, 2016. ,
, Lean tree-cut decompositions: obstructions and algorithms, 2018.
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, 44th International Colloquium on Automata, Languages, and Programming, vol.57, p.15, 2017. ,
Cutwidth: Obstructions and Algorithmic Aspects, Algorithmica, 2018. ,
A weak immersion relation on graphs and its applications, Discrete Mathematics, vol.230, issue.1-3, pp.189-206, 2001. ,
Finding Topological Subgraphs is Fixed-parameter Tractable, Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC '11, pp.479-488, 2011. ,
Ein Neuer Beweis Eines Mengerschen Satzes, Journal of the London Mathematical Society, issue.3, pp.188-192, 1938. ,
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR, abs/1412, vol.6201, 2014. ,
An FPT 2-Approximation for Tree-Cut Decomposition, Algorithmica, vol.80, issue.1, pp.116-135, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01690385
Tournament minors, Journal of Combinatorial Theory, Series B, vol.112, pp.138-153, 2015. ,
Directed Minors III. Directed Linked Decompositions. CoRR, 2014. ,
Upper Bounds on the Size of Obstructions and Intertwines, Journal of Combinatorial Theory, Series B, vol.73, issue.1, pp.7-40, 1998. ,
Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.1, issue.10, pp.96-115, 1927. ,
Rank-width and vertex-minors, Journal of Combinatorial Theory, Series B, vol.95, issue.1, pp.79-100, 2005. ,
Graph Minors. XXIII. Nash-Williams' Immersion Conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.2, pp.181-205, 2010. ,
Graph Minors. II. Algorithmic Aspects of Tree-Width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986. ,
Graph Minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.92-114, 1986. ,
Graph Minors. XIII. The disjoint paths problem, Journal of combinatorial theory, Series B, vol.63, issue.1, pp.65-110, 1995. ,
A menger-like property of tree-width: The finite case, Journal of Combinatorial Theory, Series B, vol.48, issue.1, pp.67-76, 1990. ,
The structure of graphs not admitting a fixed immersion, Journal of Combinatorial Theory, Series B, vol.110, pp.47-66, 2015. ,