Ryuhei Uehara

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 122

Top Venues

Publications

Yuki Iburi, Ryuhei Uehara
Computational Complexity of Matching Match Puzzle. FUN (2024)
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983 (2024)
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs. Discret. Appl. Math. 342 (2024)
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM (2024)
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. WALCOM (2024)
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM (2023)
Takumi Shiota, Tonan Kamata, Ryuhei Uehara
Overlapping of Lattice Unfolding for Cuboids. CCCG (2023)
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. 978 (2023)
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR (2023)
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
(1) refoldings. Comput. Geom. 113 (2023)
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Developing a tetramonohedron with minimum cut length. Comput. Geom. 108 (2023)
Ko Minamisawa, Ryuhei Uehara, Masao Hara
Mathematical characterizations and computational complexity of anti-slide puzzles. Theor. Comput. Sci. 939 (2023)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Convex Polyhedra. Discret. Comput. Geom. 70 (4) (2023)
Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara
Cyclic Shift Problems on Graphs. IEICE Trans. Inf. Syst. (3) (2022)
Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG (2022)
Tamami Okada, Ryuhei Uehara
Research on Dissections of a Net of a Cube into Nets of Cubes. IEICE Trans. Inf. Syst. (3) (2022)
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. CoRR (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR (2022)
Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec
Quasi-Twisting Convex Polyhedra. CCCG (2022)
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
Token shifting on graphs. Int. J. Comput. Math. Comput. Syst. Theory 7 (4) (2022)
Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. 103 (2022)
Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta
Bicolored Path Embedding Problems Inspired by Protein Folding Models. IEICE Trans. Inf. Syst. (3) (2022)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard. Comput. Geom. 104 (2022)
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
Rolling Polyhedra on Tessellations. FUN (2022)
Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. CCCG (2022)
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Logical Matrix Representations in Map Folding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2022)
Hugo A. 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. SWAT (2022)
Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara
Guest Editors' Foreword. J. Graph Algorithms Appl. 26 (2) (2022)
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. FUN (2022)
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
Cyclic Shift Problems on Graphs. WALCOM (2021)
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
Token Shifting on Graphs. COCOON (2021)
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303 (2021)
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. WALCOM (2021)
Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
Computational Complexity of Jumping Block Puzzles. COCOON (2021)
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR (2021)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Regular Polyhedra. CoRR (2021)
Takeshi Yamada, Ryuhei Uehara
Shortest reconfiguration of sliding tokens on subclasses of interval graphs. Theor. Comput. Sci. 863 (2021)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CCCG (2021)
Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
Computational Complexity of Jumping Block Puzzles. CoRR (2021)
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Research on Map Folding with Boundary Order on Simple Fold. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. CoRR (2021)
Ko Minamisawa, Ryuhei Uehara, Masao Hara
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. WALCOM (2021)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
Cyclic Shift Problems on Graphs. CoRR (2020)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806 (2020)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Regular Polyhedra. CCCG (2020)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient Segment Folding is Hard. CoRR (2020)
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Map Folding with a Box-pleated Crease Pattern. J. Inf. Process. 28 (2020)
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Valid Orderings of Layers When Simple-Folding a Map. J. Inf. Process. 28 (2020)
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
Efficient Algorithm for Box Folding. J. Graph Algorithms Appl. 24 (2) (2020)
Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara
Rectangular Unfoldings of Polycubes. J. Inf. Process. 28 (2020)
Koji Ouchi, Ryuhei Uehara
Minimum Forcing Sets for Single-vertex Crease Pattern. J. Inf. Process. 28 (2020)
Dat Hoang Tran, Ryuhei Uehara
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. WALCOM (2020)
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. DISC (2020)
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283 (2020)
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. CoRR (2020)
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90 (2020)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. CoRR (2019)
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CIAC (2019)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. WADS (2019)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23 (1) (2019)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Ecient Segment Folding is Hard. CCCG (2019)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. COCOON (2019)
Ryuhei Uehara
Report from EATCS Japan Chapter. Bull. EATCS 128 (2019)
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
On the Complexity of Lattice Puzzles. ISAAC (2019)
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
Efficient Algorithm for Box Folding. WALCOM (2019)
Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara
Rectangular Unfoldings of Polycubes. CCCG (2019)
M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
Guest Editors' Foreword. J. Graph Algorithms Appl. 23 (5) (2019)
Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara
On Computational Complexity of Pipe Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Koji Ouchi, Ryuhei Uehara
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. IEICE Trans. Inf. Syst. (3) (2019)
Koji Ouchi, Ryuhei Uehara
Minimum Forcing Sets for Single-Vertex Crease Pattern. CCCG (2019)
Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
Simple Fold and Cut Problem for Line Segments. CCCG (2019)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM (2018)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem. FAW (2018)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Bumpy pyramid folding. Comput. Geom. 75 (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping colored tokens on graphs. Theor. Comput. Sci. 729 (2018)
Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara
Toward Unfolding Doubly Covered n-Stars. JCDCGGG (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. CoRR (2018)
Ryuhei Uehara
Report from EATCS Japan Chapter. Bull. EATCS 125 (2018)
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CoRR (2018)
Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara
Rep-Cubes: Dissection of a Cube into Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM (2018)
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Computational Complexity of Robot Arm Simulation Problems. IWOCA (2018)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
Flat foldings of plane graphs with prescribed angles and edge lengths. J. Comput. Geom. 9 (1) (2018)
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow
Packing Cube Nets into Rectangles with O(1) Holes. JCDCGGG (2018)
Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara
Special Issue on Reconfiguration Problems. Algorithms 11 (11) (2018)
Dawei Xu, Takashi Horiyama, Ryuhei Uehara
Rep-cubes: Unfolding and Dissection of Cubes. CCCG (2017)
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58 (3) (2017)
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR (2017)
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
Common developments of three incongruent boxes of area 30. Comput. Geom. 64 (2017)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. WALCOM (2017)
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. J. Inf. Process. 25 (2017)
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216 (2017)
Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara
Sliding Tokens on Block Graphs. WALCOM (2017)
Koji Ouchi, Ryuhei Uehara
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. WALCOM (2017)
Ryuhei Uehara
Report from EATCS Japan Chapter. Bull. EATCS 121 (2017)
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. J. Inf. Process. 25 (2017)
Takeshi Yamada, Ryuhei Uehara
Shortest Reconfiguration of Sliding Tokens on a Caterpillar. WALCOM (2016)

Ryuhei Uehara.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ryuhei Uehara