scientific article; zbMATH DE number 7764102
From MaRDI portal
Publication:6089655
DOI10.4230/lipics.ipec.2020.11arXiv2002.09028MaRDI QIDQ6089655
Publication date: 13 November 2023
Full work available at URL: https://arxiv.org/abs/2002.09028
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Sparsity. Graphs, structures, and algorithms
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Colouring graphs with bounded generalized colouring number
- Characterising bounded expansion by neighbourhood complexity
- Constant-factor approximation of the domination number in sparse graphs
- Grad and classes with bounded expansion. I: Decompositions
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- (Meta) Kernelization
- Polynomial-time data reduction for dominating set
- 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
- Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
- Kernelization and Sparseness: the case of Dominating Set
- The Generalised Colouring Numbers on Classes of Bounded Expansion
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
- On distance ‐dominating and ‐independent sets in sparse graphs
- Bidimensionality and Geometric Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication:
