scientific article; zbMATH DE number 7764102
From MaRDI portal
Publication:6089655
DOI10.4230/LIPICS.IPEC.2020.11arXiv2002.09028MaRDI QIDQ6089655FDOQ6089655
Authors: Carl Einarson, Felix Reidl 
Publication date: 13 November 2023
Full work available at URL: https://arxiv.org/abs/2002.09028
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Grad and classes with bounded expansion. I: Decompositions
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Bidimensionality and kernels
- Sparsity. Graphs, structures, and algorithms
- Polynomial-time data reduction for dominating set
- Title not available (Why is that?)
- Kernelization and Sparseness: the case of Dominating Set
- Colouring graphs with bounded generalized colouring number
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- (Meta) kernelization
- The generalised colouring numbers on classes of bounded expansion
- Characterising bounded expansion by neighbourhood complexity
- Constant-factor approximation of the domination number in sparse graphs
- Kernels for (connected) dominating set on graphs with excluded topological minors
- On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- Polynomial kernels and wideness properties of nowhere dense graph classes
Cited In (2)
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 Q6089655)
