Lean Tree-Cut Decompositions: Obstructions and Algorithms
From MaRDI portal
Publication:5090482
DOI10.4230/LIPICS.STACS.2019.32OpenAlexW2886403959MaRDI QIDQ5090482FDOQ5090482
Authors: Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos 
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/lipics.stacs.2019.32
Cites Work
- $k$-Blocks: A Connectivity Invariant for Graphs
- Graph minors. XIII: The disjoint paths problem
- Graph minors. V. Excluding a planar graph
- Graph minors. II. Algorithmic aspects of tree-width
- Rank-width and vertex-minors
- Minors in graphs of large \(\theta_r\)-girth
- The structure of graphs not admitting a fixed immersion
- Finding topological subgraphs is fixed-parameter tractable
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Branch-width and well-quasi-ordering in matroids and graphs.
- A \(c^k n\) 5-approximation algorithm for treewidth
- Tournament minors
- A weak immersion relation on graphs and its applications
- Title not available (Why is that?)
- A Menger-like property of tree-width: The finite case
- Upper bounds on the size of obstructions and intertwines
- Linked tree-decompositions of represented infinite matroids
- (Meta) Kernelization
- An FPT 2-approximation for tree-cut decomposition
- Algorithmic Applications of Tree-Cut Width
- Cutwidth: obstructions and algorithmic aspects
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- A unified treatment of linked and lean tree-decompositions
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Linear Rank-Width of Distance-Hereditary Graphs
Cited In (6)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Slim tree-cut width
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- On objects dual to tree-cut decompositions
This page was built for publication: Lean Tree-Cut Decompositions: Obstructions and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090482)
