default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyuhei Uehara
Person information
- affiliation: Japan Advanced Institute of Science and Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j111]Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a circle with limited visibility by anonymous oblivious robots. Theor. Comput. Sci. 1025: 114974 (2025)- 2024
- [j110]Kazuaki Yamazaki, Mengze Qian
, Ryuhei Uehara:
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs. Discret. Appl. Math. 342: 190-199 (2024) - [j109]Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of vertex-disjoint shortest paths on graphs. J. Graph Algorithms Appl. 28(3): 87-101 (2024) - [j108]Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara:
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983: 114292 (2024) - [c116]Yuki Iburi, Ryuhei Uehara:
Computational Complexity of Matching Match Puzzle. FUN 2024: 17:1-17:10 - [c115]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM 2024: 55-68 - [c114]Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara:
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. WALCOM 2024: 242-256 - [e5]Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen:
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings. Lecture Notes in Computer Science 14549, Springer 2024, ISBN 978-981-97-0565-8 [contents] - [i26]Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang:
All Polyhedral Manifolds are Connected by a 2-Step Refolding. CoRR abs/2412.02174 (2024) - [i25]Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
Dudeney's Dissection is Optimal. CoRR abs/2412.03865 (2024) - 2023
- [j107]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Developing a tetramonohedron with minimum cut length. Comput. Geom. 108: 101903 (2023) - [j106]Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang:
Any platonic solid can transform to another by O(1) refoldings. Comput. Geom. 113: 101995 (2023) - [j105]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Convex Polyhedra. Discret. Comput. Geom. 70(4): 1499-1522 (2023) - [j104]Ko Minamisawa, Ryuhei Uehara, Masao Hara:
Mathematical characterizations and computational complexity of anti-slide puzzles. Theor. Comput. Sci. 939: 216-226 (2023) - [j103]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: 114158 (2023) - [c113]Takumi Shiota, Tonan Kamata, Ryuhei Uehara:
Overlapping of Lattice Unfolding for Cuboids. CCCG 2023: 27-33 - [c112]Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM 2023: 191-201 - [i24]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR abs/2305.10749 (2023) - 2022
- [j102]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) - [j101]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - [j100]Yiyang Jia, Jun Mitani, Ryuhei Uehara:
Logical Matrix Representations in Map Folding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(10): 1401-1412 (2022) - [j99]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) - [j98]Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara:
Cyclic Shift Problems on Graphs. IEICE Trans. Inf. Syst. 105-D(3): 532-540 (2022) - [j97]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) - [j96]Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta:
Token shifting on graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(4): 223-234 (2022) - [j95]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
- [j94]Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi:
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303: 305-313 (2021) - [j93]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) - [j92]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) - [j91]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 - [j90]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) - [j89]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) - [j88]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) - [j87]Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. J. Graph Algorithms Appl. 24(2): 89-103 (2020) - [j86]Koji Ouchi, Ryuhei Uehara:
Minimum Forcing Sets for Single-vertex Crease Pattern. J. Inf. Process. 28: 800-805 (2020) - [j85]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) - [j84]Yiyang Jia, Jun Mitani, Ryuhei Uehara:
Valid Orderings of Layers When Simple-Folding a Map. J. Inf. Process. 28: 816-824 (2020) - [j83]Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. J. Inf. Process. 28: 841-845 (2020) - [j82]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 - [j81]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 128 (2019) - [j80]Koji Ouchi, Ryuhei Uehara:
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. IEICE Trans. Inf. Syst. 102-D(3): 416-422 (2019) - [j79]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) - [j78]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) - [j77]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
- [j76]Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara:
Special Issue on Reconfiguration Problems. Algorithms 11(11): 187 (2018) - [j75]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy pyramid folding. Comput. Geom. 75: 22-31 (2018) - [j74]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 125 (2018) - [j73]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) - [j72]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) - [j71]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
- [j70]Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common developments of three incongruent boxes of area 30. Comput. Geom. 64: 1-12 (2017) - [j69]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j68]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) - [j67]Ryuhei Uehara:
Report from EATCS Japan Chapter. Bull. EATCS 121 (2017) - [j66]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) - [j65]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
- [j64]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) - [j63]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) - [j62]Ryuhei Uehara:
Report from the Japanese Chapter. Bull. EATCS 119 (2016) - [j61]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) - [j60]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) - [j59]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
- [j58]Ryuhei Uehara:
The Japanese Chapter. Bull. EATCS 116 (2015) - [j57]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) - [j56]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 A. 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
- [j55]Ryuhei Uehara:
The graph isomorphism problem on geometric graphs. Discret. Math. Theor. Comput. Sci. 16(2): 87-96 (2014) - [j54]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) - [j53]Ryuhei Uehara:
Report from the Japanese Chapter. Bull. EATCS 114 (2014) - [j52]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara:
Computational Complexity of Piano-Hinged Dissections. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1206-1212 (2014) - [j51]Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno:
Computational Complexity and an Integer Programming Model of Shakashaka. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1213-1219 (2014) - [j50]Colin Cooper, Alan M. Frieze, Ryuhei Uehara:
The height of random k-trees and related branching processes. Random Struct. Algorithms 45(4): 675-702 (2014) - [j49]Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO is hard, even for a single player. Theor. Comput. Sci. 521: 51-61 (2014) - [j48]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544: 14-31 (2014) - [j47]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555: 71-84 (2014) - [c64]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara:
Bumpy Pyramid Folding. CCCG 2014 - [c63]Eli Fox-Epstein, Ryuhei Uehara:
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles. CCCG 2014 - [c62]Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN 2014: 230-239 - [c61]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. GD 2014: 272-283 - [c60]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400 - [c59]Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara:
Depth-First Search Using O(n) Bits. ISAAC 2014: 553-564 - [c58]Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. TAMC 2014: 216-228 - [c57]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - [c56]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i8]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR abs/1406.6576 (2014) - [i7]Eli Fox-Epstein, Ryuhei Uehara:
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles. CoRR abs/1407.1923 (2014) - [i6]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. CoRR abs/1408.6771 (2014) - [i5]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. CoRR abs/1411.6371 (2014) - [i4]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - 2013
- [j46]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - [j45]Ryuhei Uehara:
Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 6(1): 60-83 (2013) - [j44]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. Discret. Math. Algorithms Appl. 5(2) (2013) - [j43]Ryuhei Uehara:
The Japanese Chapter. Bull. EATCS 110: 21-24 (2013) - [j42]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Trans. Inf. Syst. 96-D(3): 426-432 (2013) - [j41]Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Incongruent Orthogonal Boxes. Int. J. Comput. Geom. Appl. 23(1): 65- (2013) - [j40]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [j39]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient algorithms for a simple network design problem. Networks 62(2): 95-104 (2013) - [j38]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto:
The complexity of the stamp folding problem. Theor. Comput. Sci. 497: 13-19 (2013) - [c55]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara:
Variations on Instant Insanity. Space-Efficient Data Structures, Streams, and Algorithms 2013: 33-47 - [c54]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG 2013 - [c53]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Zipper Unfoldability of Domes and Prismoids. CCCG 2013 - [c52]Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno:
Computational complexity and an integer programming model of Shakashaka. CCCG 2013 - [c51]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64 - 2012
- [j37]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 5(1): 148-157 (2012) - [j36]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs are reconstructible. Discret. Math. Algorithms Appl. 4(3) (2012) - [j35]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara:
On bipartite powers of bigraphs. Discret. Math. Theor. Comput. Sci. 14(2): 11-20 (2012) - [j34]Ryuhei Uehara:
Report from the Japanese Chapter. Bull. EATCS 107: 23-26 (2012) - [j33]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. Int. J. Comput. Geom. Appl. 22(3): 207-214 (2012) - [j32]Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
NP-completeness of generalized Kaboozle. Inf. Media Technol. 7(3): 1019-1024 (2012) - [j31]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012) - [j30]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012) - [j29]Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
NP-completeness of generalized Kaboozle. J. Inf. Process. 20(3): 713-718 (2012) - [c50]Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Different Orthogonal Boxes. CCCG 2012: 17-22 - [c49]Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara:
Covering Points with Disjoint Unit Disks. CCCG 2012: 41-46 - [c48]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. CCCG 2012: 211-216 - [c47]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 - [c46]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. SWAT 2012: 24-35 - [c45]Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG 2012: 73-84 - [c44]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16 - [i3]Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. CoRR abs/1206.6201 (2012) - 2011
- [j28]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [j27]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Voronoi Game on a Path. IEICE Trans. Inf. Syst. 94-D(6): 1185-1189 (2011) - [j26]Sandip Das, Ryuhei Uehara:
Guest Editor's Foreword. J. Graph Algorithms Appl. 15(3): 319-321 (2011) - [j25]Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara:
The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4): 485-501 (2011) - [j24]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011) - [j23]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011) - [c43]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara:
Common Developments of Several Different Orthogonal Boxes. CCCG 2011 - [c42]Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara:
On covering of any point configuration by disjoint unit disks. CCCG 2011 - [c41]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito:
Complexity of the Stamp Folding Problem. COCOA 2011: 311-321 - [c40]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462 - 2010
- [j22]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. 93-D(7): 1816-1823 (2010) - [j21]Colin Cooper, Ryuhei Uehara:
Scale Free Properties of Random k-Trees. Math. Comput. Sci. 3(4): 489-496 (2010) - [j20]Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada:
Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16-18): 1714-1722 (2010) - [j19]Yasuko Matsui, Ryuhei Uehara, Takeaki Uno:
Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. 411(40-42): 3635-3641 (2010) - [j18]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of interval graphs. Theor. Comput. Sci. 411(43): 3859-3866 (2010) - [c39]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. CCCG 2010: 63-66 - [c38]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Any monotone boolean function can be realized by interlocked polygons. CCCG 2010: 139-142 - [c37]Ryuhei Uehara:
On stretch minimization problem on unit strip paper. CCCG 2010: 223-226 - [c36]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - [c35]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373 - [c34]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201 - [c33]Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36 - [c32]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO Is Hard, Even for a Single Player. FUN 2010: 133-144 - [c31]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithm for Permutation Graphs. WALCOM 2010: 125-135 - [i2]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
The complexity of UNO. CoRR abs/1003.2851 (2010)
2000 – 2009
- 2009
- [j17]Ryuhei Uehara, Yushi Uno:
Laminar structure of ptolemaic graphs with applications. Discret. Appl. Math. 157(7): 1533-1543 (2009) - [j16]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009) - [j15]Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
Scale free interval graphs. Theor. Comput. Sci. 410(45): 4588-4600 (2009) - [c30]Yoshio Okamoto, Ryuhei Uehara:
How to make a picturesque maze. CCCG 2009: 137-140 - [c29]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of Interval Graphs. COCOON 2009: 106-115 - [c28]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. ISAAC 2009: 403-412 - [c27]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara:
Algorithmic Folding Complexity. ISAAC 2009: 452-461 - [c26]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113 - [c25]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. WALCOM 2009: 177-189 - [c24]Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno:
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307 - [e1]Sandip Das, Ryuhei Uehara:
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5431, Springer 2009, ISBN 978-3-642-00201-4 [contents] - 2008
- [j14]Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara:
Longest Path Problems on Ptolemaic Graphs. IEICE Trans. Inf. Syst. 91-D(2): 170-177 (2008) - [j13]Ryuhei Uehara:
Special Section on Discrete Mathematics and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2283 (2008) - [j12]Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008) - [c23]Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
Scale Free Interval Graphs. AAIM 2008: 292-303 - [c22]Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara:
Inverting Linkages with Stretch. CCCG 2008 - [c21]Ryuhei Uehara:
Polygons Folding to Plural Incongruent Orthogonal Boxes. CCCG 2008 - [c20]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39 - [c19]Ryuhei Uehara:
Bandwidth of Bipartite Permutation Graphs. ISAAC 2008: 824-835 - [c18]Yasuko Matsui, Ryuhei Uehara, Takeaki Uno:
Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870 - [c17]Ryuhei Uehara:
Simple Geometrical Intersection Graphs. WALCOM 2008: 25-33 - 2007
- [j11]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007) - [j10]Ryuhei Uehara, Yushi Uno:
On Computing Longest Paths in Small Graph Classes. Int. J. Found. Comput. Sci. 18(5): 911-930 (2007) - [j9]Ryuhei Uehara, Gabriel Valiente:
Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2): 71-77 (2007) - [c16]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127 - [c15]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient Algorithms for Airline Problem. TAMC 2007: 428-439 - 2006
- [c14]Ryuhei Uehara, Sachio Teramoto:
The Complexity of a Pop-Up Book. CCCG 2006 - [c13]Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara:
Voronoi game on graphs and its complexity. CIG 2006: 265-271 - 2005
- [j8]Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discret. Appl. Math. 145(3): 479-482 (2005) - [c12]Ryuhei Uehara, Yushi Uno:
Laminar Structure of Ptolemaic Graphs and Its Applications. ISAAC 2005: 186-195 - [c11]Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara:
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444 - 2004
- [j7]Peisen Zhang, Huitao Sheng, Ryuhei Uehara:
A double classification tree search algorithm for index SNP selection. BMC Bioinform. 5: 89 (2004) - [c10]Ryuhei Uehara:
Canonical Data Structure for Interval Probe Graphs. ISAAC 2004: 859-870 - [c9]Ryuhei Uehara, Yushi Uno:
Efficient Algorithms for the Longest Path Problem. ISAAC 2004: 871-883 - 2003
- [c8]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118 - 2002
- [c7]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108 - [c6]Ryuhei Uehara:
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. ICALP 2002: 993-1004 - 2000
- [j6]Ryuhei Uehara, Zhi-Zhong Chen:
Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000) - [j5]Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener:
Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. 230(1-2): 131-147 (2000) - [c5]Ryuhei Uehara, Zhi-Zhong Chen:
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. IFIP TCS 2000: 84-98
1990 – 1999
- 1999
- [j4]Ryuhei Uehara:
A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. Int. J. Found. Comput. Sci. 10(4): 473-482 (1999) - [j3]Ryuhei Uehara, Zhi-Zhong Chen, Xin He:
Fast RNC and NC Algorithms for Maximal Path Sets. Theor. Comput. Sci. 215(1-2): 89-98 (1999) - [c4]Ryuhei Uehara:
Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. ISPAN 1999: 350-355 - 1997
- [j2]Ryuhei Uehara:
Collapse of PP with a Semi-Random Source to BPP. Inf. Process. Lett. 61(2): 83-87 (1997) - [c3]Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener:
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. EuroCOLT 1997: 171-184 - [c2]Ryuhei Uehara:
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. WG 1997: 333-341 - 1996
- [c1]Ryuhei Uehara, Zhi-Zhong Chen, Xin He:
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. COCOON 1996: 209-218 - [i1]Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener:
Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j1]Ryuhei Uehara:
Efficient Simulations by a Biased Coin. Inf. Process. Lett. 56(5): 245-248 (1995)
Coauthor Index
[i26] [i25] [j107] [j106] [j102] [c111] [c110] [c107] [c105] [i22] [c104] [i19] [j90] [j78] [c88] [i14] [j75] [j72] [c84] [c83] [j66] [c78] [i11] [j60] [i10] [j56] [c72] [c71] [c70] [c66] [j52] [j51] [j49] [c64] [c61] [c60] [i8] [i6] [i5] [j40] [c55] [c53] [c52] [j37] [j33] [j32] [j29] [j28] [j25] [j23] [c43] [c39] [c38] [c36] [c33] [c32] [i2] [c27] [c20] [c13] [c7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
