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
Unsupervised Discovery of Tonality in Bach's Chorales
Yui Uehara, Satoshi Tojo, Ryuhei Uehara
Journal of Intelligence Informatics and Smart Technology, 8, 10:1-10:7, 2022
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
18th Scandinavian Symposium and Workshops on Algorithm Theory, -, 2022
Efficient Segment Folding is Hard Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Computational Geometry, 104, 101860-101860, 2022
Rolling Polyhedra on Tessellations
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
11th International Conference on Fun with Algorithms (FUN 2022), -, 2022
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
11th International Conference on Fun with Algorithms (FUN 2022), abs/2202.09495, -, 2022
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo Akitaya, Erik Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
38th European Workshop on Computational Geometry (EuroCG 2022), -, 2022
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
11th International Conference on Fun with Algorithms (FUN), 16:1-16:17, 2022
Token Shifting on Graphs Win Hlaing, Hlaing Myint, Ryuhei Uehara
International Journal of Computer Mathematics: Computer Systems Theory, -, 2022
Computational Complexity of Puzzles and Related Topics
Ryuhei Uehara
Interdisciplinary Information Sciences, -, 2022
Developing a Tetramonohedron with Minimum Cut Length
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Computational Geometry: Theory and Applications, -, 2022
Unsupervised Discovery of Tonality in Bach's Chorales
Yui Uehara, Satoshi Tojo, Ryuhei Uehara
The 16th International Conference on Knowledge, Information and Creativity Support Systems (KICSS 2021), -, 2021
Token Shifting on Graphs
Win Hlaing, Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
COCOON 2021, 643-654, 2021
Max-Min 3-dispersion Problems Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
IEICE Trans., E104-A, 9, 1101-1107, 2021
Multilayer tiles
Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, Ryuhei Uehara
TJCDCGGG 2020+1, 28-29, 2021
Logical Matrix Representations in Map Folding
Yiyang Jia, Jun Mitani, Ryuhei Uehara
TJCDCGGG 2020+1, 106-107, 2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
The Canadian Conference on Computational Geometry (CCCG 2021), 332-342, 2021
Bicolored Path Embedding Problems in Protein Folding Models
Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta
The 37th European Workshop on Computational Geometry (EuroCG 2021), 24:1-24:9, 2021
パズルとゲームと計算量
上原隆平
日本シミュレーション学会誌, 40, 1, 29-34, 2021
Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara, Masao Hara
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 321-332, 2021
Cyclic Shift Problems on Graphs
Giovanni Viglietta, Ryuhei Uehara, Kwon Kham Sai
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 308-320, 2021
Toward Unfolding Doubly Covered n-Stars Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O’Rourke, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13034, 122-135, 2021
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
CoRR, abs/2110.05184, -, 2021
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 285-295, 2020
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
The 34th International Symposium on Distributed Computing (DISC 2020), LIPIcs 179, 12:1-12:17, 2020
「折り紙科学」へのお誘い
上原隆平
電子情報通信学会誌, 103, 10, 1048-1049, 2020
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces, Computational Geometry Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssene, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Theory and Applications, 90, 101648-101648, 2020
Efficient Folding Algorithms for Regular Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
CCCG 2020, 131-137, 2020
On Computational Complexity of Pipe Puzzles
Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara
IEICE Trans. on Inf. and Sys., E102-A, 9, 1134-1141, 2019
Simple Fold and Cut Problem for Line Segments
Guoxin Hu, Shinichi Nakano, Ryuhei Uehara, Takeaki Uno
Proc. of CCCG 2019, 158-163, 2019
計算折り紙について (小特集 折り紙の科学) 上原 隆平
電子情報通信学会誌 = The journal of the Institute of Electronics, Information and Communication Engineers, 102, 4, 297-299, 2019
Ecient Segment Folding is Hard. Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Proceedings of the 31st Canadian Conference on Computational Geometry(CCCG), 177-183, 2019
Reconfiguring Undirected Paths. Erik D. Demaine, David Eppstein,Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
CoRR, abs/1905.00518, 353-365, 2019
Efficient Algorithm for Box Folding. Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, 277-288, 2019
Reconfiguring Undirected Paths. Erik D. Demaine, David Eppstein,Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings, 353-365, 2019
Max-Min 3-Dispersion Problems. Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings, 291-300, 2019
Swapping colored tokens on graphs Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Theoretical Computer Science, 729, 1-10, 2018
Othello Font
Khorramian Amanj, Taniguchi Tomoko, Uno Takeaki, Uehara Ryuhei
電子情報通信学会コンピューテーション研究会資料, -, 2018
Complexity of the Maximum k-Path Vertex Cover Problem Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10755, 240-251, 2018
Computational Complexity of Robot Arm Simulation Problems. Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto,Array, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, 10979, 177-188, 2018
Exact Algorithms for the Max-Min Dispersion Problem. Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings, 263-272, 2018
Bumpy pyramid folding Zachary R. Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Computational Geometry: Theory and Applications, 75, 22-31, 2018
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
Journal of Information Processing, 25, 708-715, 2017
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
Journal of Information Processing, 25, 610-615, 2017
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
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 10167, 435-447, 2017
Rep-cubes: Unfolding and Dissection of Cubes. Dawei Xu, Takashi Horiyama, Ryuhei Uehara
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada, 62-67, 2017
Computational Complexity of Sequential Token Swapping Problem (コンピュテーション) 山中 克久, ドメイン エリック, 堀山 貴史, 河村 彰星, 中野 眞一, 岡本 吉央, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 116, 115-121, 2016
シーケンシャルな交換による色付きトークン整列問題の計算複雑さ
山中 克久, エリック ドメイン, 堀山 貴史, 河村 彰星, 中野 眞一, 岡本 吉央, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明
第158回アルゴリズム研究会, 1-7, 2016
ON A STIFFNESS MODEL FOR ORIGAMI FOLDING Yusuke Nakada, Yota Fujieda, Taisei Mori, Hitoshi Iwai, Kazumasa Nakaya, Ryuhei Uehara, Masashi Yamabe
INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 5B, 5B-2015, -, 2016
ON A STIFFNESS MODEL FOR ORIGAMI FOLDING Yusuke Nakada, Yota Fujieda, Taisei Mori, Hitoshi Iwai, Kazumasa Nakaya, Ryuhei Uehara, Masashi Yamabe
INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 5B, -, 2016
Box Pleating is Hard Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 167-179, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
Box Pleating is Hard Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 167-179, 2016
Single-Player and Two-Player Buttons & Scissors Games Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loeffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 60-72, 2016
Single-Player and Two-Player Buttons & Scissors Games Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loeffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 60-72, 2016
Sliding Tokens on a Cactus. Ryuhei Uehara
27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, 37:1-37:26-, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
Linear-time algorithm for sliding tokens on trees Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachic, Ryuhei Uehara, Takeshi Yamada
THEORETICAL COMPUTER SCIENCE, 600, 132-142, 2015
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings, 8973, 294-305, 2015
Folding a Paper Strip to Minimize Thickness. Erik D. Demaine, David Eppstein,Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings, 8973, 113-124, 2015
Swapping colored tokens on graphs Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 619-628, 2015
Competitive diffusion on weighted graphs Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 422-433, 2015
Swapping colored tokens on graphs Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 619-628, 2015
Base-object location problems for base-monotone regions Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
THEORETICAL COMPUTER SCIENCE, 555, 71-84, 2014
Depth-First Search Using O(n) Bits Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 553-564, 2014
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
CoRR, abs/1412.3334, -, 2014
Polynomial-Time Algorithm for Sliding Tokens on Trees Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 389-400, 2014
Depth-First Search Using O(n) Bits Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 553-564, 2014
Polynomial-Time Algorithm for Sliding Tokens on Trees Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 389-400, 2014
Bumpy Pyramid Folding. Zachary Abel,Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, -, 2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr,Birgit Vogtenhuber, Emo Welzl
Discrete Mathematics & Theoretical Computer Science, 16, 3, 317-332, 2014
グラフの独立点集合遷移問題に対するアルゴリズム Demaine Erik D, Demaine Martin L, 伊藤 健洋, 小野 廣隆, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 113, 371, 7-14, 2013
DS-1-11 Free Flood Filling Gameの計算複雑性について(DS-1.COMP学生シンポジウム,シンポジウムセッション) 福井 宏行, 中西 朗裕, 大舘 陽太, 上原 隆平, 宇野 毅明, 宇野 裕之
電子情報通信学会総合大会講演論文集, 2013, 1, "S-21"-"S-22", 2013
Base location problems for base-monotone regions Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7748, 53-64, 2013
Zipper Unfoldability of Domes and Prismoids. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, -, 2013
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, 16, 3, 317-332, 2013
Variations on instant insanity Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8066, 33-47, 2013
Coverage with k-transmitters in the presence of obstacles Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán, Diane Souvaine, Ryuhei Uehara
Journal of Combinatorial Optimization, 25, 2, 208-233, 2013
トロミノ詰込問題の計算複雑さについて 堀山 貴史, 伊藤 健洋, 中束 渓太, 鈴木 顕, 上原 隆平
電子情報通信学会技術研究報告. COMP, コンピュテーション, 112, 272, 37-43, 2012
単位正方形上の一意被覆問題に対する近似アルゴリズム 伊藤 健洋, 中野 眞一, 岡本 吉央, 大舘 陽太, 上原 隆平, 宇野 毅明, 宇野 裕之
電子情報通信学会技術研究報告. COMP, コンピュテーション, 112, 93, 95-101, 2012
GHOST CHIMNEYS David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 22, 3, 207-214, 2012
基単調図形に分割可能な最大重み領域を得る基線の配置問題 堀山 貴史, 伊藤 健洋, ガオタントン ナスダ, 小野 廣隆, 大舘 陽太, 徳山 豪, 上原 隆平, 宇野 毅明
電子情報通信学会技術研究報告. COMP, コンピュテーション, 112, 21, 37-43, 2012
区間表現をもつグラフ上でのFloodingゲームの複雑さ
福井 宏行, 上原 隆平, 宇野 毅明, 宇野 裕之
第139回情報処理学会アルゴリズム研究会, 2012-AL-139, 7, 1-8, 2012
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 372-381, 2012
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 211-216, 2012
Covering Points with Disjoint Unit Disks. Greg Aloupis,Robert, A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 41-46, 2012
The Complexity of Free Flood Filling Games
福井宏行, 中西朗裕, 上原隆平, 宇野毅明, 宇野裕之
第195回電子情報通信学会コンピュテーション研究会, 195, 47-51, 2011
Voronoi Game on a Path Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 6, 1185-1189, 2011
Algorithmic Folding Complexity Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
GRAPHS AND COMBINATORICS, 27, 3, 341-351, 2011
On the complexity of reconfiguration problems Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
THEORETICAL COMPUTER SCIENCE, 412, 12-14, 1054-1065, 2011
Common Developments of Several Different Orthogonal Boxes. Zachary Abel,Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, -, 2011
パス上のボロノイゲーム 清見 礼, 斎藤 寿樹, 上原 隆平
電子情報通信学会技術研究報告. COMP, コンピュテーション, 110, 37, 1-5, 2010
一般化KaboozleのNP完全性 浅野 哲夫, ErikD.Demaine, MartinL.Demaine, 上原 隆平
研究報告アルゴリズム（AL）, 2010, 3, 1-6, 2010
The complexity of UNO Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
CoRR, abs/1003.2851, -, 2010
Coverage with k-Transmitters in the Presence of Obstacles Brad Ballinger, Nadia Benbernou, Prosenjit Bose, La Damian, Erik D. Demaine, Vida Dujmovic, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristan, Diane Souvaine, Ryuhei Uehara
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 1-+, 2010
Ghost chimneys. David Charlton, Erik D. Demaine, Martin L, Demaine,Vida Dujmovic, Pat Morin, Ryuhei Uehara
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, 63-66, 2010
Scale free interval graphs Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
Theoretical Computer Science, 410, 45, 4588-4600, 2009
あみだくじの高速列挙 山中 克久, 中野 眞一, 松井 泰子, 上原 隆平, 仲田 研登
電子情報通信学会技術研究報告. COMP, コンピュテーション, 108, 443, 17-23, 2009
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings Sandip Das, Ryuhei Uehara
WALCOM 2009, 5431, -, 2009
Algorithmic Folding Complexity Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 452-+, 2009
How to make a picturesque maze. Yoshio Okamoto, Ryuhei Uehara
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009, 137-140, 2009
折り紙とコンピュータサイエンス 上原 隆平
電子情報通信学会誌 = THE JOURNAL OF THE INSTITUTE OF ELECTRONICS, INFOMATION AND COMMUNICATION ENGINEERS, 91, 6, 506-509, 2008
コーダルグラフの完全列の列挙 松井 泰子, 上原 隆平, 宇野 毅明
電子情報通信学会コンピュテーション研究会, 108, 11, 15-21, 2008
On the Complexity of Reconfiguration Problems Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5369, 28-+, 2008
Inverting Linkages with Stretch. Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, -, 2008
Scale free interval graphs Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 5034, 292-+, 2008
Simple Efficient Algorithm for MPQ-tree of an Interval Graph
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Proceedings of the KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), 121-126, 2007
単純多角形の生成に関する発見的手法 寺本 幸生, 元木 光雄, 上原 隆平, 浅野 哲夫
情報処理学会研究報告アルゴリズム（AL）, 2006, 49, 41-48, 2006
距離遺伝的グラフの木表現とその応用 上原 隆平, 宇野 毅明
電子情報通信学会技術研究報告. COMP, コンピュテーション, 105, 679, 31-38, 2006
Special section on discrete mathematics and its applications Keiko Imai, Hisashi Koga, Mitsuru Matsui, Tomomi Matsui, Atsuko Miyaji, Kunihiko Sadakane, Tetsuo Shibuya, Akiyoshi Shioura, Tsuyoshi Takagi, Yasuhiko Takenaga, Eiji Takimoto, Keisuke Tanaka, Tatsuie Tsukiji, Ryuhei Uehara, Takeaki Uno, Koichi Yamazaki, Satoshi Fujita
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1159-, 2006
The Complexity of a Pop-Up Book. Ryuhei Uehara, Sachio Teramoto
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada, 2006, 71, 59-64, 2006
グラフクラスとアルゴリズム 上原 隆平
電子情報通信学会誌 = THE JOURNAL OF THE INSTITUTE OF ELECTRONICS, INFOMATION AND COMMUNICATION ENGINEERS, 88, 2, 118-122, 2005
Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles
Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara
Canadian Conference on Computational Geometry, 105-108, 2002
Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem
Mitsuo Motoki, Ryuhei Uehara
SAT 2000, 293-307, 2000
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. Ryuhei Uehara, Zhi-Zhong Chen
Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, 1872, 84-98, 2000
グラフの連結成分の個数と応用 上原 隆平
電子情報通信学会技術研究報告. COMP, コンピュテーション, 99, 86, 1-8, 1999
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 17-19, 1997, Proceedings, 171-184, 1997
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings, 209-218, 1996
log(k)nの領域強構成可能性について
上原隆平
電子情報通信学会技術研究報告, 93, 139, 59-, 1993