---

Information extracted from Lattes platform

Last update: 2026/09/02

ORCID: https://orcid.org/0000-0002-4608-4559

---

Current projects

2023 a Atual	TAPIOCA - Teoria Aplicada a Problemas Integrando Otimização, Combinatória e Algoritmos Edital Universal - CNPq Integrantes: Manoel Campelo (coordenador), Vinicius Fernandes dos Santos.
2022 a Atual	ASPECTOS ALGORÍTMICOS E DE COMPLEXIDADE EM PROBLEMAS DE COMBINATÓRIA E TEORIA DOS GRAFOS Edital Universal - CNPq Integrantes: Luérbio Faria (coordenador), Vinicius Fernandes dos Santos.
2022 a Atual	Propriedades estruturais de grafos e suas consequências algorítmicas Bolsa de Produtividade Integrantes: Vinicius Fernandes dos Santos (coordenador).
2019 a Atual	Grafos, matrizes, e a computação quântica Universal FAPEMIG Integrantes: Gabriel Morais Coutinho (coordenador), Vinicius Fernandes dos Santos, PEREIRA, FERNANDO MAGNO QUINTÃO, Thomás Jung Spier, Omar Paranaíba Vilela Neto.
2018 a Atual	Algoritmos e Sistemas Distribuídos com Aplicações em Datacenters e Internet das Coisas Universal FAPEMIG Integrantes: Olga Goussevskaia (coordenador), Vinicius Fernandes dos Santos.

Current applied research projects

See all projects in Lattes

---

Recent publications

Articles in journals

Graphs and Algorithms celebrating a fifty-year landmark
2026. Journal of the Brazilian Computer Society.
Complexity of deciding the equality of matching numbers
2026. JOURNAL OF COMPUTER AND SYSTEM SCIENCES.
On the proper interval completion problem within some chordal subclasses
2025. DISCRETE MATHEMATICS.
Weighted connected matchings
2025. THEORETICAL COMPUTER SCIENCE.
Some results on vertex separator reconfiguration
2025. RAIRO-OPERATIONS RESEARCH.
Graphs of Small Bandwidth and the Firefighter Problem
2025. MATEMATICA CONTEMPORANEA.
Two-Turn Assymetric Graph Coloring Games
2025. MATEMATICA CONTEMPORANEA.
Some Results on the Relationship of Modular Parameters on Graphs
2025. MATEMATICA CONTEMPORANEA.
Parameterized algorithms for locating-dominating sets
2025. THEORETICAL COMPUTER SCIENCE.
Edge deletion to tree-like graph classes
2024. DISCRETE APPLIED MATHEMATICS.
Polynomial time algorithms for the token swapping problem on cographs
2024. RAIRO-OPERATIONS RESEARCH.
Computational complexity and linear formulations for optimizing the location of shared mobility stations
2024. International Transactions in Operational Research.
Minimum separator reconfiguration
2024. JOURNAL OF COMPUTER AND SYSTEM SCIENCES.
On the computational complexity of the strong geodetic recognition problem
2024. RAIRO-OPERATIONS RESEARCH.
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
2023. International Transactions in Operational Research.
Reducing the vertex cover number via edge contractions
2023. JOURNAL OF COMPUTER AND SYSTEM SCIENCES.
Disconnected matchings
2023. THEORETICAL COMPUTER SCIENCE.
Integer programming formulations for the k - in-a-tree problem in graphs
2023. International Transactions in Operational Research.
Exact Algorithms for Biclique Coloring
2022. Matemática Contemporânea.
Equitable Partition of Graphs into Independent Sets and Cliques
2022. Matemática Contemporânea.
Jayme?s scientific contributions in the area of Convexity in Graphs
2022. CADERNOS DO IME. SÉRIE INFORMÁTICA.
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
2022. ALGORITHMICA.
Reducing graph transversals via edge contractions
2021. JOURNAL OF COMPUTER AND SYSTEM SCIENCES.
On the proper orientation number of chordal graphs
2021. THEORETICAL COMPUTER SCIENCE.
Parameterized Complexity of Equitable Coloring
2019. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (ONLINE).
Complexity aspects of the computation of the rank of a graph
2014. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (ONLINE).
On the Carathéodory number of interval and graph convexities
2013. Theoretical Computer Science.

Papers in conferences

