Full Professor at the Computer Science Department, University of São Paulo. Obtained Master Degree in Applied Mathematics at the University of São Paulo (1977) and Doctor Degree (Dr. re. nat.) in Applied Mathematics at the Universitaet Augusburg (1986), Germany. Her research interests include combinatorial optimization, graph theory, algorithms and complexity. Has works in graph theory, clustering, approximation algorithms for packing problems and optimization problems on graphs and other discrete structures. Member of the National Order of the Scientific Merit, class "Comendador", since 2010 (awarded by the Brazilian Ministry of Science and Technology). Member of the Academy of Sciences of São Paulo State (ACIESP) since 2012, and member of the Brazilian Academy of Sciences since 2019. In 2020 received the Scientific Merit Award conferred by the Brazilian Computer Society. (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 main theme of this project is the investigation of several problems on objects of discrete nature, with focus on their algorithmic, structural and theoretical aspects. We will give emphasis to the treatment of "hard problems" (formally known as NP-hard problems), but we will not restrict to this class of problems. We will also consider problems belonging to other complexity classes, a…
Computer Science is an area of rapid growth. New technologies emerge and become obsolete in one or two years. New approaches and methods are proposed at an impressive pace. Increasingly complex problems from diverse scientific research domains demand such vigorous developments. It is impossible to imagine any competitive research in any data driven area being developed today without the s…
(Only some records are available in English at this moment)
This is a research project to be carried out by Gabriel Morete de Azevedo towards a MSc degree under the guidance of Y. Wakabayashi at IME-USP. It is a project in combinatorial optimization that addresses problems on connectivity augmentation of graphs, with emphasis on their algorithmic aspects. Generally speaking, the goal of the problems to be investigated is to increase the connectivi…
This is the postdoctoral research project of Atílio Gomes Luiz, to be carried out under the supervision of Professor Yoshiko Wakabayashi at the Institute of Mathematics and Statistics of the University of São Paulo. This project addresses topics in Graph Theory, more specifically, graph labelling problems. Graph labelling is the assignment of labels, usually nonnegative integers, to the e…
This is the research project for the postdoctoral fellowship of Maycon Sambinelli, to be carried out under the supervision of Yoshiko Wakabayashi, at the Instituto de Matemática e Estatística of the University of São Paulo. This project addresses topics on structural graph theory, more specifically, classical partition problems in graphs and digraphs. We plan to investigate problems on ve…
In this project we plan to investigate problems on graph spanners. Given a connected graph G and a positive real number t>1 (stretch factor), a t-spanner is a spanning subgraph H of G such that for every pair of vertices u, v the distance between u and v in H is at most t times their distance in G. A central problem on this topic, known as the 'minimum t-spanner problem', consists in fi…
(Only some records are available in English at this moment)
This is the BEPE-MS research proposal of Gabriel Morete de Azevedo, M.Sc. studentat the Institute of Mathematics and Statistics of the University of São Paulo, to be conducted at the Combinatorics & Optimization Department of the University of Waterloo,under the supervision of Professor Joseph Cheriyan. It is a project in combinatorial optimization that addresses problems on connectivity …
The focus of this research proposal is the study of partition problems on graphs.We are particularly interested in the proper orientation, path cover, and convex recoloring problems. In the first problem, we have to orient every edge in a graph so that the indegrees of the vertices in this orientation induce a partition of the set of vertices into a minimum number of stable sets.In the se…
A graph G is a pair (V,E), where V is a finite set and E is a set of pairs of distinct elements of V. The elements of V are called vertices, and the elements of E are called edges. Given a graph G=(V,E), a graph decomposition of G is a set of edge-disjoint subgraphs of G that cover E. If D = {H_1,..., H_k} is a decomposition of G such that H_i is a path for every i in {1,...,k}, we say …
(Only some records are available in English at this moment)
| 7 / 6 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 14 / 9 | Completed scholarships in Brazil |
| 4 / 4 | Completed scholarships abroad |
| 27 / 21 | All research grants and scholarships |
| Associated processes | |
CV Lattes
ORCID