Ryuuhei Uehara Professor
School of Information Science,Entertainment Technology Area
◆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-Communications (1998)
◆Professional Experience
: 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, Algorithm
◆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

◆Published Papers
Report from EATCS Japan Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 128, 128, 109-112, 2019/06
Computational Origami
上原 隆平
電子情報通信学会誌 = The journal of the Institute of Electronics, Information and Communication Engineers, 102, 4, 297-299, 2019/04
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.
Koji Ouchi,Ryuhei Uehara
IEICE Transactions, 102-D, 3, 416-422, 2019/03
First Course in Algorithms Through Puzzles
Ryuhei Uehara
1-175, 2019
Sequentially Swapping Colored Tokens on Graphs.
Katsuhisa Yamanaka,Erik D. Demaine,Takashi Horiyama,Akitoshi Kawamura,Shin-Ichi Nakano,Yoshio Okamoto,Toshiki Saitoh,Akira Suzuki,Ryuhei Uehara,Takeaki Uno
J. Graph Algorithms Appl., 23, 1, 3-27, 2019
◆Misc
Tree Spanners for Bipartite Graphs and Probe Interval Graphs(jointly authored)
Lecture Notes in Computer Science, 2880, 106-118, 2003
Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles(jointly authored)
Canadian Conference on Computational Geometry, 105-108, 2002
Completeness of Graph Isomorphism Problem for Bipartite Graph Classes(jointly authored)
IEICE Technical Report, COMP2001, 93, 1-5, 2002
Fast Parallel Approximation Algorithms for Maximum Weight Matching Problem
IDSJ SIG Notes, 2000-AL-71, 33-40, -, 2000
Indentification of Partial Disjunction, Parity, and Threshold Functions (jointly authored)
Theoretical Computer Science, 230, 131-147, 2000
◆Books
First Course in Algorithms Through Puzzles
Ryuhei Uehara, Springer, 2018
The Best Writing on Mathematics 2018, Tangled Tangles
Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Quanquan Liu, and Ryuhei Uehara, Princeton University Press, 2018
Games, Puzzles, and Computation
Robert Hearn and Erik D. Demaine, Single Translation, 2011
Geometric Folding Algorithms
Erik D. Demaine, Joseph O'Rourke, Single Translation, 978-4-7649-0377-7, 2009
Site Consistency in Phylogenetic Networks with Recombination, in Algorithmics in Bioniformatics
Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente, College Publications, 2006
◆Conference Activities & Talks
Folding and unfolding algorithms on (super)computer
Ryuhei Uehara
The 5th International Symposium on Computing and Networking (CANDAR 2017), Aomori, Japan, 2017/11/19
Development of Peg Solitaire Font
Taishi Oikawa, Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara
IEICE Technical Report, COMP2016-50, Vol. 116 No. 503, pp. 1-4, Nagoya, 2017/03/07
Experimental Enumeration of Solutions for Peg Solitaire
Taishi Oikawa, Itsuki Kanemoto, Toshiki Saitoh, Masashi Kiyomi, and Ryuhei Uehara
IPSJ SIG Technical Report, 2016-AL-159-3, p. 1, Tokushima, 2016/09/23
Counting the Number of Solutions for Peg Solitaire
Itsuki Kanemoto, Toshiki Saitoh, Masashi Kiyomi, and Ryuhei Uehara
IEICE Technical Report, COMP2016-14, Vol. 116, No. 211, pp. 1-5, Toyama, 2016/09/06
Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno
IEICE Technical Report, COMP2016-13, Vol. 116, No. 116, pp. 115-121, Ishikawa, 2016/06/24

■Teaching Experience

Computation Theory, Computational Complexity and Discrete Mathematics(E), Advanced Algorithms for Computational Geometry

■Contributions to  Society

◆Academic Society Affiliations
IEEE, EATCS, ACM, The Institute of Electronics, Information and Communication Engineers
◆Academic Contribution
The 13th Japan-Korea Joint Workshop on Algorithms and Computation , JAIST, Professor, Tetsuo AsanoJAIST, Associate Professor, Ryuhei Uehara , 2010/07/23 - 2010/07/24 , Kanazawa Culture Hall, Kanazawa, Ishikawa, Japan
Japan Conference on Computational Geometry and Graphs , JAIST, Professor, Tetsuo AsanoKyoto University, Associate Professor, Hiro ItoJAIST, Associate Professor, Ryuhei Uehara , 2009/11/11 - 2009/11/13 , Kanazawa Culture Hall
Workshop on Algorithms and Computation , Indian Statistical Institute, Professor, Sandip Das,JAIST, Associate Professor, Ryuhei Uehara , 2009/02/18 - 2009/02/20

■Academic  Awards

・ IPSJ Yamashita SIG Research Award , Information Processing Society of Japan , 2012/03/07
・ EATCS/LA Best Presentation Award , EATCS Japan Chapter and LA Symposium , 2009/02/04