CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME) (Institutional affiliation from the last research proposal) Birthplace: Brazil
He has a bachelor's and master's degree in Mathematics from the Federal University of Pernambuco (2011), a doctorate in Computer Science from the University of São Paulo (2016), during which he did a research internship at West Virginia University - USA (2014), and post-doctorates at the State University of Campinas (2016), Universidad de Chile (2017), and Universidad de Valparaíso (2018). He has experience in the area of Mathematics, with an emphasis on Graph Theory and Combinatorics. Between 2018 and 2024 he was a professor in the Systems and Computer Engineering Program (PESC/COPPE), at the Federal University of Rio de Janeiro, in which he received a Young Scientist of Our State scholarship (FAPERJ) since 2022. He is currently a professor in the Department of Computer Science at the Institute of Mathematics and Statistics of the University of São Paulo. (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) |
Graphs and other combinatorial structures are fundamental components of the foundation of Computer Science, specially for being the ideal mathematical structures for the representation of networks. Therefore, it is interesting to master their properties in order to manipulate them efficiently. This project proposes the investigation of partition problems and covering problems in graphs. T…
A temporal graph G* = (G,t) is a graph G in which each edge e is provided with a time interval t(e) which indicates the times when such an edge is available. Such a structure allows us to model situations where the connections between objects vary over time. A temporal path in G* is a path v1 ... vk such that t(v{i-1} vi) <= t(vi t{i+1}), i.e., a path that visits edges in increasing time;…
The focus of this project is a classical problem in graph theory on the partition of the edge set of a graph into a minimum number of paths. This problem has its roots in a conjecture of Gallai (1966) on an upper bound for this number that depends only on the number of vertices of the graph. This conjecture states that the edge set of an n-vertex connected graph can be decomposed into at…
A graph G is a pair (V,E), where V is a finite set and E is a set of pairs of distinct elements of V. The elements of V are called vertices, and the elements of E are called edges. Given a graph G=(V,E), a graph decomposition of G is a set of edge-disjoint subgraphs of G that cover E. If D = {H_1,..., H_k} is a decomposition of G such that H_i is a path for every i in {1,...,k}, we say …
| 1 / 1 | Ongoing grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 1 / 1 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 4 / 4 | All research grants and scholarships |
| Associated processes | |