PhD cadidate for the State University of Campinas (Unicamp). Master's degree in Computer Science from the State University of Campinas (Unicamp). Graduated in Computer Science with Summa Cum Laude distinction from the Federal University of Ceará (UFC). Vice-champion of the International Logic Olympiad 2018 of the Mexican Academy of Logic. Finalist of the XXIII Programming Marathon of SBC. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In this paper we will propose algorithms to solve the problem of partitioning the edge set of a graph into subsets, so that the subgraph induced by each subset of edges is a circuit, aiming to maximize the number of subsets of the partition. We will also design algorithms for a variation of this problem where the edges of the graph have colors (black or gray) and the subgraphs induced by …
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |
CV Lattes
ORCID