research
∙
06/30/2023
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments
In this paper we investigate the existence of subexponential parameteriz...
share
research
∙
07/14/2022
Kernelization for Graph Packing Problems via Rainbow Matching
We introduce a new kernelization tool, called rainbow matching technique...
research
∙
06/16/2022
Approximating optimization problems in graphs with locational uncertainty
Many combinatorial optimization problems can be formulated as the search...
research
∙
09/01/2021
Optimization problems in graphs with locational uncertainty
Many discrete optimization problems amount to select a feasible subgraph...
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...
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/27/2020
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
We study the kernelization complexity of structural parameterizations of...
research
∙
10/04/2019
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
A knot in a directed graph G is a strongly connected subgraph Q of G wit...
research
∙
05/21/2019
Approximation results for makespan minimization with budgeted uncertainty
We study approximation algorithms for the problem of minimizing the make...
research
∙
02/19/2018