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 |
| TITULO |
| Articles published in other media outlets (0 total): |
| 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…
This is the research project for the postdoc of Mário César San Felice, to be accomplished at the Institute of Mathematics and Statistics of the University of São Paulo (IME-USP), from August 1, 2017 to July 31, 2019, under the supervision of Professor Cristina Gomes Fernandes. The goal is to address combinatorial optimization problems, aiming at the design and analysis of new algorithms,…
This is the research project associated to the Masters scholarship application of Yan Soares Couto, student at the Graduate Program in Computer Science of the IME-USP. The topics addressed in this project are advanced data structures, including temporal data structures, that allow access and updates in the past, adaptive binary search trees, such as splay and tango trees, multi-splay tre…
In graph theory, a classic problem consists in finding a set of vertex or edges such that every object of some kind contains at least one element in that set. Such a set is called transversal, and in general we try to search little transversals, possibly of minimum size.When we don't know the size of a minimum transversal, it is interesting to search for good delimitations for that size. …
(Only some records are available in English at this moment)
| 1 / 1 | Ongoing research grants |
| 2 / 2 | Completed research grants |
| 12 / 7 | Completed scholarships in Brazil |
| 1 / 0 | Completed scholarships abroad |
| 16 / 10 | All research grants and scholarships |
| Associated processes | |
CV Lattes
ORCID