Ryuhei Uehara

According to our database, Ryuhei Uehara authored at least 196 papers between 1995 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2025

Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword.

Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen

J. Graph Algorithms Appl., 2025

Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases.

Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025

Constant time enumeration of weighted trees.

Mengze Qian, Ryuhei Uehara

Discret. Appl. Math., 2025

2024

Computational complexity of jumping block puzzles.

Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara

Theor. Comput. Sci., February, 2024

Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs.

Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara

Discret. Appl. Math., January, 2024

Dudeney's Dissection is Optimal.

Erik D. Demaine, Tonan Kamata, Ryuhei Uehara

CoRR, 2024

All Polyhedral Manifolds are Connected by a 2-Step Refolding.

Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang

CoRR, 2024

Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.

Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 2024

On the Computational Complexity of Generalized Common Shape Puzzles.

Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Computational Complexity of Matching Match Puzzle.

Yuki Iburi, Ryuhei Uehara

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Efficient Folding Algorithms for Convex Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Discret. Comput. Geom., December, 2023

Any platonic solid can transform to another by <i>O</i>(1) refoldings.

Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

Comput. Geom., August, 2023

Developing a tetramonohedron with minimum cut length.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Comput. Geom., 2023

Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs.

Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 2023

Overlapping of Lattice Unfolding for Cuboids.

Takumi Shiota, Tonan Kamata, Ryuhei Uehara

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Logical Matrix Representations in Map Folding.

Yiyang Jia, Jun Mitani, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., October, 2022

Guest Editors' Foreword.

Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara

J. Graph Algorithms Appl., 2022

Research on Dissections of a Net of a Cube into Nets of Cubes.

Tamami Okada, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2022

Bicolored Path Embedding Problems Inspired by Protein Folding Models.

Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta

IEICE Trans. Inf. Syst., 2022

Efficient segment folding is hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Comput. Geom., 2022

Ununfoldable polyhedra with 6 vertices or 6 faces.

Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara

Comput. Geom., 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Sorting Balls and Water: Equivalence and Computational Complexity.

Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Rolling Polyhedra on Tessellations.

Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth J. Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Quasi-Twisting Convex Polyhedra.

Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature.

Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.

Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.

Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Shortest reconfiguration of sliding tokens on subclasses of interval graphs.

Takeshi Yamada, Ryuhei Uehara

Theor. Comput. Sci., 2021

Research on Map Folding with Boundary Order on Simple Fold.

Yiyang Jia, Jun Mitani, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Algorithmic enumeration of surrounding polygons.

Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi

Discret. Appl. Math., 2021

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.

Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda

CoRR, 2021

Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.

Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 2021

Cyclic Shift Problems on Graphs.

Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta

Proceedings of the WALCOM: Algorithms and Computation, 2021

Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles.

Ko Minamisawa, Ryuhei Uehara, Masao Hara

Proceedings of the WALCOM: Algorithms and Computation, 2021

Token Shifting on Graphs.

Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Computational Complexity of Jumping Block Puzzles.

Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.

Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Valid Orderings of Layers When Simple-Folding a Map.

Yiyang Jia, Jun Mitani, Ryuhei Uehara

J. Inf. Process., 2020

Efficient Algorithm for 2 × <i>n</i> Map Folding with a Box-pleated Crease Pattern.

Yiyang Jia, Jun Mitani, Ryuhei Uehara

J. Inf. Process., 2020

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara

J. Inf. Process., 2020

Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Parameterized complexity of independent set reconfiguration problems.

Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

Discret. Appl. Math., 2020

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.

Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.

Dat Hoang Tran, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Efficient Folding Algorithms for Regular Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Introduction to Computational Origami - The World of New Computational Geometry

Ryuhei Uehara

Springer, ISBN: 978-981-15-4469-9, 2020

2019

Guest Editors' Foreword.

M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara

J. Graph Algorithms Appl., 2019

On Computational Complexity of Pipe Puzzles.

Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Efficient Algorithm for Box Folding.

Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Reconfiguring Undirected Paths.

Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On the Complexity of Lattice Puzzles.

Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Max-Min 3-Dispersion Problems.

Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.

Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Minimum Forcing Sets for Single-Vertex Crease Pattern.

Koji Ouchi, Ryuhei Uehara

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Simple Fold and Cut Problem for Line Segments.

Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Ecient Segment Folding is Hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

First Course in Algorithms Through Puzzles

Ryuhei Uehara

Springer, ISBN: 978-981-13-3187-9, 2019

2018

Swapping colored tokens on graphs.

Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno

Theor. Comput. Sci., 2018

Rep-Cubes: Dissection of a Cube into Nets.

Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Report from EATCS Japan Chapter.

Ryuhei Uehara

Bull. EATCS, 2018

Special Issue on Reconfiguration Problems.

Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara

