Refereed International Conferences

  1. Kaori Kuribayashi, Takashi Horiyama, and Ryuhei Uehara. What is the ideal origami development diagram for cells? -- 3D tissues produced by origami and micro/nano technologies --, JSME The 8th International Conference on Advanced Mechatronics (ICAM 2024), accepted, 2024/11/06-2024/11/08, Kitakyushu, Japan.
  2. Dong Yang, Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis, The 5th International Workshop on Combinatorial Reconfiguration (CoRe 2024), accepted, 2024/10/7-2024/10/11, Kyushu University, Japan.
  3. Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara and Hanyu Alice Zhang. All Polyhedral Manifolds are Connected by a 2-Step Refolding The 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2024), accepted, 2024/09/10-12, Tokyo, Japan
  4. Yuta Nomi, Takumi Shiota, Tonan Kamata, and Ryuhei Uehara. Dissections of a Net of a Regular Octahedron into Nets of Regular Octahedra The 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2024), accepted, 2024/09/10-12, Tokyo, Japan
  5. Tomoko Taniguchi Ryuhei Uehara. Hexagonal Puzzle Font, The 21st International Conference on Geometry and Graphics (ICGG 2024), Lecture Notes on Data Enginerring and Communications Technologies, Vol. 217, pp. 63-68, 2024/08/05-2024/08/09, Fukuoka, Japan
  6. Kaori Kuribayashi-Shigetomi, Takashi Horiyama and Ryuhei Uehara. 3D tissues using truncated octahedron blocks produced by Origami and micro/nano processing technologies, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  7. Koji Ouchi, Hideo Komatsu, and Ryuhei Uehara. Efficient Enumeration of Rectangles in Origami Design, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  8. Takumi Shiota, Tonan Kamata, and Ryuhei Uehara. A Complete Classification of the Overlap-free Polyhedra, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  9. Tomoko Taniguchi and Ryuhei Uehara. Research on construction of double cubic core and its application, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  10. Ryuhei Uehara. A Survey of Rep-cube, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  11. Ryuhei Uehara. Optimal Simple Fold-and-Cut of a Polygonal Line, The 8th International Meeting on Origami in Science, Mathematics and Education (8OSME), accepted, 2024/07/16-2024/07/18, Melbourne, Australia.
  12. Yuki Iburi and Ryuhei Uehara. Computational Complexity of Matching Match Puzzle, 12th International Conference on Fun with Algorithms (FUN 2024), LIPIcs Volume 291, pp. 17:1-17:10, 2024/06/04-2024/06/08, Island of La Maddalena, Sardinia, Italy.
  13. Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub and Ryuhei Uehara. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis, The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), LNCS Vol. 14549, pp. 242-256, 2024/03/18-03/20, Kanazawa, Japan.
  14. Mutsunori Banbara, Shin-Ichi Minato, Hirotaka Ono and Ryuhei Uehara. On the Computational Complexity of Generalized Common Shape Puzzles, The 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024), LNCS Vol. 14519, pp. 55-68, 2024/02/19-02/23, Cochem, Germany.
  15. Takashi Horiyama, Tonan Kamata, Hironori Kiya, Hirotaka Ono, Takumi Shiota, Ryuhei Uehara and Yushi Uno. Critical Sets of n-omino Sudoku, The 25th Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games, 2023/09/22-24, Bali, Indonesia.
  16. Ryuhei Uehara. Optimal Simple Fold-and-Cut of a Polygonal Line, Minisymposium in ICIAM, 2023/08/23, Waseda, Japan.
  17. Takumi Shiota, Tonan Kamata, and Ryuhei Uehara. Overlapping of Lattice Unfolding for Cuboids, The 35th Canadian Conference on Computational Geometry (CCCG 2023), pp. 27-33, 2023/07/31-2023/08/04, Montreal, Quebec, Canada.
  18. Rin Saito, Hiroshi Eto, Takehiro Ito and Ryuhei Uehara. Reconfiguration of vertex-disjoint shortest paths on graphs, The 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), LNCS Vol. 13973, pp. 191-201, 2023/03/22-03/24, Hsinchu, Taiwan (Hybrid).
  19. Mengze Qian and Ryuhei Uehara. Efficient Enumeration of Non-isomorphic Block-Cutpoint Trees, The 5th Workshop on Enumeration Problems and Applications (WEPA 2022), pp.??-?? (2 pages), 2022/11/22-11/25, Clermont-Ferrand, France.
  20. Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas Hull, Klara Mundilova and Josef Tkadlec. Quasi-Twisting Convex Polyhedra, The 34th Canadian Conference on Computational Geometry (CCCG 2022), pp. 270-276, 2022/08/25-2022/08/27, Toronto, Ontario, Canada.
  21. Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai and Ryuhei Uehara. Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature, The 34th Canadian Conference on Computational Geometry (CCCG 2022), pp. 177-183, 2022/08/25-2022/08/27, Toronto, Ontario, Canada.
  22. Erik D. Demaine, Hiro Ito, Jayson Lynch and Ryuhei Uehara. Computational Complexity of Flattening Fixed-Angle Orthogonal Chains, The 34th Canadian Conference on Computational Geometry (CCCG 2022), pp. 98-104, 2022/08/25-2022/08/27, Toronto, Ontario, Canada.
  23. Elena Arseneva, Erik D. Demaine, Tonan Kamata and Ryuhei Uehara. Discretization to Prove the Nonexistence of Small Common Unfoldings Between Polyhedra. The 34th Canadian Conference on Computational Geometry (CCCG 2022), pp. 9-15, 2022/08/25-2022/08/27, Toronto, Canada.
  24. Tomoko Taniguchi and Ryuhei Uehara. Rep-tile Font, Bridges Aalto 2022, accepted, 2022/08/01-2022/08/05, Helsinki and Espoo, Finland.
  25. Hugo Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms. Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), accepted, 2022/06/27-2022/06/29, Faroe Islands.
  26. Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno and Aaron Williams. Rolling Polyhedra on Tessellations, 11th International Conference on Fun with Algorithms (FUN2022), LIPIcs Volume 226, pp. 6:1-6:16, 2022/05/30-2022/06/03, Island of Favignana, Sicily, Italy. DOI:10.4230/LIPIcs.FUN.2022.6
  27. Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka. Sorting Balls and Water: Equivalence and Computational Complexity, 11th International Conference on Fun with Algorithms (FUN 2022), LIPIcs Volume 226, pp. 16:1-16:17, 2022/05/30-2022/06/03, Island of Favignana, Sicily, Italy. DOI:10.4230/LIPIcs.FUN.2022.16
  28. Hugo Akitaya, Erik Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara and Jules Wulms. Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares, 38th European Workshop on Computational Geometry (EuroCG 2022), pp.19:1-19:7, 2022/03/14-2022/03/16, Perugia, Italy.
  29. Yui Uehara, Satoshi Tojo, and Ryuhei Uehara. Unsupervised Discovery of Tonality in Bach's Chorales, The 16th International Conference on Knowledge, Information and Creativity Support Systems (KICSS 2021), 2021/11/24-2021/11/26, Bangkok, Thailand (Online). (Presentation Awards)
  30. Win Hlaing Hlaing Myint, Ryuhei Uehara, and Giovanni Viglietta. Token Shifting on Graphs, COCOON 2021, LNCS Vol. 13025, pp. 643-654, 2021/10/24-2021/10/26, Tainan, Taiwan.
  31. Masaaki Kanzaki, Yota Otachi, and Ryuhei Uehara. Computational Complexity of Jumping Block Puzzles, COCOON 2021, LNCS Vol. 13025, pp. 655-667, 2021/10/24-2021/10/26, Tainan, Taiwan.
  32. Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, and Ryuhei Uehara. Multilayer tiles, TJCDCGGG 2020+1, pp. 28-29, 2021/09/03-2021/09/05, Chiang Mai University, Thailand (Online).
  33. Yiyang Jia, Jun Mitani and Ryuhei Uehara. Logical Matrix Representations in Map Folding, TJCDCGGG 2020+1, pp. 106-107, 2021/09/03-2021/09/05, Chiang Mai University, Thailand (Online).
  34. Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, and Hanyu Alice Zhang. Any Regular Polyhedron Can Transform to Another by O(1) Refoldings, The 33rd Canadian Conference on Computational Geometry (CCCG 2021), pp. 332-342, 2021/08/10-12, Halifax, Nova Scotia, Canada (Online).
  35. Tianfeng Feng, Ryuhei Uehara and Giovanni Viglietta. Bicolored Path Embedding Problems in Protein Folding Models, The 37th European Workshop on Computational Geometry (EuroCG 2021), pp. 24:1-9, 2021/04/07-09, Saint Petersburg, Russia (Online).
  36. Ko Minamisawa, Ryuhei Uehara, and Masao Hara. Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles, The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS Vol. 12635, pp. 321-332, 2021/02/28-03/02, Yangon, Myanmar (Online). DOI:10.1007/978-3-030-68211-8_26
  37. Giovanni Viglietta, Ryuhei Uehara, and Kwon Kham Sai. Cyclic Shift Problems on Graphs, The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS Vol. 12635, pp. 308-320, 2021/02/28-03/02, Yangon, Myanmar (Online). DOI:10.1007/978-3-030-68211-8_25
  38. Kazuaki Yamazaki, Mengze Qian, and Ryuhei Uehara. Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs, The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS Vol. 12635, pp. 285-295, 2021/02/28-03/02, Yangon, Myanmar (Online). DOI:10.1007/978-3-030-68211-8_23
  39. Kazuaki Yamazaki, Mengze Qian, and Ryuhei Uehara. Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs, Fourth International Workshop on Enumeration Problems and Applications (WEPA 2020), 2020/12/07-2020/12/10, (Online).
  40. Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, and Yukiko Yamauchi. Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots, The 34th International Symposium on Distributed Computing (DISC 2020), LIPIcs Volume 179, pp. 12:1-12:17, 2020/10/12-2020/10/16, Freiburg, Germany (Online). DOI:10.4230/LIPIcs.DISC.2020.12
  41. Tonan Kamata, Akira Kadoguchi, Takashi Horiyama and Ryuhei Uehara, Efficient Folding Algorithms for Regular Polyhedra, The 32nd Canadian Conference on Computational Geometry (CCCG 2020), pp. 131-137, 2020/08/05-2020/08/07, University of Saskatchewan, Canada (Online).
  42. Dat Hoang Tran and Ryuhei Uehara: Efficient Enumeration of Non-isomorphic Ptolemaic Graphs, The 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science, Vol. 12049, pp. 296-307, 2020/03/31-04/02, National University of Singapore, Singapore (Online). DOI:10.1007/978-3-030-39881-1_25.
  43. Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki and Ryuhei Uehara: On the Complexity of Lattice Puzzles The 30th International Symposium on Algorithms and Computation (ISAAC 2019), LIPIcs Volume 149, pp. 32:1-12, 2019/12/09-11, Shanghai, China. DOI:10.4230/LIPIcs.ISAAC.2019.32.
  44. Ryuhei Uehara: Rep-cube and related results (Special talk), Symmetry: Art and Science - 11th Congress and Exhibition, pp. 282-285, 2019/11/25-30, Kanazawa, Japan.
  45. Ryuhei Uehara: Introduction to Computational Origami (Keynote Speaker), The 11th International Conference on Knowledge and Systems Engineering (KSE 2019), 2019/10/24-26, Da Nang, Vietnam.
  46. Yiyang Jia, Jun Mitani and Ryuhei Uehara: Efficient Algorithm for 2xn Map Folding with Diagonal Creases, JCDCGGG 2019, pp. 81-83, 2019/09/06-08, Tokyo, Japan.
  47. Takashi Horiyama, Kazuhiro Kurita, Yoshio Okamoto, Kei Uchizawa and Ryuhei Uehara: Mind The Mind with Synchronous Clocks, JCDCGGG 2019, pp. 71-72, 2019/09/06-08, Tokyo, Japan.
  48. Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi and Ryuhei Uehara: Minimal Ununfoldable Polyhedron, JCDCGGG 2019, pp. 27-28, 2019/09/06-08, Tokyo, Japan.
  49. Fabian Klute, Irene Parada, Takashi Horiyama, Matias Korman, Ryuhei Uehara and Katsuhisa Yamanaka: Efficient Segment Folding is Hard, CCCG 2019, pp. 182-188, 2019/08/08-10, Edmonton, Canada.
  50. Koji Ouchi and Ryuhei Uehara: Minimum Forcing Sets for Single-Vertex Crease Pattern, CCCG 2019, pp. 176-181, 2019/08/08-10, Edmonton, Canada.
  51. Martin L. Demaine, Robert Hearn, Jason S. Ku and Ryuhei Uehara: Rectangular Unfoldings of Polycubes, CCCG 2019, pp. 164-168, 2019/08/08-10, Edmonton, Canada.
  52. Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara and Takeaki Uno: Simple Fold and Cut Problem for Line Segments, CCCG 2019, pp. 158-163, 2019/08/08-10, Edmonton, Canada.
  53. Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara and Yushi Uno: Reconfiguring Undirected Paths, WADS 2019, Lecture Notes in Computer Science, Vol. 11646, pp. 353-365, 2019/08/05-2019/08/07, Edmonton, Canada. DOI:10.1007/978-3-030-24766-9-26.
  54. Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, and Kunihiro Wasa: Max-Min 3-dispersion Problems, 27th International Computing and Combinatorics Conference (COCOON 2019), Lecture Notes in Computer Science, Vol. 11653, pp. 291-300, 2019/07/29-2019/07/31, Xian, China. DOI:10.1007/978-3-030-26176-4_24.
  55. Erik D. Demaine, Martin L. Demaine, Tomoko Taniguchi, and Ryuhei Uehara: Impossible Folding Font, Bridges 2019, pp. 51-58, 2019/07/16-2019/07/20, Linz, Austria.
  56. Duc A. Hoang, Amanj Khorramian and Ryuhei Uehara: Shortest Reconfiguration Sequence for Sliding Tokens on Spiders, The 11th International Conference on Algorithms and Complexity (CIAC 2019), Lecture Notes in Computer Science, Vol. 11485, pp. 262-273, 2019/05/27-2019/05/29, Rome, Italy. DOI:10.1007/978-3-030-17402-6_22.
  57. Katsuhisa Yamanaka, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara and Tanami Yamauchi: Algorithmic Enumeration of Surrounding Polygons, EuroCG 2019, 2019/03/18-2019/03/20, Utrecht, Netherlands.
  58. Koichi Mizunashi, Takashi Horiyama, and Ryuhei Uehara: Efficient Algorithm for Box Folding, The 13th International Conference and Workshop on Algorithms and Computation (WALCOM 2019), Lecture Notes in Computer Science, Vol. 11355, pp. 277-288, 2019/02/27-2019/03/02, IIT Guwahati, India. JAIST Repository
  59. Kaori Kuribayashi-Shigetomi, Takashi Horiyama, Qian He and Ryuhei Uehara: Folding 3D Cell Shapes Optimized by Computational Origami, The 7th International Meeting on Origami in Science, Mathematics and Education (7OSME), accepted, 2018/09/05-2018/09/07, Oxford, United Kingdom.
  60. Kazuki Ohshima, Ryuhei Uehara, and Jun Mitani: Optimal Solution Search for the Origami Checkerboard Puzzle, The 7th International Meeting on Origami in Science, Mathematics and Education (7OSME), pp. 465-477, 2018/09/05-2018/09/07, Oxford, United Kingdom.
  61. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, and Andrew Winslow: How Efficiently Can Nets of Polycubes Pack a Rectangle? JCDCG3, pp. 109-111, 2018/09/01-2018/09/03, Manila, Philippine.
  62. Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Irina Kostitsyna, Jason S. Ku, Stephan Langerman, Joseph O'Rourke, and Ryuhei Uehara: Toward Unfolding Doubly Covered n-Stars, JCDCG3, pp. 67-68, 2018/09/01-2018/09/03, Manila, Philippine. (LNCS Vol. 13034, pp. ??-??, Springer, 2021.)
  63. Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara: Tetramonohedron Development with Minimum Cut Length, JCDCG3, pp. 64-66, 2018/09/01-2018/09/03, Manila, Philippine.
  64. Duc A. Hoang, Amanj Khorramian, and Ryuhei Uehara: Shortest Reconfiguration Sequence for Sliding Tokens on Spiders, The 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018), 2018/08/26-2018/08/27, Fukuoka, Japan.
  65. Takumu Shirayama, Yota Otachi, and Ryuhei Uehara: On Computational Complexity of Pipe Puzzles, The 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018), 2018/08/26-2018/08/27, Fukuoka, Japan.
  66. Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, and Ryuhei Uehara: Computational Complexity of Robot Arm Simulation Problems, The 12th International Workshop on Combinatorial Algorithms (IWOCA 2018), Lecture Notes in Computer Science, Vol. 10979, pp. 177-188, 2018/07/16-2018/07/19, Singapore.
  67. Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa: Exact Algorithms for the Max-Min Dispersion Problem, 12th International Frontiers of Algorithmics Workshop (FAW 2018), Lecture Notes in Computer Science, Vol. 10823, pp. 263-272, 2018/05/08-10, Guangzhou University, China. JAIST Repository
  68. Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi and Ryuhei Uehara: Enumeration of Nonisomorphic Graphs in Graph Classes, The 12th International Conference and Workshop on Algorithms and Computation (WALCOM 2018), Lecture Notes in Computer Science, Vol. 10755, pp. 8-19, 2018/03/03-05, Dhaka, Bangladesh. JAIST Repository
  69. Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita and Tom van der Zanden: Complexity of the Maximum k-Path Vertex Cover Problem, The 12th International Conference and Workshop on Algorithms and Computation (WALCOM 2018), Lecture Notes in Computer Science, Vol. 10755, pp. 240-251, 2018/03/03-05, Dhaka, Bangladesh. JAIST Repository
  70. Ryuhei Uehara: Folding and unfolding algorithms on (super)computer (Keynote Speaker), The 5th International Symposium on Computing and Networking (CANDAR 2017), 2017/11/19-22, Aomori, Japan.
  71. Dawei Xu, Takashi Horiyama, and Ryuhei Uehara: Rep-cubes: Dissection of a Cube into Nets, The 20th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2017), 2017/8/25-26, Hanyang University, Seoul, Korea.
  72. Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: On the Enumeration of Chequered Tilings in Polygons, Bridges 2017, pp. 423-426, 2017/07/27-2017/07/31, Ontario, Canada. JAIST Repository
  73. Taishi Oikawa, Kazuaki Yamazaki, Tomoko Taniguchi, and Ryuhei Uehara: A Peg Solitaire Font, Bridges 2017, pp. 183-188, 2017/07/27-2017/07/31, Ontario, Canada. JAIST Repository
  74. Dawei Xu, Takashi Horiyama, and Ryuhei Uehara: Rep-cubes: Unfolding and Dissection of Cubes, The 29th Canadian Conference on Computational Geometry (CCCG 2017), pp. 62-67, 2017/07/26-2017/07/28, Ottawa, Canada. JAIST Repository
  75. Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: On the Enumeration of Chequered Tilings in Polygons, The 10th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2017), 2017/05/05-2017/05/07, Hong Kong.
  76. Duc Hoang, Eli Fox-Epstein and Ryuhei Uehara: Sliding tokens on block graphs, The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science, Vol. 10167, pp. 460-471, 2017/03/29-2017/03/31, Hsinchu, Taiwan. JAIST Repository
  77. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara and Takeaki Uno: Sequentially Swapping Colored Tokens on Graphs, The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science, Vol. 10167, pp. 435-447, 2017/03/29-2017/03/31, Hsinchu, Taiwan.
  78. Koji Ouchi and Ryuhei Uehara: Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns, The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science, Vol. 10167, pp. 19-29, 2017/03/29-2017/03/31, Hsinchu, Taiwan. JAIST Repository
  79. Ryuhei Uehara: Survey and Recent Results on Reconfiguration Problems (Invited Talk), The 2nd Workshop on Advanced Information Technology 2016, 2016/12/16-2016/12/19, University of Information Technology, Yangon, Myanmar.
  80. Duc A. Hoang and Ryuhei Uehara: Sliding Tokens on a Cactus, The 27th International Symposium on Algorithms and Computation (ISAAC 2016), LIPIcs Volume 64, 37:1-37:26, 2016/12/12-2016/12/14, Sydney, Australia. JAIST Repository
  81. Zachary Abel, Brand Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara: Unfolding and Dissection of Multiple Cubes, JCDCG3, 2016/09/02-2016/09/04, Tokyo, Japan. JAIST Repository
  82. Zachary Abel, Brand Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara: Dissection of Unfolding of Cubes and Its Generalization, WAAC 2016, 2016/08/30-2016/08/31, Hakodate, Japan.
  83. Takashi Horiyama, Ryuhei Uehara and Haruo Hosoya: Convex Configurations on Nana-kin-san Puzzle, FUN with Algorithms, LIPICS Vol. 49, pp. 20:1-20:14, 2016/06/08-2016/06/10, Maddalena Islands, Italy. DOI:10.4230/LIPIcs.FUN.2016.20, JAIST Repository
  84. Takeshi Yamada and Ryuhei Uehara: Shortest Reconfiguration of Sliding Tokens on a Caterpillar, The 10th International Workshop on Algorithms and Computation (WALCOM 2016), Lecture Notes in Computer Science, Vol. 9627, pp. 236-248, 2016/03/29-2016/03/31, Kathmandu, Nepal. JAIST Repository
  85. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara: Sliding Token on Bipartite Permutation Graphs, The 26th International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science, Vol. 9472, pp. 237-247, 2015/12/9-2015/12/11, Nagoya, Japan. JAIST Repository
  86. Kazuho Katsumata and Ryuhei Uehara: Convex Configurations of Dissection Puzzles with Seven Pieces, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), 2015/09/14-2015/09/16, Kyoto University, Kyoto, Japan.
  87. Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara: Ls in L and Sphinxes in Sphinx, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), 2015/09/14-2015/09/16, Kyoto University, Kyoto, Japan.
  88. Jason S. Ku, Erik D. Demaine, Matias Korman, Joseph Mitchell, Yota Otachi, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno and Andre van Renssen: Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), Lecture Notes in Computer Science, Vol. 9943, pp. 180-192, 2015/09/14-2015/09/16, Kyoto University, Kyoto, Japan.
  89. Hugo Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Tomas C. Hull, Jason S. Ku, Tomohiro Tachi and Ryuhei Uehara: Box Pleating is Hard, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), Lecture Notes in Computer Science, Vol. 9943, pp. 167-179, 2015/09/14-2015/09/16, Kyoto University, Kyoto, Japan.
  90. Kyle Burke, Erik Demaine, Robert Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Maarten Loffler, Yushi Uno, Christiane Schmidt, Ryuhei Uehara and Aaron Williams: Single-Player and Two-Player Buttons & Scissors Games, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), Lecture Notes in Computer Science, Vol. 9943, pp. 60-72, 2015/09/14-2015/09/16, Kyoto University, Kyoto, Japan. JAIST Repository.
  91. Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara: Ls in L and Sphinxes in Sphinx, The 18th Korea-Japan Joint Workshop on Algorithms and Computation 2015/08/21-2015/08/22, Songdo Convensia, Incheon, Korea.
  92. Kazuho Katsumata and Ryuhei Uehara: Convex Configurations of Dissection Puzzles with Seven Pieces, The 18th Korea-Japan Joint Workshop on Algorithms and Computation 2015/08/21-2015/08/22, Songdo Convensia, Incheon, Korea.
  93. Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno: Swapping Colored Tokens on Graphs, Algorithms and Data Structures Symposium (WADS 2015) Lecture Notes in Computer Science Vol. 9214, pp. 619-628, 2015/08/05-2015/08/07, Victoria, BC, Canada. JAIST Repository.
  94. Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou: Competitive Diffusion on Weighted Graphs, Algorithms and Data Structures Symposium (WADS 2015) Lecture Notes in Computer Science Vol. 9214, pp. 422-433, 2015/08/05-2015/08/07, Victoria, BC, Canada. JAIST Repository
  95. Yusuke Nakada, Yota Fujieda, Taisei Mori, Hiroshi Iwai, Kazumasa Nakaya, Ryuhei Uehara, and Masashi Yamabe: On a Stiffness Model for Origami Foldings, ASME 2015 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference 2015/08/02-2015/08/05, Boston, USA.
  96. Ryuhei Uehara: Computational Complexity of Puzzles and Games (Invited Talk), The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Lecture Notes in Computer Science Vol. 9135, pp. XXVI, 2015/06/06-2015/06/10, Kyoto, Japan. JAIST Repository
  97. Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa and Ryuhei Uehara: Common Developments of Three Incongruent Boxes of Area 30, The 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015), Lecture Notes in Computer Science Vol. 9076, pp. 236-247, 2015/05/18-2015/05/20, Singapore. JAIST Repository
  98. Yoshiaki Araki, Takashi Horiyama and Ryuhei Uehara: Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid, The 9th Workshop on Algorithms and Computation (WALCOM 2015), Lecture Notes in Computer Science Vol. 8973, pp. 294-305, 2015/02/26-2015/02/28, Dhaka, Bangladesh. JAIST Repository
  99. Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara and Yushi Uno: Folding a Paper Strip to Minimize Thickness, The 9th Workshop on Algorithms and Computation (WALCOM 2015), Lecture Notes in Computer Science Vol. 8973, pp. 113-124, 2015/02/26-2015/02/28, Dhaka, Bangladesh. JAIST Repository.
  100. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada: Polynomial-Time Algorithm for Sliding Tokens on Trees, The 1st International Workshop on Combinatorial Reconfiguration (CoRe 2015), 2015/02/18-2015/02/20, Sendai, Japan.
  101. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi and Ryuhei Uehara: Sliding Token on Bipartite Permutation Graphs in Cubic Time, The 1st International Workshop on Combinatorial Reconfiguration (CoRe 2015), 2015/02/18-2015/02/20, Sendai, Japan.
  102. Takeshi Yamada and Ryuhei Uehara Shortest Path for Sliding Tokens on Caterpillars, The 1st International Workshop on Combinatorial Reconfiguration (CoRe 2015), 2015/02/18-2015/02/20, Sendai, Japan.
  103. Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Yota Otachi, Hirotaka Ono, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara: Depth-First Search Using O(n) Bits, The 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science Vol. 8889, pp. 553-564, 2014/12/15-2014/12/17, Jeonju, Korea.
  104. Erik D. Demaine, Martin Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada: Polynomial-Time Algorithm for Sliding Tokens on Trees, The 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science Vol. 8889, pp. 389-400, 2014/12/15-2014/12/17, Jeonju, Korea. JAIST Repository.
  105. Zachary Abel, Erik D. Demaine, Martin Demaine, David Eppstein, Anna Lubiw and Ryuhei Uehara: Flat Foldings of Plane Graphs with Prescribed Angles and Edge, The 22nd International Symposium on Graph Drawing (GD 2014), Lecture Notes in Computer Science Vol. 8871, pp. 272-283, 2014/09/24-2014/09/26, Würzburg, Germany. JAIST Repository
  106. Zachary Abel, Erik D. Demaine, Martin Demaine, Hiro Ito, Jack Snoeyink and Ryuhei Uehara: Bumpy Pyramid Folding, The 26th Canadian Conference on Computational Geometry (CCCG 2014), pp. 258-266, 2014/08/11-2014/08/13, Halifax, Canada. JAIST Repository
  107. Eli Fox-Epstein and Ryuhei Uehara: The Convex Configurations of ``Sei Shonagon Chie no Ita'' and Other Dissection Puzzles, The 26th Canadian Conference on Computational Geometry (CCCG 2014), pp. 386-389, 2014/08/11-2014/08/13, Halifax, Canada. JAIST Repository
  108. Ryuhei Uehara: A Survey and Recent Results About Common Developments of Two or More Boxes, The 6th International Meeting on Origami in Science, Mathematics and Education (6OSME), pp. ??-??, 2014/08/10-2014/08/13, Tokyo, Japan.
  109. Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno and Yukiko Yamauchi: Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set, International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science Vol. 8496, pp. 230-239, 2014/07/01-2014/07/03, Lipari Island, Sicily, Italy. JAIST Repository.
  110. Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, and Katsuhisa Yamanaka: On the Parameterized Complexity for Token Jumping on Graphs, The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014), Lecture Notes in Computer Science Vol. 8402, pp. 341-351, 2014/04/11-2014/04/13, Chennai, India. JAIST Repository.
  111. Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara: Intersection Dimension of Bipartite Graphs, The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014), Lecture Notes in Computer Science Vol. 8402, pp. 323-340, 2014/04/11-2014/04/13, Chennai, India. JAIST Repository.
  112. Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara: Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs, The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014), Lecture Notes in Computer Science Vol. 8402, pp. 216-228, 2014/04/11-2014/04/13, Chennai, India.
  113. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara: Variations on Instant Insanity, Conference on Space Efficient Data Structures, Streams and Algorithms , Lecture Notes in Computer Science Vol. 8066, pp. 33-47, 2013/08/15-2013/08/16, Waterloo, Canada. JAIST Repository
  114. Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno: Computational complexity and an integer programming model of Shakashaka, The 25th Canadian Conference on Computational Geometry (CCCG 2013), pp. 31-36, 2013/08/08-2013/08/10, Waterloo, Canada. JAIST Repository
  115. Erik D. Demaine, Martin L. Demaine and Ryuhei Uehara: Zipper Unfoldability of Domes and Prismoids, The 25th Canadian Conference on Computational Geometry (CCCG 2013) , pp. 43-48, 2013/08/08-2013/08/10, Waterloo, Canada. JAIST Repository
  116. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl: Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane, The 25th Canadian Conference on Computational Geometry (CCCG 2013) , pp. 169-174, 2013/08/08-2013/08/10, Waterloo, Canada. JAIST Repository
  117. Ryuhei Uehara: The Graph Isomorphism Problem on Geometric graphs, The 2nd Pacific Rim Mathematical Association (PRIMA) , 2013/06/24-28, Shanghai, China.
  118. Ryuhei Uehara: On generation of graphs with geometric representations, 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), in Gray codes and universal cycles Minisymposia, 2013/06/10-2013/06/13, Newfoundland, Canada.
  119. Ryuhei Uehara: The graph isomorphism problem on graphs with geometric represenations, 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), in Geometric Representation of Graphs Minisymposia, 2013/06/10-2013/06/13, Newfoundland, Canada.
  120. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama and Ryuhei Uehara: Computational Complexity of Piano-Hinged Dissections The 29th European Workshop on Computational Geometry (EuroCG 2013), pp. 147-150, 2013/03/17-2013/03/20, Braunschweig, German. JAIST Repository
  121. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno: Base location problems for base-monotone regions, 7th International Workshop on Algorithms and Computation (WALCOM 2013), Lecture Notes in Computer Science Vol. 7748, pp. 53-64, 2013/2/14-16, Kharagpur, India. DOI:10.1007/978-3-642-36065-7_7, JAIST Repository
  122. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno: A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks, 23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012) , Lecture Notes in Computer Science Vol. 7676, pp. 372-381, 2012/12/19-21, Taipei, Taiwan. DOI:10.1007/978-3-642-35261-4_40
  123. Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno: Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition, Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012) , 2012/12/06-08, Bangkok, Thailand.
  124. Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno and Yushi Uno: On Complexity of Flooding Games on Graphs with Interval Representations, Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012) , Lecture Notes in Computer Science, Vol. 8296, pp. 73-84, 2012/12/06-08, Bangkok, Thailand. DOI: 10.1007/978-3-642-45281-9_7
  125. Toshihiro Shirakawa and Ryuhei Uehara: Common Developments of Three Different Orthogonal Boxes, The 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 19-23, 2012/8/8-10, PEI, Canada.
  126. Greg Aloupis, Robert Hearn, Hirokazu Iwasawa and Ryuhei Uehara: Covering points with disjoint unit disks, The 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 49-54, 2012/8/8-10, PEI, Canada.
  127. Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara: Packing Trominoes is NP-Complete, #P-hard and ASP-Complete, The 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 219-224, 2012/8/8-10, PEI, Canada.
  128. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares, 13th Scandinavian Symposium and Workshops on Algorithm Theory, Lecture Notes in Computer Science, Vol. 7357, pp. 24-35, 2012/7/3-5, Helsinki, Finland. DOI:10.1007/978-3-642-31155-0_3
  129. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: Bounding the number of reduced trees, cographs, and series-parallel graphs by compression, Workshop on Algorithms and Computation (WALCOM 2012), Lecture Notes in Computer Science, Vol. 7157, pp. 5-16, 2012/2/15-17, Dhaka, Bangladesh.
  130. Toshihiro Shirakawa, Takashi Horiyama,and Ryuhei Uehara: On Common Unfolding of a Regular Tetrahedron and a Cube, Japan Conference on Discrete and Computational Geometry (JCDCG 2011), 2011/11/28-29, Tokyo, Japan.
  131. Yosuke Okayama, Masashi Kiyomi and Ryuhei Uehara: On covering of any point configuration by disjoint unit disks, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp. 393-397, 2011/8/10-12, Toronto, Canada. JAIST Repository
  132. Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Guenter Rote and Ryuhei Uehara: Common Developments of Several Different Orthogonal Boxes, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp. 77-82, 2011/8/10-12, Toronto, Canada. JAIST Repository
  133. Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, and Hiro Ito: Complexity of the stamp folding problem, 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA '11), Lecture Notes in Computer Science, Vol. 6831, pp. 311-321, 2011/8/4-6, Zhangjiajie, China.
  134. Hiroyuki Fukuki, Akihiro Nakanishi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno: The Complexity of Free Flood Filling Game, 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), pp. 51-56, 2011/7/8-9, Busan, Korea.
  135. Ryuhei Uehara: On Common Developments of Several Different Polyhedra (Invited Talk), 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), pp. 159-163, 2011/7/8-9, Busan, Korea.
  136. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara and Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem, 8th Annual Conference on Theory and Applications of Medels of Computation (TAMC 2011), Lecture Notes in Computer Science, Vol. 6648, pp. 452-462, 2011/5/23-25, Tokyo, Japan. JAIST Repository.
  137. Arata Goto and Ryuhei Uehara: On the generalized Hoffman puzzle, 4th Asian Association for Algorithms and Computation (AAAC 2011), p. 38, 2011/4/16-17. Hsinchu, Taiwan.
  138. Toshihiro Shirakawa, Takashi Horiyama,and Ryuhei Uehara: Construct of Common Development of Regular Tetrahedron and Cube, 27th European Workshop on Computational Geometry (EuroCG 2011), pp. 47-50, 2011/3/28-30, JAIST Repository
  139. 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: Coverage with k-Transmitters in the Presence of Obstacles, 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) , Lecture Notes in Computer Science, Vol. 6509, pp. 1-15, 2010/12/18-20. JAIST Repository
  140. Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara: Bipartite Permutation Graphs are Reconstructible, 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) , Lecture Notes in Computer Science, Vol. 6509, pp. 362-373, 2010/12/18-20.
  141. Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara: Bipartite Powers of Interval Bigraphs, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , accepted, 2010/11/03-06.
  142. Ryuhei Uehara: Simple Undecidable Problem on Origami, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , accepted, 2010/11/03-06.
  143. Takashi Horiyama and Ryuhei Uehara: Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , 2010/11/03-06.
  144. Ryuhei Uehara: On Stretch Minimization Problem on Unit Strip Paper, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 223-226, 2010/8/9-11.
  145. David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Pat Morin, and Ryuhei Uehara: Ghost Chimneys, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 63-66, 2010/8/9-11.
  146. Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara: Any Monotone Function is Realized by Interlocked Polygons, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 139-142, 2010/8/9-11.
  147. Ryuhei Uehara: Stretch Minimization Problem of a Strip Paper, 5th International Conference on Origami in Science, Mathematics and Education (5OSME), 2010/7/13-17.
  148. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks, 21st Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 6129, pp. 190-201, 2010/6/21-23, JAIST Repository
  149. Tetsuo Asano, Erik Demaine, Martin Demaine, and Ryuhei Uehara: Kaboozle is NP-complete, even in a Strip Form, 5th International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science Vol. 6099, pp. 28-36, 2010/6/2-4, JAIST Repository
  150. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno: UNO is hard, even for a single player, 5th International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science Vol. 6099, pp. 133-144, 2010/6/2-4. (Technical Report is avairable at CoRR arXiv:1003.2851.)
  151. Akihiro Nakanishi, Toshiki Saitoh, Masashi Kiyomi and Ryuhei Uehara: Fast Algorithm for the Bandwidth Problem of Bipartite Permutation Graphs, 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2010), pp. 35, 2010/4/17-19.
  152. Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara: Reconstruction Algorithm for Permutation Graphs, 4th Annual Workshop on Algorithms and Computation (WALCOM 2010), Lecture Notes in Computer Science Vol. 5942, pp. 125-135, 2010/2/10-12.
  153. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, and Ryuhei Uehara: Random Generation and Enumeration of Bipartite Permutation Graphs, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 1104-1113, 2009/12/18.
  154. Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara: Algorithmic Folding Complexity, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 452-461, 2009/12/16.
  155. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, and Ryuhei Uehara: Route-Enabling Graph Orientation Problems, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 403-412, 2009/12/16.
  156. Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara: Algorithmic Folding Complexity (Extended Abstract), 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp. 143-144, 2009/11/13.
  157. Yoshio Okamoto and Ryuhei Uehara: How to make a picturesque maze, 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 137-140, 2009/8/18.
  158. Masashi Kiyomi, Toshiki Saitoh and Ryuhei Uehara: Reconstruction of Interval Graphs, 15th Annual International Computing and Combinatorics Conference (COCOON 2009), Lecture Notes in Computer Science Vol. 5609, pp. 106-115, 2009/7/13.
  159. Yoshio Okamoto, Ryuhei Uehara and Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes, 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Lecture Notes in Computer Science Vol. 5911, pp. 296-307, 2009/6/26.
  160. Tsuyoshi Ito, Masashi Kiyomi, Shinji Imahori and Ryuhei Uehara: Complexity of pleats folding, 25th European Workshop on Computational Geometry (EuroCG '09), pp. 143-146, 2009/3/17.
  161. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada: Efficient Enumeration of All Pseudoline Arrangements, 25th European Workshop on Computational Geometry (EuroCG '09) , pp. 53-56, 2009/3/16.
    [Note] Our algorithm in the paper updates some data on The On-Line Encyclopedia of Integer Sequences.
  162. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara: Random Generation and Enumeration of Proper Interval Graphs, 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009) , Lecture Notes in Computer Science Vol. 5431, pp. 177-189, 2009/2/20.
  163. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno: On the Complexity of Reconfiguration Problems, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 28-39, 2008/12.
  164. Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of Perfect Sequences of Chordal Graph, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 859-870, 2008/12.
  165. Ryuhei Uehara: Bandwidth of Bipartite Permutation Graphs, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 824-835, 2008/12.
  166. Yoichi Fujimoto, Mitsuo Motoki, and Ryuhei Uehara: Inverting Linkages with Stretch, Canadian Conference on Computational Geometry (CCCG 2008), pp. 31-34, 2008/8/13. (Also presented at The First AAAC Annual Meeting (AAAC 08), 2008/4.)
  167. Jun Mitani and Ryuhei Uehara: Polygons Folding to Plural Incongruent Orthogonal Boxes, Canadian Conference on Computational Geometry (CCCG 2008), pp. 39-42, 2008/8/13. Support pages written in Japanese/ English are available.
  168. Naoto Miyoshi, Mariko Ogura, Takeya Shigezumi, and Ryuhei Uehara: Scale-free Interval Graphs Generated by Immigration-depth Processes, International Workshop on Applied Probability (IWAP 2008), 2008/7.
  169. Takeya Shigezumi, Naoto Miyoshi, Ryuhei Uehara, and Osamu Watanabe: Scale Free Interval Graphs, International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), Lecture Notes in Computer Science Vol.5034, pp. 202-303, 2008/6. (Also presented at The First AAAC Annual Meeting (AAAC 08), 2008/4.)
  170. Ryuhei Uehara: Simple Geometrical Intersection Graphs (Invited Talk), Workshop on Algorithms and Computation (WALCOM 2008), Lecture Notes in Computer Science Vol. 4921, pp. 25-33, 2008/2.
  171. Toshiki Saitoh, Masashi Kiyomi, and Ryuhei Uehara: Simple Efficient Algorithm for MPQ-tree of an Interval Graph, KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), pp.121-126, 2007/8.
  172. Yoshihiro Takahara, Sachio Teramoto, and Ryuhei Uehara: Longest Path Problems on Ptolemaic Graphs, The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) , 2007/6.
  173. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: Efficient Algorithms for Airline Problem, 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 07) , Lecture Notes in Computer Science Vol.4484, pp.428-439, 2007/5.
  174. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs, 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 07) , Lecture Notes in Computer Science Vol.4484, pp.115-127, 2007/5.
  175. Ryuhei Uehara and Sachio Teramoto: Computational Complexity of a Pop-up book, 4th International Conference on Origami in Science, Mathematics, and Education (4OSME), Poster, 2006/9. PDF file (95586 bytes). Full paper appears pp. 295-304 in the proceedings published by A K Press in 2009.
  176. Ryuhei Uehara and Sachio Teramoto: The complexity of a Pop-up book, 18th Canadian Conference on Computational Geometry (CCCG 2006) , pp.3-6, 2006/8. PDF file (126431 bytes) (Note: the draft for 4OSME contains improved results.)
  177. Sachio Teramoto, Erik D. Demaine, and Ryuhei Uehara: Voronoi game on graphs and its complexity, 2nd IEEE Symposium on Computational Intelligence and Games (CIG 2006), pp.265-271, 2006/5. PDF file (132193 bytes).
  178. Ryuhei Uehara and Yushi Uno: Laminar Structure of Ptolemaic Graphs and Its Applications, 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Lecture Notes in Computer Science Vol.3827, pp.186-195, 2005/12. PDF file (281249 bytes), DOI:10.1007/11602613_20
  179. Yoshio Okamoto, Takeaki Uno, and Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Lecture Notes in Computer Science Vol.3787, pp.433-444, 2005/6. PDF file (101546 bytes), DOI:10.1007/11604686_38
  180. Ryuhei Uehara: Canonical Data Structure for Interval Probe Graphs, 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science Vol.3341, pp.859-870, 2004/12. PDF file (284459 bytes), DOI:10.1007/b104582
  181. Ryuhei Uehara and Yushi Uno: Efficient Algorithms for the Longest Path Problem, 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science Vol.3341, pp.871-883, 2004/12. PDF file (231075 bytes), DOI:10.1007/b104582
  182. Andreas Brandstädt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, and Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs, 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Lecture Notes in Computer Science Vol.2880, pp.106-118, 2003/6. PDF file (314069 bytes). DOI:10.1007/b93953
  183. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, and Ming-wei Wang: Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles, 14th Canadian Conference on Computational Geometry (CCCG 2002), pp.105-108, 2002/8. See Erik's page for the detail.
  184. Ryuhei Uehara: Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs, 29th International Colloquium on Automata,Languages, and Programming (ICALP 2002), Lecture Notes in Computer Science Vol.2380, pp.993-1004, 2002/7. The PostScript file for the conference (76284 bytes, compressed by gzip) contains a serious bug; see Erratum for counterexample.
  185. Ryuhei Uehara and Zhi-Zhong Chen: Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs, IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Lecture Notes in Computer Science Vol.1872, pp.84-98, 2000/8. PostScript file (75586 bytes, compressed by gzip).
  186. Ryuhei Uehara: Tractable Problems on Small Connected Components in Graphs, KOREA-JAPAN Joint Workshop on Algorithms and Computation, pp.116-122, 1999/7. PostScript file (51038 bytes, compressed by gzip).
  187. Ryuhei Uehara: Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph, International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN '99), pp.350-355, 1999/6. PostScript file (60183 bytes, compressed by gzip).
  188. Ryuhei Uehara: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problem, 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '97), Lecture Notes in Computer Science Vol.1335, pp.333-341, 1997/6. PostScript file (58098 bytes, compressed by gzip). DOI:10.1007/BFb0024508
  189. Ryuhei Uehara and Zhi-Zhong Chen: Parallel Algorithms for Maximal Linear Forests, Second Workshop on Randomized Parallel Computing of Eleventh International Parallel Processing Symposium (IPPS '97), 1997/4. PostScript file (75446 bytes, compressed by gzip).
  190. Ryuhei Uehara, Kensei Tsuchida, and Ingo Wegener: Optimal Attribute-Efficient Learning of Disjunction, Parity, and Threshold Functions, Third European Conference on Computational Learning Theory (EuroCOLT '97), Lecture Notes in Artificial Intelligence Vol.1208, pp 171-184, 1997/3. PostScript file (81206 bytes, compressed by gzip). DOI:10.1007/3-540-62685-9_15
  191. Ryuhei Uehara, Zhi-Zhong Chen, and Xin He: Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application, Second Annual International Computing and Combinatorics Conference (COCOON '96), Lecture Notes in Computer Science Vol.1090, pp 209-218, 1996/6. PostScript file (77507 bytes, compressed by gzip). DOI:10.1007/3-540-61332-3_154
Last modified: Mon May 18 10:37:01 JST 2015
by R.Uehara (uehara@jaist.ac.jp) 		Valid HTML 4.0!