23 citations · 60 across the 50 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
A Linear Kernel for Planar Red-Blue Dominating Set
Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
In the Red-Blue Dominating Set problem, we are given a bipartite graph and an integer , and asked whether has a subset of at most $k…
cs.DS2014
Improved FPT algorithms for weighted independent set in bull-free graphs
Henri Perret du Cray, Ignasi Sau
Very recently, Thomassé, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution,…
cs.DS2014
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim +4
The Outerplanar Diameter Improvement problem asks, given a graph and an integer , whether it is possible to add edges to in a way that the resulting graph is outerplanar…