3 citations · 6 across the 10 of their papers we have counts for
15 papers
New Menger-like dualities in digraphs and applications to half-integral linkages
Victor Campos, Jonas Costa, Raul Lopes +1
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to…
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 is a subset of vertices that intersects every maximum independent set of . Let be the size of a maximum (inclusion-wise) minimal bl…
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 and a positive integer , and the objective is to decide whether contains a minimal vertex cover…
Cycle convexity and the tunnel number of links
Júlio Araújo, Victor Campos, Darlan Girão +3
In this work, we introduce a new graph convexity, that we call Cycle Convexity, motivated by related notions in Knot Theory. For a graph , define the interval function in…
Adapting the Directed Grid Theorem into an FPT Algorithm
Victor Campos, Raul Lopes, Ana Karolinna Maia +1
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of a…
Coloring Problems on Bipartite Graphs of Small Diameter
Victor A. Campos, Guilherme C. M. Gomes, Allen Ibiapina +3
We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the -List Coloring, List -Coloring, and -Precolori…