Algorithms, 2018

Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Packing Cube Nets into Rectangles with O(1) Holes.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Toward Unfolding Doubly Covered n-Stars.

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

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Computational Complexity of Robot Arm Simulation Problems.

Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Exact Algorithms for the Max-Min Dispersion Problem.

Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.

Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi

J. Inf. Process., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara

J. Inf. Process., 2017

Complexity of Tiling a Polygon with Trominoes or Bars.

Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

Discret. Comput. Geom., 2017

Ferrers dimension of grid intersection graphs.

Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara

Discret. Appl. Math., 2017

Sequentially Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

Proceedings of the WALCOM: Algorithms and Computation, 2017

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.

Koji Ouchi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 2017

Sliding Tokens on Block Graphs.

Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 2017

Rep-cubes: Unfolding and Dissection of Cubes.

Dawei Xu, Takashi Horiyama, Ryuhei Uehara

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

The Convex Configurations of "Sei Shonagon Chie no Ita, " Tangram, and Other Silhouette Puzzles with Seven Pieces.

Eli Fox-Epstein, Kazuho Katsumata, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Single-Player and Two-Player Buttons & Scissors Games.

Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams

CoRR, 2016

Shortest Reconfiguration of Sliding Tokens on a Caterpillar.

Takeshi Yamada, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Sliding Tokens on a Cactus.

Duc A. Hoang, Ryuhei Uehara

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Convex Configurations on Nana-kin-san Puzzle.

Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Linear-time algorithm for sliding tokens on trees.

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada

Theor. Comput. Sci., 2015

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.

Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2015

Folding a Paper Strip to Minimize Thickness.

Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.

Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Competitive Diffusion on Weighted Graphs.

Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Common Developments of Three Incongruent Boxes of Area 30.

Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara

Proceedings of the Theory and Applications of Models of Computation, 2015

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.

Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

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

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Box Pleating is Hard.

Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Sliding Token on Bipartite Permutation Graphs.

Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

UNO is hard, even for a single player.

Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

Theor. Comput. Sci., 2014

The height of random <i>k</i>-trees and related branching processes.

Colin Cooper, Alan M. Frieze, Ryuhei Uehara

Random Struct. Algorithms, 2014

Computational Complexity of Piano-Hinged Dissections.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

The graph isomorphism problem on geometric graphs.

Ryuhei Uehara

Discret. Math. Theor. Comput. Sci., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

Discret. Math. Theor. Comput. Sci., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou

CoRR, 2014

Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs.

Matsuo Konagaya, Yota Otachi, Ryuhei Uehara

Proceedings of the Theory and Applications of Models of Computation, 2014

On the Parameterized Complexity for Token Jumping on Graphs.

Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

Proceedings of the Theory and Applications of Models of Computation, 2014

Intersection Dimension of Bipartite Graphs.

Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Theory and Applications of Models of Computation, 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Depth-First Search Using O(n) Bits.

Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.

Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.

Eli Fox-Epstein, Ryuhei Uehara

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Bumpy Pyramid Folding.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The complexity of the stamp folding problem.

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto

Theor. Comput. Sci., 2013

Efficient algorithms for a simple network design problem.

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno

Networks, 2013

Coverage with k-transmitters in the presence of obstacles.

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

J. Comb. Optim., 2013

Common Developments of Three Incongruent Orthogonal Boxes.

Toshihiro Shirakawa, Ryuhei Uehara

Int. J. Comput. Geom. Appl., 2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2013

The Japanese Chapter.

Ryuhei Uehara

Bull. EATCS, 2013

Tractabilities and Intractabilities on Geometric Intersection Graphs.

Ryuhei Uehara

Algorithms, 2013

Base Location Problems for Base-Monotone Regions.

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Computational complexity and an integer programming model of Shakashaka.

Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Zipper Unfoldability of Domes and Prismoids.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Variations on Instant Insanity.

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara

Proceedings of the Space-Efficient Data Structures, 2013

2012

NP-completeness of generalized Kaboozle.

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Inf. Media Technol., 2012

Report from the Japanese Chapter.

Ryuhei Uehara

Bull. EATCS, 2012

On bipartite powers of bigraphs.

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara

Discret. Math. Theor. Comput. Sci., 2012

On Complexity of Flooding Games on Graphs with Interval Representations

Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno

CoRR, 2012

Any Monotone Function Is Realized by Interlocked Polygons.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Algorithms, 2012

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.

Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

On Complexity of Flooding Games on Graphs with Interval Representations.

Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Proceedings of the Algorithm Theory - SWAT 2012, 2012

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Common Developments of Three Different Orthogonal Boxes.

Toshihiro Shirakawa, Ryuhei Uehara

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.

Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Covering Points with Disjoint Unit Disks.

Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Guest Editor's Foreword.

