CV Lattes
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Peru
graduation at Ingeniería Informática from pontificia Católica del Peru (2011), master's at Computer Science from Universidade de São Paulo (2014) and doctorate at Computer Science from Universidade de São Paulo (2019). Has experience in Computer Science, focusing on Theory of Computing, acting on the following subjects: path covers, polyhedra, matchings, spanner and longest paths. (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 objective of this project is to study problems concerning graph spanners. Given a connected graph G and a positive real number t > 1 (stretch factor), a t-spanner of G is a spanning subgraph H of G such that for every pair of vertices u and v, the distance between u and v in H is at most t times the distance between them in G. A central problem about spanners, known as the tree t-spa…
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |