scientific article; zbMATH DE number 7525471
From MaRDI portal
Publication:5075772
DOI10.4230/LIPIcs.ESA.2019.34MaRDI QIDQ5075772
Marcin Pilipczuk, Wojciech Nadara, Wojciech Czerwiński
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space ⋮ Polynomial treedepth bounds in linear colorings ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. ⋮ On the Parameterized Complexity of Clique Elimination Distance
Cites Work
- Unnamed Item
- Forbidden graphs for tree-depth
- Sparsity. Graphs, structures, and algorithms
- On low tree-depth decompositions
- Tree-depth, subgraph coloring and homomorphism bounds
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- A Faster Parameterized Algorithm for Treedepth
- Towards Tight(er) Bounds for the Excluded Grid Theorem
This page was built for publication:
