Undergraduate in Computer Engineering at UNICAMP. Has an interest for Competitive Programming, Algorithms and Data Structures. Won a gold medal (1st out of 1512) at the Brazilian Olympiad in Informatics (OBI), Senior category and a bronze medal at the 2021 ICPC Brazilian Finals. Worked as an Algorithms Teacher at the Olympic Week of OBI. (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) |
The Minimum Path-Collection Exact Cover (PCEC) is a problem where, given a directed graph G and a set of paths of G, it is necessary to find the subset of paths of lowest cardinality such that every edge of the graph is covered exactly once . The Minimum k-Path Splitting Exact Cover (k-PSEC) is a variant of the PCEC in which there are restrictions on the chosen paths. These problems belon…
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |
CV Lattes
ORCID