scientific article; zbMATH DE number 7764102
From MaRDI portal
Publication:6089655
Cites work
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- (Meta) kernelization
- Bidimensionality and kernels
- Characterising bounded expansion by neighbourhood complexity
- Colouring graphs with bounded generalized colouring number
- Constant-factor approximation of the domination number in sparse graphs
- Grad and classes with bounded expansion. I: Decompositions
- Kernelization and Sparseness: the case of Dominating Set
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- Kernels for (connected) dominating set on graphs with excluded topological minors
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Polynomial-time data reduction for dominating set
- Sparsity. Graphs, structures, and algorithms
- The generalised colouring numbers on classes of bounded expansion
- \(k\)-domination and \(k\)-independence in graphs: A survey
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)
