UEHARA, Ryuhei Adviser to the President, Professor, Director of Computing Science Research Area
Information Science, Computing 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-Communications (1998) 電気通信大学
◆Professional Experience
: Hitotsubashi University (1999)Researcher, University of Waterloo (2001)Associate Professor, Komazawa University (2001)
: 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
◆Specialties
Information theory
◆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. 備考_alt

■Publications

◆Published Papers
Computational complexity of jumping block puzzles.
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
Theor. Comput. Sci., 983, 114292-114292, 2024
Sorting balls and water: Equivalence and computational complexity.
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Theor. Comput. Sci., 978, 114158-114158, 2023
Any platonic solid can transform to another by O(1) refoldings
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Computational Geometry: Theory and Applications, 113, -, 2023
Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara, Masao Hara
Theoretical Computer Science, 939, 216-226, 2023
On the Computational Complexity of Generalized Common Shape Puzzles.
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
CoRR, abs/2305.10749, -, 2023
◆Misc
レプ・タイルの定式化を用いた各種ソルバの性能比較
番原 睦則, 橋本 健二, 堀山 貴史, 湊 真一, 中村 駆, 西野 正彬, 酒井 正彦, 上原 隆平, 宇野 裕之, 安田 宜仁
人工知能学会研究会資料 人工知能基本問題研究会, 119, 02-07, 2022
Research on Map Folding with Boundary Order on Simple Fold
JIA Yiyang, MITANI Jun, UEHARA Ryuhei
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web), E104.A, 9, -, 2021
外周部の順序が与えられた地図折り問題の解法
JIA Yiyang, 三谷純, 上原隆平
日本応用数理学会年会講演予稿集(CD-ROM), 2020, -, 2020
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
情報処理学会論文誌, 58, 8, -, 2017
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
情報処理学会論文誌, 58, 8, -, 2017
◆Books
『数学セミナー』パズルの算法/パズルソルバ
その他, 日本評論社, 2022
理論計算機科学事典
分担執筆, 朝倉書店, 2022
『数学セミナー』パズルの算法/クロスバーパズル
その他, 日本評論社, 2022
『数学セミナー』パズルの算法/ルービック・キューブ
その他, 日本評論社, 2021
『数学セミナー』パズルの算法/アンチスライドパズル
その他, 日本評論社, 2021
◆Conference Activities & Talks
Reconfiguring undirected paths
16th Algorithms and Data Structures Symp. (WADS 2019), 2019
Folding and unfolding algorithms on (super)computer
The 5th International Symposium on Computing and Networking (CANDAR 2017), Aomori, Japan, 2017
Development of Peg Solitaire Font
IEICE Technical Report, COMP2016-50, Vol. 116 No. 503, pp. 1-4, Nagoya, 2017
シルエットパズルの凸配置の個数の研究
IEICE Technical Report, COMP2016-29, Vol. 116, No. 262, pp. 39-45, Sendai, 2016
Experimental Enumeration of Solutions for Peg Solitaire
IPSJ SIG Technical Report, 2016-AL-159-3, p. 1, Tokushima, 2016

■Teaching Experience

Information Processing Theory(E), Theory of Advanced Algorithms, Algorithms and Data Structures(E), Advanced Algorithms for Computational Geometry, Computational Complexity and Discrete Mathematics(E), Computation Theory, 情報処理論(E), 実践的アルゴリズム理論, アルゴリズムとデータ構造(E), 実践的幾何アルゴリズム, 計算量の理論と離散数学(E), 計算論

■Contributions to  Society

◆Academic Society Affiliations
Information Processing Society of Japan, The Institute of Electronics, Information and Communication Engineers, ACM, EATCS, IEEE
◆Academic Contribution
The 13th Japan-Korea Joint Workshop on Algorithms and Computation , JAIST, Professor, Tetsuo AsanoJAIST, Associate Professor, Ryuhei Uehara , 2010 - 2010 , 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 - 2009 , Kanazawa Culture Hall
Workshop on Algorithms and Computation , Indian Statistical Institute, Professor, Sandip Das,JAIST, Associate Professor, Ryuhei Uehara , 2009 - 2009 , インド・コルカタ
◆Social Contribution
・ パズル島へようこそ2021 , 多摩六都科学館 , パズル島へようこそ2021 2021 - 2021
・ The 15th International Conference and Workshops on Algorithms and Computing 2021 - 2021

■Academic  Awards

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