10 citations · 10 across the 6 of their papers we have counts for
8 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…
Edge deletion to tree-like graph classes
Ivo Koch, Nina Pardal, Vinicius Fernandes dos Santos
For a fixed property (graph class) , given a graph G and an integer k, the -deletion problem consists in deciding if we can turn into a graph with the property by del…
On the arboreal jump number of a poset
Evellyn S. Cavalcante, Sebastián Urrutia, Vinicius F. dos Santos
A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find a…
On the Computational Complexity of the Strong Geodetic Recognition Problem
Carlos V. G. C. Lima, Vinicius F. dos Santos, João H. G. Sousa +1
A strong geodetic set of a graph~ is a vertex set~ in which it is possible to cover all the remaining vertices of~ by assigning a uniqu…
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 the proper interval completion problem within some chordal subclasses
François Dross, Claire Hilaire, Ivo Koch +4
Given a property (graph class) , a graph , and an integer , the \emph{-completion} problem consists in deciding whether we can turn into a graph with the property $…
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…
Parameterized Complexity of Equitable Coloring
Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos
A graph on vertices is equitably -colorable if it is -colorable and every color is used either or times. S…