4 citations · 7 across the 6 of their papers we have counts for
10 papers
Weighted Connected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
A matching is a -matching if the subgraph induced by the endpoints of the edges of satisfies property . As examples, for appropriate choices of $\…
On structural parameterizations of the selective coloring problem
Guilherme C. M. Gomes, Vinicius F. dos Santos
In the Selective Coloring problem, we are given an integer , a graph , and a partition of into parts, and the goal is to decide whether or not we can pick exactly…
FPT and kernelization algorithms for the k-in-a-tree problem
Guilherme C. M. Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva +1
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the fir…
Some results on Vertex Separator Reconfiguration
Guilherme C. M. Gomes, Sérgio H. Nogueira, Vinicius F. dos Santos
We present the first results on the complexity of the reconfiguration of vertex separators under the three most popular rules: token addition/removal, token jumping, and token slid…
Intersection graph of maximal stars
Guilherme C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima +1
A biclique of a graph is an induced complete bipartite subgraph of such that neither part is empty. A star is a biclique of such that one part has exactly one vertex. T…
Structural Parameterizations for Equitable Coloring
Guilherme C. M. Gomes, Matheus R. Guedes, Vinicius F. dos Santos
An -vertex graph is equitably -colorable if there is a proper coloring of its vertices such that each color is used either or $\left\lceil n/…