Masashi Kiyomi Assistant Professor
School of Information Science（Department of Information Science・Theoretical Information Science）

■Degrees

B.E. from The University of Tokyo (2000), M.E. from The University of Tokyo (2002), Ph.D. from The Graduate University for Advanced Studies (2006)

My research area is developping fast algorithms for various problems. I am recently interested in enumeration probles on graphs.

combinatorial optimization, graph algorithm

Generating chordal graphs included in given graphs，Masahi Kiyomi and Takeaki Uno，Transactions on Information and Systems, IEICE, E89-D, No2, pp. 763-770, 2006
Listing Chordal Graphs and Interval Graphs，Masashi Kiyomi, Shuji Kijima, and Takeaki Uno，WG 2006, Lecture Notes in Computer Science 4271, Springer, pp. 68-77
Efficient Algorithms for the Electric Power Transaction Problem，Masashi Kiyomi, Takeaki Uno, and Tomomi Matsui，WINE2005, Lecture Notes in Computer Science 3828 (2006) 602--611

Reconstruction of Connected Interval Graphs，Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara，Acceleration and Visualization of Computation for Enumeration Problems，RIMS, Kyoto，2008/9/29-2008/9/30