research
∙
01/19/2021
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
An upper dominating set is a minimal dominating set in a graph. In the U...
share
research
∙
11/20/2019
New Algorithms for Mixed Dominating Set
A mixed dominating set is a collection of vertices and edges that domina...
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...
research
∙
09/18/2019
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
The paper presents a polynomial time approximation schema for the edge-w...
research
∙
02/05/2019
Average-case complexity of a branch-and-bound algorithm for min dominating set
The average-case complexity of a branch-and-bound algorithms for Minimum...
research
∙
09/07/2017