scientific article; zbMATH DE number 7525471
From MaRDI portal
Publication:5075772
DOI10.4230/LIPICS.ESA.2019.34MaRDI QIDQ5075772FDOQ5075772
Authors: Wojciech Czerwiński, Wojciech Nadara, Marcin Pilipczuk 
Publication date: 11 May 2022
Title of this publication is not available (Why is that?)
Cites Work
- Tree-depth, subgraph coloring and homomorphism bounds
- Sparsity. Graphs, structures, and algorithms
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Forbidden graphs for tree-depth
- On low tree-depth decompositions
- A Faster Parameterized Algorithm for Treedepth
- Towards Tight(er) Bounds for the Excluded Grid Theorem
- Title not available (Why is that?)
Cited In (5)
- Local tree-width, excluded minors, and approximation algorithms
- Polynomial treedepth bounds in linear colorings
- On the Parameterized Complexity of Clique Elimination Distance
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075772)
