Rchr
J-GLOBAL ID:200901075628928140
Update date: Jul. 17, 2024
Uehara Ryuuhei
ウエハラ リュウヘイ | Uehara Ryuuhei
Affiliation and department:
Job title:
Associate Professor
Homepage URL (1):
http://www.jaist.ac.jp/~uehara
Research field (1):
Information theory
Research keywords (2):
Computational complexity, Graph theory, Algorithms
, Algorithm
Research theme for competitive and other funds (17):
- 2024 - 2029 Research on solvable regions of theoretically uncomputable/difficult classes
- 2022 - 2025 Optimization of cell three-dimensional structure by computational origami and cell origami
- 2020 - 2025 Algorithmic Foundations Based on Large-Scale Discrete Structures
- 2020 - 2025 Research Initiatives on Algorithmic Foundations for Social Advancement
- 2020 - 2023 Desigining algorithms for commodities transportation on a planar graph modeling a map
- 2018 - 2023 Research on algorithms and data structures for solving theoretically hard problems in practical time
- 2020 - 2022 Application of computational origami to formulation of cells
- 2014 - 2017 Research on geometric folding algorithms
- 2012 - 2017 Exploring the Limits of Computation in the Scenario of Constrained Work Space
- 2011 - 2015 Development of Algorithmic Paradigms on Memory-Constrained Computation
- 2011 - 2013 Research on efficient algorithms for graph structures with geometric properties
- 2004 - 2007 幾つかの画像関連問題の計算複雑度の解析と効率的な解決法の提案
- 1998 - 2000 Analyzing Computational Complexity of Graph-Theoretic Problems with Restrictions on Width Parameters
- 1998 - 1999 拡張されたチューリングマシンモデルを用いた各種のアルゴリズムの研究
- 折り紙を中心とした剛体グラフ構造の複雑さの研究
- 大規模グラフ上の効率の良いアルゴリズムの開発
- Study of Efficient Algorithms
Show all
Papers (336):
-
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara. Computational complexity of jumping block puzzles. Theor. Comput. Sci. 2024. 983. 114292-114292
-
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono 0001, Ryuhei Uehara. On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM. 2024. 55-68
-
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka. Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 2023. 978. 114158-114158
-
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang. Any platonic solid can transform to another by O(1) refoldings. Computational Geometry: Theory and Applications. 2023. 113
-
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara. On the Computational Complexity of Generalized Common Shape Puzzles. CoRR. 2023. abs/2305.10749
more...
MISC (48):
-
番原 睦則, 橋本 健二, 堀山 貴史, 湊 真一, 中村 駆, 西野 正彬, 酒井 正彦, 上原 隆平, 宇野 裕之, 安田 宜仁. レプ・タイルの定式化を用いた各種ソルバの性能比較. 人工知能学会研究会資料 人工知能基本問題研究会. 2022. 119. 02-07
-
JIA Yiyang, MITANI Jun, UEHARA Ryuhei. Research on Map Folding with Boundary Order on Simple Fold. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web). 2021. E104.A. 9
-
JIA Yiyang, 三谷純, 上原隆平. 外周部の順序が与えられた地図折り問題の解法. 日本応用数理学会年会講演予稿集(CD-ROM). 2020. 2020
-
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara. Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. 2017. 58. 8
-
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi. Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. 2017. 58. 8
more...
Books (51):
-
『数学セミナー』パズルの算法/パズルソルバ
日本評論社 2022
-
理論計算機科学事典
朝倉書店 2022
-
『数学セミナー』パズルの算法/クロスバーパズル
日本評論社 2022
-
『数学セミナー』パズルの算法/ルービック・キューブ
日本評論社 2021
-
『数学セミナー』パズルの算法/アンチスライドパズル
日本評論社 2021
more...
Lectures and oral presentations (138):
-
Reconfiguration of vertex-disjoint shortest paths on graphs
(The 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023))
-
Unsupervised Discovery of Tonality in Bach's Chorales
(The 16th International Conference on Knowledge, Information and Creativity Support Systems (KICSS 2021))
-
Efficient Enumeration of Non-isomorphic Block-Cutpoint Trees
(The 5th Workshop on Enumeration Problems and Applications (WEPA 2022))
-
Discretization to Prove the Nonexistence of Small Common Unfoldings Between Polyhedra
(The 34th Canadian Conference on Computational Geometry (CCCG 2022))
-
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
(The 34th Canadian Conference on Computational Geometry (CCCG 2022))
more...
Education (4):
- - 1991 The University of Electro-Communications
- - 1991 The University of Electro-Communications Graduate School, Division of Electro Communications
- - 1989 The University of Electro-Communications Faculty of Electro-Communications
- - 1989 The University of Electro-Communications Faculty of Electro Communications
Professional career (2):
- 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)
- 修士(工学) (電気通信大学)
Work history (2):
- 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
Awards (2):
- 2012/03/07 - Information Processing Society of Japan IPSJ Yamashita SIG Research Award
- 2009/02/04 - EATCS Japan Chapter and LA Symposium EATCS/LA Best Presentation Award
Association Membership(s) (5):
Information Processing Society of Japan
, The Institute of Electronics, Information and Communication Engineers
, ACM
, EATCS
, IEEE
Return to Previous Page