4 citations · 7 across the 8 of their papers we have counts for
13 papers
Minimum Separator Reconfiguration
Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud +4
We study the problem of reconfiguring one minimum --separator into another minimum --separator in some -vertex graph containing two non-adjacent vertices…
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 $\…
Disconnected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational comple…
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…
Parameterized algorithms for locating-dominating sets
Márcia R. Cappelle, Guilherme C. M. Gomes, Vinicius F. dos Santos
A locating-dominating set of a graph is a dominating set of where each vertex not in has a unique neighborhood in , and the Locating-Dominating Set problem asks…
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/…
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
Guilherme C. M. Gomes, Ignasi Sau
A matching cut is a partition of the vertex set of a graph into two sets and such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT p…
Community detection over a heterogeneous population of non-aligned networks
Guilherme Gomes, Vinayak Rao, Jennifer Neville
Clustering and community detection with multiple graphs have typically focused on aligned graphs, where there is a mapping between nodes across the graphs (e.g., multi-view, multi-…
Multi-level hypothesis testing for populations of heterogeneous networks
Guilherme Gomes, Vinayak Rao, Jennifer Neville
In this work, we consider hypothesis testing and anomaly detection on datasets where each observation is a weighted network. Examples of such data include brain connectivity networ…
Is Learning to Rank Worth It? A Statistical Analysis of Learning to Rank Methods
Guilherme de Castro Mendes Gomes, Vitor Campos de Oliveira, Jussara Marques de Almeida +1
The Learning to Rank (L2R) research field has experienced a fast paced growth over the last few years, with a wide variety of benchmark datasets and baselines available for experim…