Yoshiko Wakabayashi
From Wikipedia, the free encyclopedia
Yoshiko Wakabayashi | |
|---|---|
| Born | 21 May 1950 |
| Academic background | |
| Alma mater | University of Augsburg |
| Thesis | Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations |
| Doctoral advisor | Martin Grötschel |
| Academic work | |
| Discipline | computer science applied mathematics |
| Institutions | University of São Paulo |
| Main interests | combinatorial optimization polyhedral combinatorics packing problems graph algorithms |
| Website | http://www.ime.usp.br/~yw |
Yoshiko Wakabayashi (born 21 May 1950) is a Brazilian computer scientist and applied mathematician whose research interests include combinatorial optimization, polyhedral combinatorics, packing problems, and graph algorithms. She is a professor in the department of computer science and institute of mathematics and statistics at the University of São Paulo.[1][2]
After earning bachelor's and master's degrees in applied mathematics at the University of São Paulo in 1972 and 1977 respectively, Wakabayashi went to the University of Augsburg in Germany for doctoral study in applied mathematics, completing her doctorate (Dr. rer. nat.) in 1986.[1][2] Her dissertation, Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, was supervised by Martin Grötschel.[3]
She became an assistant professor at the University of São Paulo in 1977, associate professor in 1995, and full professor in 2006.[2]
