research
∙
02/05/2021
Parameterized complexity of computing maximum minimal blocking and hitting sets
A blocking set in a graph G is a subset of vertices that intersects ever...
share
research
∙
02/04/2021
Kernelization of Maximum Minimal Vertex Cover
In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph...
research
∙
04/23/2020
Coloring Problems on Bipartite Graphs of Small Diameter
We investigate a number of coloring problems restricted to bipartite gra...
research
∙
05/17/2018
