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
bachelor's at Bacharelado em Ciência da Computação from Universidade de São Paulo (1987), master's at Mathematics from Universidade de São Paulo (1992) and doctorate at Ciência da Computação from Georgia Institute of Technology (1997). Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity, acting on the following subjects: approximation algorithms, complexity theory, algoritmos de aproximação, graph theory and otimização combinatória. (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) |
This is a research project for the joint call of proposals between the São Paulo Research Foundation (FAPESP), Brazil, and the Comisión Nacional de Investigación Científica y Tecnológica (CONICYT), Chile. The Brazilian and the Chilean teams have been working in Combinatorics and Graph Theory for several years now. Some of the Brazilian members have already collaborated with some of the C…
This project lies in the area of discrete mathematics and combinatorics, and is associated to a two months long visit to the Department of Computer Science of the Institute of Mathematics and Statistics of the University of São Paulo. We are interested in studying problems relating notions of graphs and matroids. Matroid theory is a subject gathering several areas. It helps to explain and…
Graphs are often used to model real-world structures such as social networks or protein interactions. Thus, the visualization and analysis of these graphs become essential for extracting patterns and relevant information (data mining). One area of interest is the search for communities, such as a close group of friends in a social network. This is done by identifying cohesive subgraphs, w…
This project has as its main objective the study and research of the mathematical delimitations of the cost of operations in binary search trees and also the exploration of different binary search trees that are asymptotically efficient. As part of this study, the student will implement the structures and algorithms studied and prepare a didactic text presenting some of the topics studied…
This is the research project of undergraduate student João Guilherme Alves Santos under the supervision of Professor Cristina Gomes Fernandes. The aim of this project is to study and explore approximation algorithms for clustering problems. The candidate will delve into a comprehensive overview of approximation algorithms, focused on methods used on clustering problems, examining techniqu…
This undergraduate research project is designated for Anahí Coimbra Maciel and will be supervised by Cristina G. Fernandes at the Institute of Mathematics and Statistics of the University of São Paulo, from 1 September 2023 to 30 June 2024 (10 months). The main goal of this project is an in-depth exploration, at the undergraduate level, of temporal data structures and some of their applic…
(Only some records are available in English at this moment)
| 3 / 3 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 15 / 10 | Completed scholarships in Brazil |
| 1 / 0 | Completed scholarships abroad |
| 20 / 14 | All research grants and scholarships |
| Associated processes | |