International audienceWe give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...
International audienceWe study the existence of polynomial kernels, for parameterized problems witho...
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with th...
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs ...
Abstract In the DOMINATING SET problem we are given an n-vertex graph G with a positive integer k an...
We provide polynomial time data reduction rules for Connected Dominating Set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
The search for linear kernels for the Dominating Set problem on classes of graphs of a topological n...
AbstractWe provide polynomial time data reduction rules for Connected Dominating Set on planar graph...
Abstract. The domination number of a graph G = (V,E) is the mini-mum size of a dominating set U ⊆ V,...
Abstract. A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V ...
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ suchthat every vertex in $V$...
We show that the \nounk-Dominating Set} problem is fixed parameter tractable (FPT) and has a polynom...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...
International audienceWe study the existence of polynomial kernels, for parameterized problems witho...
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with th...
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs ...
Abstract In the DOMINATING SET problem we are given an n-vertex graph G with a positive integer k an...
We provide polynomial time data reduction rules for Connected Dominating Set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set on planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
The search for linear kernels for the Dominating Set problem on classes of graphs of a topological n...
AbstractWe provide polynomial time data reduction rules for Connected Dominating Set on planar graph...
Abstract. The domination number of a graph G = (V,E) is the mini-mum size of a dominating set U ⊆ V,...
Abstract. A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V ...
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ suchthat every vertex in $V$...
We show that the \nounk-Dominating Set} problem is fixed parameter tractable (FPT) and has a polynom...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, an...
International audienceWe study the existence of polynomial kernels, for parameterized problems witho...
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with th...
DOI
Add to ORKG