String Matching with a Dynamic Pattern
2025. String Processing and Information Retrieval. SPIRE 2025.
Enumeration kernels for Vertex Cover and Feedback Vertex Set
2025. International Symposium on Parameterized and Exact Computation (IPEC).
Exploring subgraph complementation to bounded degree graphs
2025. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025).
On musical arrangement problems time complexity
2025. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025).
Some complexity results on cycle-convex partitions
2025. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025).
Game chromatic number of split and threshold graphs
2025. XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025).
Finding the Minimum Cost Acceptable Element in a Sorted Matrix
2024. Symposium on Experimental and Efficient Algorithms.
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
2024. 19th International Symposium on Parameterized and Exact Computation (IPEC 2024).
UM MODELO COMPACTO PARA O PROBLEMA DO NÚMERO DE SALTOS ARBÓREOS DE UMA ORDEM PARCIAL
2024. ANAIS DO LVI SIMPóSIO BRASILEIRO DE PESQUISA OPERACIONAL.
Minimum Separator Reconfiguration
2023. 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).
Reducing the Vertex Cover Number via Edge Contractions
2022. International Symposium on Mathematical Foundations of Computer Science (MFCS).
Weighted Connected Matchings
2022. Latin American Symposium on Theoretical Informatics (LATIN 2022).
Kernelization results for equitable coloring
2021. Latin and American Algorithms, Graphs and Optimization Symposium.
Parameterized algorithms for locating-dominating sets
2021. Latin and American Algorithms, Graphs and Optimization Symposium.
On structural parameterizations of the selective coloring problem
2021. Latin and American Algorithms, Graphs and Optimization Symposium.
Disconnected Matchings
2021. International Computing and Combinatorics Conference.
FPT and Kernelization Algorithms for the Induced Tree problem
2021. 12th International Conference on Algorithms and Complexity.
Qubit allocation
2018. the 2018 International Symposium.

Extended abstracts in conferences

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
2025. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB).
Firefighters work better when the bandwidth is small
2024. Encontro de Teoria da Computação.
Problemas musicais - estrutura, propostas e complexidade
2024. Encontro de Teoria da Computação.
Complexidade parametrizada do problema de reconfiguração de separadores
2023. Encontro de Teoria da Computação.
Emparelhamento Conexo Ponderado é NP-completo
2022. Encontro de Teoria da Computação.
Finura em Grafos Cordais
2022. Encontro de Teoria da Computação.
Problemas de Particionamento de Grafos em Árvores Monocromáticas
2022. Encontro de Teoria da Computação.
Emparelhamento Desconexo é NP-Completo
2021. Encontro de Teoria da Computação.
Sobre o Número de Orientação Própria de Grafos Cordais
2021. Encontro de Teoria da Computação.

Abstracts in conferences

Jogos de coloração de grafos com dois turnos
2025. Congresso Nacional de Matemática Aplicada e Computacional (CNMAC).
Um estudo sobre grafos 2-cordais finos e subclasses
2024. 11th Latin American Workshop on Cliques in Graphs.
Some results on the relationship between modular-related parameters of graphs
2024. 11th Latin American Workshop on Cliques in Graphs.
Variations of chordal and dually chordal graphs characterizable by vertex orderings
2024. 11th Latin American Workshop on Cliques in Graphs.
Some results on graph coloring games
2024. 11th Latin American Workshop on Cliques in Graphs.
The Firefighter problem on Loupekine snarks
2024. 11th Latin American Workshop on Cliques in Graphs.
Weighted Connected Matchings
2022. Latin American Workshop on Cliques in Graphs (LAWCG).
Chordal Thinness
2022. Latin American Workshop on Cliques in Graphs (LAWCG).
Weighted connected matchings
2022. Latin Ibero-American Conference on Operations Research (CLAIO 2022).

See all publications in Lattes

---

Current students

MS

Leandro Freitas de Souza. A definir. Início: 2026. Universidade Federal de Minas Gerais (Orientador principal)
Kaio Henrique Masse Vieira. A definir. Início: 2025. Universidade Federal de Minas Gerais (Orientador principal)
Gabriel Nunes Mendes. A definir. Início: 2024. Universidade Federal de Minas Gerais (Orientador principal)
Gabriel Ubiratan Barreto Pereira de Oliveira. A definir. Início: 2024. Universidade Federal de Minas Gerais (Orientador principal)

PhD

Eder Ferreira de Figueiredo. A definir. Início: 2024. Universidade Federal de Minas Gerais (Orientador principal)
Aléssio Miranda Júnior. A definir. Início: 2020. Universidade Federal de Minas Gerais (Orientador principal)
Evellyn Soares Cavalcante. Sobre o problema do número de saltos arbóreos. Início: 2019. Universidade Federal de Minas Gerais (Orientador principal)

See all students in Lattes

---