
Optimization problems in graphs with locational uncertainty
Many discrete optimization problems amount to select a feasible subgraph...
read it

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...
read it

Kernelization of Maximum Minimal Vertex Cover
In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph...
read it

BridgeDepth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
We study the kernelization complexity of structural parameterizations of...
read it

Width Parameterizations for Knotfree Vertex Deletion on Digraphs
A knot in a directed graph G is a strongly connected subgraph Q of G wit...
read it

Approximation results for makespan minimization with budgeted uncertainty
We study approximation algorithms for the problem of minimizing the make...
read it

(Arcdisjoint) cycle packing in tournament: classical and parameterized complexity
Given a tournament T, the problem MaxCT consists of finding a maximum (a...
read it
Marin Bougeret
is this you? claim profile