CV Lattes
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Has a degree in Electrical Engineering - Major in Electronics - from University of São Paulo (1968), M. Math in Computer Science from University of Waterloo (1971) and Ph. D. in Computer Science from University of Waterloo (1976). Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity, with interest in the following subjects: complexity of algorithms, graph theory, finite automata and matching covered graphs. (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) |
The research proposed in this project is focused on the development of efficient combinatory algorithms and the investigation of discrete structures of interest, with the global aim of supporting in a fundamental manner the Science of computing. The focus of this project is classic in nature. Of the many fronts of computer Science which seek to give support to computationally intense rese…
(Only some records are available in English at this moment)
This project's goal is to define some Pfaffian graphs related problems complexity class (P, NP, co-NP, NP-complete, etc). Pfaffian graphs are the graph whose edges can be oriented such that each conformal circuit with an even number of vertices has an odd orientation. No characterization is known for any Pfaffian graphs. It is not even known whether the problem of determining if a given g…
| 6 / 5 | Completed research grants |
| 6 / 1 | Completed scholarships in Brazil |
| 12 / 6 | All research grants and scholarships |
| Associated processes | |