Ken-ichi Kawarabayashi (Japanese: 河原林 健一, born 1975) is a Japanese graph theorist who works as a professor at the National Institute of Informatics and is known for his research on graph theory (particularly the theory of graph minors) and graph algorithms.

Kawarabayashi was born on May 22, 1975, in Tokyo. He earned a bachelor's degree in mathematics from Keio University in 1998, a master's degree from Keio in 2000, and a PhD from Keio in 2001, researching the Lovász–Woodall conjecture[1] under the supervision of Katsuhiro Ota.[2] After temporary positions at Vanderbilt University[2] and under the supervision of Paul Seymour at Princeton University,[1] he became an assistant professor at Tohoku University in 2003, and moved to the National Institute of Informatics in 2006.[2]

In 2003, Kawarabayashi was one of three winners of the Kirkman Medal of the Institute of Combinatorics and its Applications, an award given by them annually to researchers within four years of their PhD. In 2015, he won the Spring Prize of the Mathematical Society of Japan, its highest honor.[3] He was a keynote speaker at the 2015 International Colloquium on Automata, Languages and Programming.[4]

References

  1. 1 2 Kenichi KAWARABAYASHI awarded the Promotion of Science Prize (PDF), Mathematical Society of Japan, retrieved 2016-05-04
  2. 1 2 3 Curriculum vitae: Ken-ichi Kawarabayashi (PDF), retrieved 2015-08-31.
  3. ↑ Kenichi KAWARABAYASHI awarded 2015 MSJ Spring Prize, Mathematical Society of Japan, March 20, 2015, retrieved 2015-08-31.
  4. ↑ Aceto, Luca (July 6, 2015), "ICALP/LICS 2015: Day 1", Process Algebra Diary, retrieved 2015-08-31.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.