Victor A. Campos

activity

20072023

most citedPolyhedral studies of vertex coloring problems: The asymmetric representatives formulation

3 citations · 6 across the 10 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Parameterized complexity of computing maximum minimal blocking and hitting sets

Júlio Araújo, Marin Bougeret, Victor A. Campos +1

A blocking set in a graph $G$ is a subset of vertices that intersects every maximum independent set of $G$ . Let $mmbs (G)$ be the size of a maximum (inclusion-wise) minimal bl…

cs.DS2021

Introducing lop-kernels: a framework for kernelization lower bounds

Júlio Araújo, Marin Bougeret, Victor A. Campos +1

In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph $G$ and a positive integer $k$ , and the objective is to decide whether $G$ contains a minimal vertex cover…