Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyuhei Uehara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j101]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
:
Developing a tetramonohedron with minimum cut length. Comput. Geom. 108: 101903 (2023)- [j100]Ko Minamisawa, Ryuhei Uehara, Masao Hara:
Mathematical characterizations and computational complexity of anti-slide puzzles. Theor. Comput. Sci. 939: 216-226 (2023) - 2022
- [j99]Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara:
Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. 103: 101857 (2022) - [j98]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - [j97]Tamami Okada, Ryuhei Uehara:
Research on Dissections of a Net of a Cube into Nets of Cubes. IEICE Trans. Inf. Syst. 105-D(3): 459-465 (2022) - [j96]Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara:
Cyclic Shift Problems on Graphs. IEICE Trans. Inf. Syst. 105-D(3): 532-540 (2022) - [j95]Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta:
Bicolored Path Embedding Problems Inspired by Protein Folding Models. IEICE Trans. Inf. Syst. 105-D(3): 623-633 (2022) - [j94]Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara:
Guest Editors' Foreword. J. Graph Algorithms Appl. 26(2): 207-208 (2022) - [c111]Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG 2022: 9-23 - [c110]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104 - [c109]Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara:
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. CCCG 2022: 177-183 - [c108]Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - [c107]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: 6:1-6:16 - [c106]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: 16:1-16:17 - [c105]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: 4:1-4:19 - [i23]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 abs/2202.09495 (2022) - [i22]Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR abs/2212.12450 (2022) - 2021
- [j93]Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi:
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303: 305-313 (2021) - [j92]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. 104-A(9): 1101-1107 (2021) - [j91]Yiyang Jia, Jun Mitani, Ryuhei Uehara:
Research on Map Folding with Boundary Order on Simple Fold. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1116-1126 (2021) - [j90]Takeshi Yamada, Ryuhei Uehara:
Shortest reconfiguration of sliding tokens on subclasses of interval graphs. Theor. Comput. Sci. 863: 53-68 (2021) - [c104]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: 332-342 - [c103]Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta:
Token Shifting on Graphs. COCOON 2021: 643-654 - [c102]Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara:
Computational Complexity of Jumping Block Puzzles. COCOON 2021: 655-667 - [c101]Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara:
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. WALCOM 2021: 284-295 - [c100]Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. WALCOM 2021: 308-320 - [c99]Ko Minamisawa, Ryuhei Uehara, Masao Hara:
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. WALCOM 2021: 321-332 - [e4]Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy:
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1 [contents] - [i21]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Regular Polyhedra. CoRR abs/2105.14305 (2021) - [i20]Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara:
Computational Complexity of Jumping Block Puzzles. CoRR abs/2109.02213 (2021) - [i19]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 abs/2109.03997 (2021) - [i18]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 abs/2110.05184 (2021) - 2020
- [b2]Ryuhei Uehara:
Introduction to Computational Origami - The World of New Computational Geometry. Springer 2020, ISBN 978-981-15-4469-9, pp. 1-217 - [j89]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: 101648 (2020) - [j88]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - [j87]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1193-1201 (2020) - [j86]Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. J. Graph Algorithms Appl. 24(2): 89-103 (2020) - [j85]Koji Ouchi, Ryuhei Uehara:
Minimum Forcing Sets for Single-vertex Crease Pattern. J. Inf. Process. 28: 800-805 (2020) - [j84]Yiyang Jia, Jun Mitani, Ryuhei Uehara:
Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern. J. Inf. Process. 28: 806-815 (2020) - [j83]Yiyang Jia, Jun Mitani, Ryuhei Uehara:
Valid Orderings of Layers When Simple-Folding a Map. J. Inf. Process. 28: 816-824 (2020) - [j82]Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. J. Inf. Process. 28: 841-845 (2020) - [j81]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806: 310-322 (2020) - [c98]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Regular Polyhedra. CCCG 2020: 121-127 - [c97]Dat Hoang Tran, Ryuhei Uehara:
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. WALCOM 2020: 296-307 - [c96]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. DISC 2020: 12:1-12:17 - [e3]Martin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara:
10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy. LIPIcs 157, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-145-0 [contents] - [i17]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. CoRR abs/2005.07917 (2020) - [i16]Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. CoRR abs/2009.10981 (2020) - [i15]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient Segment Folding is Hard. CoRR abs/2012.11062 (2020)
2010 – 2019
- 2019
- [b1]Ryuhei Uehara:
First Course in Algorithms Through Puzzles. Springer 2019, ISBN 978-981-13-3187-9, pp. 1-175 - [j80]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 128 (2019) - [j79]Koji Ouchi, Ryuhei Uehara:
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. IEICE Trans. Inf. Syst. 102-D(3): 416-422 (2019) - [j78]Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara:
On Computational Complexity of Pipe Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1134-1141 (2019) - [j77]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): 3-27 (2019) - [j76]M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara:
Guest Editors' Foreword. J. Graph Algorithms Appl. 23(5): 755-757 (2019) - [c95]Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Simple Fold and Cut Problem for Line Segments. CCCG 2019: 153-158 - [c94]Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. CCCG 2019: 159-163 - [c93]Koji Ouchi, Ryuhei Uehara:
Minimum Forcing Sets for Single-Vertex Crease Pattern. CCCG 2019: 171-176 - [c92]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - [c91]Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara:
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CIAC 2019: 262-273 - [c90]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. COCOON 2019: 291-300 - [c89]Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara:
On the Complexity of Lattice Puzzles. ISAAC 2019: 32:1-32:12 - [c88]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. WADS 2019: 353-365 - [c87]Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. WALCOM 2019: 277-288 - [i14]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. CoRR abs/1905.00518 (2019) - 2018
- [j75]Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara:
Special Issue on Reconfiguration Problems. Algorithms 11(11): 187 (2018) - [j74]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy pyramid folding. Comput. Geom. 75: 22-31 (2018) - [j73]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 125 (2018) - [j72]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. 101-A(9): 1420-1430 (2018) - [j71]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): 74-93 (2018) - [j70]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: 1-10 (2018) - [c86]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: 263-272 - [c85]Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara:
Computational Complexity of Robot Arm Simulation Problems. IWOCA 2018: 177-188 - [c84]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: 122-135 - [c83]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow:
Packing Cube Nets into Rectangles with O(1) Holes. JCDCGGG 2018: 152-164 - [c82]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM 2018: 8-19 - [c81]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251 - [e2]M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara:
WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings. Lecture Notes in Computer Science 10755, Springer 2018, ISBN 978-3-319-75171-9 [contents] - [i13]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - [i12]Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara:
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CoRR abs/1806.08291 (2018) - 2017
- [j69]Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common developments of three incongruent boxes of area 30. Comput. Geom. 64: 1-12 (2017) - [j68]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j67]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58(3): 686-704 (2017) - [j66]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 121 (2017) - [j65]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: 610-615 (2017) - [j64]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: 708-715 (2017) - [c80]Dawei Xu, Takashi Horiyama, Ryuhei Uehara:
Rep-cubes: Unfolding and Dissection of Cubes. CCCG 2017: 62-67 - [c79]Koji Ouchi, Ryuhei Uehara:
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. WALCOM 2017: 19-29 - [c78]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: 435-447 - [c77]Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara:
Sliding Tokens on Block Graphs. WALCOM 2017: 460-471 - [i11]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 abs/1703.02671 (2017) - 2016
- [j63]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51: 25-39 (2016) - [j62]Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. Discret. Appl. Math. 199: 37-45 (2016) - [j61]Ryuhei Uehara:
Report from the Japanese Chapter. Bull. EATCS 119 (2016) - [j60]Eli Fox-Epstein, Kazuho Katsumata, Ryuhei Uehara:
The Convex Configurations of "Sei Shonagon Chie no Ita, " Tangram, and Other Silhouette Puzzles with Seven Pieces. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1084-1089 (2016) - [j59]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36: 18-26 (2016) - [j58]Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. J. Graph Algorithms Appl. 20(1): 101-114 (2016) - [c76]Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya:
Convex Configurations on Nana-kin-san Puzzle. FUN 2016: 20:1-20:14 - [c75]Duc A. Hoang, Ryuhei Uehara:
Sliding Tokens on a Cactus. ISAAC 2016: 37:1-37:26 - [c74]Takeshi Yamada, Ryuhei Uehara:
Shortest Reconfiguration of Sliding Tokens on a Caterpillar. WALCOM 2016: 236-248 - [i10]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2015
- [j57]Ryuhei Uehara:
The Japanese Chapter. Bull. EATCS 116 (2015) - [j56]Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara:
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE Trans. Inf. Syst. 98-D(3): 486-489 (2015) - [j55]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600: 132-142 (2015) - [c73]Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara:
Sliding Token on Bipartite Permutation Graphs. ISAAC 2015: 237-247 - [c72]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - [c71]Hugo Alves Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara:
Box Pleating is Hard. JCDCGG 2015: 167-179 - [c70]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. JCDCGG 2015: 180-192 - [c69]Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Incongruent Boxes of Area 30. TAMC 2015: 236-247 - [c68]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [c67]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - [c66]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - [c65]Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. WALCOM 2015: 294-305 - [i9]Takeshi Yamada, Ryuhei Uehara:
Shortest Reconfiguration of Sliding Tokens on a Caterpillar. CoRR abs/1511.00243 (2015) - 2014
- [j54]Ryuhei Uehara:
The graph isomorphism problem on geometric graphs. Discret. Math. Theor. Comput. Sci. 16(2): 87-96 (2014) - [j53]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [j52]