scientific article; zbMATH DE number 6678911

DOI10.4230/LIPICS.STACS.2013.92MaRDI QIDQ2957874zbMATH OpenFDO

Authors Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos

Publication date 30 January 2017

Full work available at URL https://arxiv.org/abs/1210.0257

zbMATH Keywords

algorithmic graph minorsconnected dominating setdominating setkernelizationparameterized complexity

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph minors (05C83) Analysis of algorithms and problem complexity (68Q25)

Cited in

(14)

• Characterising bounded expansion by neighbourhood complexity
• On complexities of minus domination
• On kernelization and approximation for the vector connectivity problem
• On complexities of minus domination
• Lossy kernels for connected dominating set on sparse graphs
• Linear Kernel for Planar Connected Dominating Set
• Algorithmic properties of sparse digraphs
• Domination above \(r\)-independence: does sparseness help?
• Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
• A linear kernel for planar red-blue dominating set
• Lossy kernels for connected dominating set on sparse graphs
• Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
• Parameterized complexity of (d, r)-domination via modular decomposition
• Dominating set with quotas: balancing coverage and constraints

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 Q2957874)