---

Informações resumidas do Currículo Lattes

Currículo Lattes atualizado em 04/04/2023

Nome em citações bibliográficas: GOMES, G. C. M.;GOMES, GUILHERME;GOMES, GUILHERME C.M.;GOMES, GUILHERME C. M.;Gomes, Guilherme Castro Mendes

---

Projetos de pesquisa em andamento

Projetos de desenvolvimento em andamento

Veja todos os projetos no Currículo Lattes

---

Últimas publicações

Artigos em periódicos

Disconnected Matchings
2023. Theoretical Computer Science.
Exact Algorithms for Biclique Coloring
2022. Matemática Contemporânea.
How to build high quality L2R training data: Unsupervised compression-based selective sampling for learning to rank
2022. INFORMATION SCIENCES.
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
2022. ALGORITHMICA.
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
2021. Algorithmica (New York. Internet).
Coloring Problems on Bipartite Graphs of Small Diameter
2021. ELECTRONIC JOURNAL OF COMBINATORICS.
Intersection graph of maximal stars
2020. DISCRETE APPLIED MATHEMATICS.
Parameterized Complexity of Equitable Coloring
2019. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE.

Trabalhos completos em congressos

Weighted Connected Matchings
2022. 15th Latin American Theoretical Informatics Symposium, November 7?11, 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.
Structural Paramerterizations for Equitable Coloring
2020. Latin American Theoretical Informatics Symposium.
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
2019. 14th International Symposium on Parameterized and Exact Computation.

Resumos expandidos em congressos

Um algoritmo exato para biclique-coloração
2017. II Encontro de Teoria da Computação.
Automatic query expansion based on tag recommendation
2012. the 21st ACM international conference.

Resumos em congressos

Emparelhamento Conexo Ponderado é NP-completo
2022. Encontro de Teoria da Computação.
Emparelhamento Desconexo é NP-Completo
2021. Encontro de Teoria da Computação.

Veja todas as publicações no Currículo Lattes

---

Orientações em andamento

Mestrado

Doutorado

Veja todas as orientações no Currículo Lattes

---