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. Professor Emeritus, UNICAMP, Campinas, Brazil. Collaborating Researcher, Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil. (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) |
We propose to investigate carefully selected problems to advance the state of the art in combinatorial analysis, always inspired by fundamental questions in the field. There will be emphasis on classic, asymptotic, quantum, and geometric problems, many of which will be approached through multifaceted techniques involving methods from more than one of these fronts of modern combinatorics. …
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)
The subject, Pfaffian Graphs, has applications in econometrics and in the analysis of the stability of organic compounds. From a theoretical point of view, the subject is quite attractive, with interesting algorithms and open problems. Currently, characterizations of Pfaffian graphs and the corresponding efficient algorithms are known only for bipartite and near-bipartite graphs. The ob…
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…
| 1 / 1 | Ongoing grants |
| 6 / 5 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 6 / 1 | Completed scholarships in Brazil |
| 14 / 8 | All research grants and scholarships |
| Associated processes | |
CV Lattes
ORCID