research
∙
04/30/2023
The iteration time and the general position number in graph convexities
In this paper, we study two graph convexity parameters: iteration time a...
share
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
∙
12/10/2020
Cycle convexity and the tunnel number of links
In this work, we introduce a new graph convexity, that we call Cycle Con...
research
∙
11/30/2020
On the proper orientation number of chordal graphs
An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
∙
05/17/2018
Dual parameterization of Weighted Coloring
Given a graph G, a proper k-coloring of G is a partition c = (S_i)_i∈ [1...
research
∙
04/11/2018
