In recent years, numerous real applications of combinatorial optimization have been emerged, and it has been required to solve large-scale combinatorial optimization problems from real applications with large-scale data. However, most of these problems are classified into the class of NP-hard from the view of computational complexity. Under the background, we are aiming to develop practical algorithms for larger and harder combinatorial problems within reasonable computation time.
- 2003 Ph.D., Kyoto University (Informatics)
- 2003 Research Associate, Department of Advanced Science and Technology, Faculty of Engineering, Toyota Technologial Institute
- 2005 Research Associate, Department of Systems Engineering, Faculty of Electro-Communications, The University of Electro-Communications
- 2007 Assistant Professor, Department of Systems Engineering, Faculty of Electro-Communications, The University of Electro-Communications
- 2008 Associate Professor, Information and Physical Science, Graduate School of Information Science and Technology, Osaka University
- 2010 Researcher (concurrent post), Precursory Research for Embryonic Science and Technology (PRESTO), Japan Science and Technology Agency (JST)
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.