research
∙
10/12/2019
Improved (In-)Approximability Bounds for d-Scattered Set
In the d-Scattered Set problem we are asked to select at least k vertice...
share
research
∙
02/13/2019
New Results on Directed Edge Dominating Set
We study a family of generalizations of Edge Dominating Set on directed ...
research
∙
01/27/2019
Parameterized Complexity of Safe Set
In this paper we study the problem of finding a small safe set S in a gr...
research
∙
07/30/2018
Parameterized Orientable Deletion
A graph is d-orientable if its edges can be oriented so that the maximum...
research
∙
09/07/2017