23 citations · 60 across the 50 of their papers we have counts for
9 papers · 1 filter
Target set selection with maximum activation time
Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia +2
A target set selection model is a graph with a threshold function upper-bounded by the vertex degree. For a given model, a set is a targ…
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…
A Unifying Model for Locally Constrained Spanning Tree Problems
Luiz Alberto do Carmo Viana, Manoel Campêlo, Ignasi Sau +1
Given a graph and a digraph whose vertices are the edges of , we investigate the problem of finding a spanning tree of that satisfies the constraints imposed by .…
Reducing graph transversals via edge contractions
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +1
For a graph invariant , the Contraction() problem consists in, given a graph and two positive integers , deciding whether one can contract at most edges of t…
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
We study the kernelization complexity of structural parameterizations of the Vertex Cover problem. Here, the goal is to find a polynomial-time preprocessing algorithm that can redu…
k-apices of minor-closed graph classes. II. Parameterized algorithms
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Let be a minor-closed graph class. We say that a graph is a -apex of if contains a set of at most vertices such that belongs…