| Lab |
| 情報研究棟IS Building Ｉ 6F |
| TEL：0761-51-1220 |
To Lab's Site |
| Japanese | English |
| Full text / JAIST Repository |
Ryuuhei Uehara Professor
School of Information Science（Department of Information Science・Theoretical Information Science）
■Degrees
Master's thesis, Dep. Computer Science and Information Mathematics, University of Electro-Communications (1991)Ph.D thesis, Dp. Computer Science and Information Mathematics, University of Electro-Comm
■Professional Career
Canon Inc., Information Science Research Center (1991)Assistant, Tokyo Woman's Christian University (1993)Lecturer, Komazawa University (1998)Part time lecturer, Tokyo Institute of Technology (1998)Part time lecturer, Hitotsubashi University (1999)Researcher, University of Waterloo (2001)Associate Professor, Komazawa University (2001)
■Specialties
Computational Complexity and Graph Algorithms
■Research Keywords
Computational complexity, Graph theory, Algorithms
■Research Interests
Design and analysis of efficient algorithms for hard problems on restricted graph classes
There are many hard problems on general graphs from the viewpoint of computational complexity. However, some problems can be solved efficiently if the input graphs are restricted. My research topic is to design/analysis of the efficient algorithms, especially, for subclasses of perfect graphs.
Study on rigid graph structure like Origami
Origami can be seen as a rigid graph structure that consists of faces, crease lines, and points. From the viewpoint of theoretical computer science, I study the efficiency and complexity of geometric foldings for such rigid graph structure.
■Publications
◇Books
- Computational Complexity of a Pop-up Book in "ORIGAMI^4"，Ryuhei Uehara and Sachio Teramoto，pp.295-304, A K Peters Ltd., 2009
- Site Consistency in Phylogenetic Networks with Recombination, in Algorithmics in Bioniformatics，Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente，College Publications，2006，15-26
◇Published Papers
- Voronoi Game on a Path，Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara，IEICE TRANS. INF. & SYST., 2011，Vol. E94-D，pp. 1185-1189
- A Double Classification Tree Search Algorithm for Index SNP Selection，Peisen Zhang, Huitao Sheng, and Ryuhei Uehara，BMC Bioinformatics(http://www.biomedcentral.com/bmcbioinformatics/)，5，89
- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs，Ryuhei Uehara and Zhi-Zhong Chen，Information Processing Letters，76，13-17
◇Lectures and Presentations
- Polygons Folding to Plural Incongruent Orthogonal Boxes，Jun Mitani, Ryuhei Uehara，Acceleration and Visualization of Computation for Enumeration Problems, pp. 135-149, 2008/9/29-30.
- 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
- Enumeration of Perfect Sequences of Chordal Graph，Yasuko Matsui, Ryuhei Uehara, Takeaki Uno，Acceleration and Visualization of Computation for Enumeration Problems，RIMS, Kyoto，2008/9/29-2008/9/30
■Extramural Activities
◇Academic Society Affiliations
- The Institute of Electronics, Information and Communication Engineers，2003-
- EATCS，2001-
- Association for Computing Machinery，1997-
◇Other Activities
- Journal of Information Science and Engineering，Editor
- Information Processing Letters，Editor
- SIGAL，Manager，2010/04/01 - 2012/03/31
■Academic Awards Received
- IPSJ Yamashita SIG Research Award，Information Processing Society of Japan，2012
- EATCS/LA Best Presentation Award，EATCS Japan Chapter and LA Symposium，2009