Sandip Das, Ryuhei Uehara

J. Graph Algorithms Appl., 2011

Voronoi Game on a Path.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2011

Algorithmic Folding Complexity.

Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno

Graphs Comb., 2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno

Proceedings of the Theory and Applications of Models of Computation, 2011

Complexity of the Stamp Folding Problem.

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito

Proceedings of the Combinatorial Optimization and Applications, 2011

On covering of any point configuration by disjoint unit disks.

Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Common Developments of Several Different Orthogonal Boxes.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Efficient enumeration of all ladder lotteries and its application.

Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada

Theor. Comput. Sci., 2010

Scale Free Properties of Random <i>k</i>-Trees.

Colin Cooper, Ryuhei Uehara

Math. Comput. Sci., 2010

The complexity of UNO

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno

CoRR, 2010

Reconstruction Algorithm for Permutation Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

UNO Is Hard, Even for a Single Player.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Kaboozle Is NP-complete, Even in a Strip.

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Bipartite Permutation Graphs Are Reconstructible.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.

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

Proceedings of the Combinatorial Optimization and Applications, 2010

On stretch minimization problem on unit strip paper.

Ryuhei Uehara

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Any monotone boolean function can be realized by interlocked polygons.

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Ghost chimneys.

David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Laminar structure of ptolemaic graphs with applications.

Ryuhei Uehara, Yushi Uno

Discret. Appl. Math., 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Random Generation and Enumeration of Proper Interval Graphs.

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Random Generation and Enumeration of Bipartite Permutation Graphs.

Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Route-Enabling Graph Orientation Problems.

Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Algorithmic Folding Complexity.

Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Reconstruction of Interval Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

How to make a picturesque maze.

Yoshio Okamoto, Ryuhei Uehara

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Counting the number of independent sets in chordal graphs.

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara

J. Discrete Algorithms, 2008

Special Section on Discrete Mathematics and Its Applications.

Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Longest Path Problems on Ptolemaic Graphs.

Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2008

Simple Geometrical Intersection Graphs.

Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Bandwidth of Bipartite Permutation Graphs.

Ryuhei Uehara

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Enumeration of Perfect Sequences of Chordal Graph.

Yasuko Matsui, Ryuhei Uehara, Takeaki Uno

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

On the Complexity of Reconfiguration Problems.

Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Polygons Folding to Plural Incongruent Orthogonal Boxes.

Ryuhei Uehara

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Inverting Linkages with Stretch.

Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Scale Free Interval Graphs.

Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Linear structure of bipartite permutation graphs and the longest path problem.

Ryuhei Uehara, Gabriel Valiente

Inf. Process. Lett., 2007

On Computing Longest Paths in Small Graph Classes.

Ryuhei Uehara, Yushi Uno

Int. J. Found. Comput. Sci., 2007

Efficient Algorithms for Airline Problem.

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno

Proceedings of the Theory and Applications of Models of Computation, 2007

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Voronoi game on graphs and its complexity.

Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara

Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games (CIG06), 2006

The Complexity of a Pop-Up Book.

Ryuhei Uehara, Sachio Teramoto

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.

Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya

Discret. Appl. Math., 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Laminar Structure of Ptolemaic Graphs and Its Applications.

Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A double classification tree search algorithm for index SNP selection.

Peisen Zhang, Huitao Sheng, Ryuhei Uehara

BMC Bioinform., 2004

Efficient Algorithms for the Longest Path Problem.

Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Canonical Data Structure for Interval Probe Graphs.

Ryuhei Uehara

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Tree Spanners for Bipartite Graphs and Probe Interval Graphs.

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.

Ryuhei Uehara

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.

Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2000

Identification of Partial Disjunction, Parity, and Threshold Functions.

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener

Theor. Comput. Sci., 2000

Parallel approximation algorithms for maximum weighted matching in general graphs.

Ryuhei Uehara, Zhi-Zhong Chen

Inf. Process. Lett., 2000

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.

Ryuhei Uehara, Zhi-Zhong Chen

Proceedings of the Theoretical Computer Science, 2000

1999

Fast <i>RNC</i> and <i>NC</i> Algorithms for Maximal Path Sets.

Ryuhei Uehara, Zhi-Zhong Chen, Xin He

Theor. Comput. Sci., 1999

A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.

Ryuhei Uehara

Int. J. Found. Comput. Sci., 1999

Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.

Ryuhei Uehara

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997

Collapse of PP with a Semi-Random Source to BPP.

Ryuhei Uehara

Inf. Process. Lett., 1997

A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.

Ryuhei Uehara

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.

Ryuhei Uehara, Zhi-Zhong Chen, Xin He

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Efficient Simulations by a Biased Coin.

Ryuhei Uehara

Inf. Process. Lett., 1995