Theory and Algorithms for Combinatorial Optimization
I am interested in Combinatorial Optimization, Graphs, Matroids, Algorithms, etc. One of the main goals is to establish a theory to explore and clarify the theoretical limitation of efficient algorithms for a variety of computational problems on combinatorial structures such as graphs, matroids, and so on.
- March 2013: Master of Science from Kyoto University, Japan.
- March 2016: Doctor of Philosophy in the field of Mathematical Informatics from University of Tokyo, Japan.
- April 2016: Assistant Professor at Osaka University, Japan.
The four-digit phone numbers are extensions at Osaka University. To call directly from outside Osaka University, dial a phone number marked S after (area code 06) 6850 or a phone number marked T after (area code 06) 6879. For a phone number marked S (extension), however, first dial the main phone number (06) 6879-5111.
The e-mail addresses are given without the suffix "osaka-u.ac.jp"; add "osaka-u.ac.jp" to each e-mail address.