Ryuhei Uehara

272 papers A* 1A 4B 48C 11Misc 14Journal 143Unranked 48
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computational Complexity of Swish.
CoRR
Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi
2026 A conf
Dudeney's Dissection Is Optimal.
ITCS
Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2026 — book
First Course in Algorithms Through Puzzles, Second Editiontion
Ryuhei Uehara
2025 J jnl
All Polyhedral Manifolds are Connected by a 2-Step Refolding.
J. Inf. Process.
Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2025 J jnl
Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
2025 J jnl
Constant time enumeration of weighted trees.
Discret. Appl. Math.
Mengze Qian, Ryuhei Uehara
2025 J jnl
Gathering on a circle with limited visibility by anonymous oblivious robots.
Theor. Comput. Sci.
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
2025 A conf
Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.
ECAI
Kazuki Takada, Mutsunori Banbara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Torsten Schaub, Ryuhei Uehara
2025 J jnl
Overlapping of Lattice Unfolding for Cuboids.
IEICE Trans. Inf. Syst.
Takumi Shiota, Tonan Kamata, Ryuhei Uehara
2025 — conf
Puzzles are hard enough just by rotations.
CCCG
Takeshi Yamada, Tom C. van der Zanden, Ryuhei Uehara
2025 — conf
Quasigeodesics on the Cube.
CCCG
MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Thomas C. Hull, Anna Lubiw, Jayson Lynch, Klara Mundilova, Chie Nara, Joseph O'Rourke, Frederick Stock, Josef Tkadlec, Ryuhei Uehara
2025 J jnl
Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword.
J. Graph Algorithms Appl.
Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
2025 — conf
The Number of Non-overlapping Unfoldings in Convex Polyhedra.
CCCG
Takumi Shiota, Yudai Enomoto, Masashi Gorobe, Takashi Horiyama, Tonan Kamata, Toshiki Saitoh, Ryuhei Uehara
2024 J jnl
All Polyhedral Manifolds are Connected by a 2-Step Refolding.
CoRR
Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang
2024 B conf
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.
WALCOM
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara
2024 Misc conf
Computational Complexity of Matching Match Puzzle.
FUN
Yuki Iburi, Ryuhei Uehara
2024 J jnl
Computational complexity of jumping block puzzles.
Theor. Comput. Sci.
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
2024 J jnl
Dudeney's Dissection is Optimal.
CoRR
Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2024 J jnl
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs.
Discret. Appl. Math.
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
2024 B conf
On the Computational Complexity of Generalized Common Shape Puzzles.
SOFSEM
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
2024 J jnl
Reconfiguration of vertex-disjoint shortest paths on graphs.
J. Graph Algorithms Appl.
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2024 B ed.
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
WALCOM
Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
2023 J jnl
Any platonic solid can transform to another by
Comput. Geom.
Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2023 J jnl
Developing a tetramonohedron with minimum cut length.
Comput. Geom.
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2023 J jnl
Efficient Folding Algorithms for Convex Polyhedra.
Discret. Comput. Geom.
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2023 J jnl
Mathematical characterizations and computational complexity of anti-slide puzzles.
Theor. Comput. Sci.
Ko Minamisawa, Ryuhei Uehara, Masao Hara
2023 J jnl
On the Computational Complexity of Generalized Common Shape Puzzles.
CoRR
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
2023 — conf
Overlapping of Lattice Unfolding for Cuboids.
CCCG
Takumi Shiota, Tonan Kamata, Ryuhei Uehara
2023 B conf
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs.
WALCOM
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2023 J jnl
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci.
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
Bicolored Path Embedding Problems Inspired by Protein Folding Models.
IEICE Trans. Inf. Syst.
Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta
2022 — conf
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.
SWAT
Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
2022 — conf
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.
CCCG
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022 J jnl
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.
CoRR
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022 — conf
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature.
CCCG
Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
2022 J jnl
Cyclic Shift Problems on Graphs.
IEICE Trans. Inf. Syst.
Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara
2022 — conf
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.
CCCG
Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
2022 J jnl
Efficient segment folding is hard.
Comput. Geom.
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2022 J jnl
Guest Editors' Foreword.
J. Graph Algorithms Appl.
Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara
2022 J jnl
Logical Matrix Representations in Map Folding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yiyang Jia, Jun Mitani, Ryuhei Uehara
2022 — conf
Quasi-Twisting Convex Polyhedra.
CCCG
Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec
2022 J jnl
Research on Dissections of a Net of a Cube into Nets of Cubes.
IEICE Trans. Inf. Syst.
Tamami Okada, Ryuhei Uehara
2022 Misc conf
Rolling Polyhedra on Tessellations.
FUN
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth J. Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
2022 Misc conf
Sorting Balls and Water: Equivalence and Computational Complexity.
FUN
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
Sorting Balls and Water: Equivalence and Computational Complexity.
CoRR
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
Token shifting on graphs.
Int. J. Comput. Math. Comput. Syst. Theory
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
2022 J jnl
Ununfoldable polyhedra with 6 vertices or 6 faces.
Comput. Geom.
Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
2021 J jnl
Algorithmic enumeration of surrounding polygons.
Discret. Appl. Math.
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2021 — conf
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.
CCCG
Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021 J jnl
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.
CoRR
Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
2021 Misc conf
Computational Complexity of Jumping Block Puzzles.
COCOON
Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
2021 J jnl
Computational Complexity of Jumping Block Puzzles.
CoRR
Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
2021 B conf
Cyclic Shift Problems on Graphs.
WALCOM
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
2021 B conf
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.
WALCOM
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
2021 J jnl
Efficient Folding Algorithms for Regular Polyhedra.
CoRR
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2021 B conf
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles.
WALCOM
Ko Minamisawa, Ryuhei Uehara, Masao Hara
2021 J jnl
Max-Min 3-Dispersion Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2021 J jnl
Research on Map Folding with Boundary Order on Simple Fold.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yiyang Jia, Jun Mitani, Ryuhei Uehara
2021 J jnl
Shortest reconfiguration of sliding tokens on subclasses of interval graphs.
Theor. Comput. Sci.
Takeshi Yamada, Ryuhei Uehara
2021 J jnl
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.
CoRR
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
2021 Misc conf
Token Shifting on Graphs.
COCOON
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
2021 B ed.
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
WALCOM
Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
2020 Misc ed.
10th International Conference on Fun with Algorithms, FUN 2021, Favignana Island, Sicily, Italy, May 30 - June 1, 2021
FUN
Martin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara
2020 J jnl
Complexity of the Maximum
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2020 J jnl
Cyclic Shift Problems on Graphs.
CoRR
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
2020 J jnl
Efficient Algorithm for 2 ×
J. Inf. Process.
Yiyang Jia, Jun Mitani, Ryuhei Uehara
2020 J jnl
Efficient Algorithm for Box Folding.
J. Graph Algorithms Appl.
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
2020 B conf
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.
WALCOM
Dat Hoang Tran, Ryuhei Uehara
2020 — conf
Efficient Folding Algorithms for Regular Polyhedra.
CCCG
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2020 J jnl
Efficient Segment Folding is Hard.
CoRR
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2020 J jnl
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs.
Theor. Comput. Sci.
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
2020 A conf
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.
DISC
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
2020 J jnl
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.
CoRR
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
2020 — book
Introduction to Computational Origami - The World of New Computational Geometry
Ryuhei Uehara
2020 J jnl
Minimum Forcing Sets for Single-vertex Crease Pattern.
J. Inf. Process.
Koji Ouchi, Ryuhei Uehara
2020 J jnl
Parameterized complexity of independent set reconfiguration problems.
Discret. Appl. Math.
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2020 J jnl
Rectangular Unfoldings of Polycubes.
J. Inf. Process.
Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara
2020 J jnl
Symmetric assembly puzzles are hard, beyond a few pieces.
Comput. Geom.
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2020 J jnl
Valid Orderings of Layers When Simple-Folding a Map.
J. Inf. Process.
Yiyang Jia, Jun Mitani, Ryuhei Uehara
2019 — conf
Ecient Segment Folding is Hard.
CCCG
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2019 B conf
Efficient Algorithm for Box Folding.
WALCOM
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
2019 J jnl
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.
IEICE Trans. Inf. Syst.
Koji Ouchi, Ryuhei Uehara
2019 — book
First Course in Algorithms Through Puzzles
Ryuhei Uehara
2019 J jnl
Guest Editors' Foreword.
J. Graph Algorithms Appl.
M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
2019 Misc conf
Max-Min 3-Dispersion Problems.
COCOON
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2019 — conf
Minimum Forcing Sets for Single-Vertex Crease Pattern.
CCCG
Koji Ouchi, Ryuhei Uehara
2019 J jnl
On Computational Complexity of Pipe Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara
2019 B conf
On the Complexity of Lattice Puzzles.
ISAAC
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
2019 B conf
Reconfiguring Undirected Paths.
WADS
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019 J jnl
Reconfiguring Undirected Paths.
CoRR
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019 — conf
Rectangular Unfoldings of Polycubes.
CCCG
Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara
2019 J jnl
Report from EATCS Japan Chapter.
Bull. EATCS
Ryuhei Uehara
2019 J jnl
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl.
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019 C conf
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.
CIAC
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
2019 — conf
Simple Fold and Cut Problem for Line Segments.
CCCG
Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2018 J jnl
Bumpy pyramid folding.
Comput. Geom.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2018 B conf
Complexity of the Maximum k-Path Vertex Cover Problem.
WALCOM
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2018 C conf
Computational Complexity of Robot Arm Simulation Problems.
IWOCA
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
2018 B conf
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.
WALCOM
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
2018 Misc conf
Exact Algorithms for the Max-Min Dispersion Problem.
FAW
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2018 J jnl
Flat foldings of plane graphs with prescribed angles and edge lengths.
J. Comput. Geom.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2018 — conf
Packing Cube Nets into Rectangles with O(1) Holes.
JCDCGGG
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow
2018 J jnl
Rep-Cubes: Dissection of a Cube into Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara
2018 J jnl
Report from EATCS Japan Chapter.
Bull. EATCS
Ryuhei Uehara
2018 J jnl
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.
CoRR
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
2018 J jnl
Special Issue on Reconfiguration Problems.
Algorithms
Faisal N. Abu-Khzam, Henning Fernau, Ryuhei Uehara
2018 J jnl
Swapping Colored Tokens on Graphs.
CoRR
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018 J jnl
Swapping colored tokens on graphs.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018 — conf
Toward Unfolding Doubly Covered n-Stars.
JCDCGGG
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
2018 B ed.
WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings
WALCOM
M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
2017 J jnl
Common developments of three incongruent boxes of area 30.
Comput. Geom.
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
2017 J jnl
Complexity of Tiling a Polygon with Trominoes or Bars.
Discret. Comput. Geom.
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
2017 B conf
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.
WALCOM
Koji Ouchi, Ryuhei Uehara
2017 J jnl
Ferrers dimension of grid intersection graphs.
Discret. Appl. Math.
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2017 — conf
Rep-cubes: Unfolding and Dissection of Cubes.
CCCG
Dawei Xu, Takashi Horiyama, Ryuhei Uehara
2017 J jnl
Report from EATCS Japan Chapter.
Bull. EATCS
Ryuhei Uehara
2017 J jnl
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.
J. Inf. Process.
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2017 B conf
Sequentially Swapping Colored Tokens on Graphs.
WALCOM
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2017 B conf
Sliding Tokens on Block Graphs.
WALCOM
Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara
2017 J jnl
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
CoRR
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2017 J jnl
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.
J. Inf. Process.
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
2016 J jnl
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom.
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016 J jnl
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.
J. Graph Algorithms Appl.
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
2016 Misc conf
Convex Configurations on Nana-kin-san Puzzle.
FUN
Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya
2016 J jnl
Folding a paper strip to minimize thickness.
J. Discrete Algorithms
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2016 J jnl
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.
Discret. Appl. Math.
Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
2016 J jnl
Report from the Japanese Chapter.
Bull. EATCS
Ryuhei Uehara
2016 B conf
Shortest Reconfiguration of Sliding Tokens on a Caterpillar.
WALCOM
Takeshi Yamada, Ryuhei Uehara
2016 J jnl
Single-Player and Two-Player Buttons & Scissors Games.
CoRR
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
2016 B conf
Sliding Tokens on a Cactus.
ISAAC
Duc A. Hoang, Ryuhei Uehara
2016 J jnl
The Convex Configurations of "Sei Shonagon Chie no Ita, " Tangram, and Other Silhouette Puzzles with Seven Pieces.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Eli Fox-Epstein, Kazuho Katsumata, Ryuhei Uehara
2015 — conf
Box Pleating is Hard.
JCDCGG
Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
2015 C conf
Common Developments of Three Incongruent Boxes of Area 30.
TAMC
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
2015 B conf
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.
WALCOM
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
2015 B conf
Competitive Diffusion on Weighted Graphs.
WADS
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015 B conf
Folding a Paper Strip to Minimize Thickness.
WALCOM
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2015 J jnl
Linear-time algorithm for sliding tokens on trees.
Theor. Comput. Sci.
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2015 J jnl
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.
IEICE Trans. Inf. Syst.
Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
2015 J jnl
Shortest Reconfiguration of Sliding Tokens on a Caterpillar.
CoRR
Takeshi Yamada, Ryuhei Uehara
2015 — conf
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
JCDCGG
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
2015 B conf
Sliding Token on Bipartite Permutation Graphs.
ISAAC
Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara
2015 B conf
Swapping Colored Tokens on Graphs.
WADS
Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2015 — conf
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
JCDCGG
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2015 J jnl
The Japanese Chapter.
Bull. EATCS
Ryuhei Uehara
2014 J jnl
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci.
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014 J jnl
Base-object location problems for base-monotone regions.
Theor. Comput. Sci.
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2014 — conf
Bumpy Pyramid Folding.
CCCG
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2014 J jnl
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci.
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2014 J jnl
Computational Complexity and an Integer Programming Model of Shakashaka.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2014 J jnl
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2014 J jnl
Computational Complexity of Piano-Hinged Dissections.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara
2014 B conf
Depth-First Search Using O(n) Bits.
ISAAC
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
2014 A conf
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.
GD
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014 J jnl
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.
CoRR
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014 J jnl
Folding a Paper Strip to Minimize Thickness.
CoRR
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2014 C conf
Intersection Dimension of Bipartite Graphs.
TAMC
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2014 C conf
On the Parameterized Complexity for Token Jumping on Graphs.
TAMC
Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2014 B conf
Polynomial-Time Algorithm for Sliding Tokens on Trees.
ISAAC
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014 J jnl
Polynomial-Time Algorithm for Sliding Tokens on Trees.
CoRR
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014 C conf
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs.
TAMC
Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
2014 J jnl
Report from the Japanese Chapter.
Bull. EATCS
Ryuhei Uehara
2014 Misc conf
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.
FUN
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2014 — conf
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.
CCCG
Eli Fox-Epstein, Ryuhei Uehara
2014 J jnl
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.
CoRR
Eli Fox-Epstein, Ryuhei Uehara
2014 J jnl
The graph isomorphism problem on geometric graphs.
Discret. Math. Theor. Comput. Sci.
Ryuhei Uehara
2014 J jnl
The height of random
Random Struct. Algorithms
Colin Cooper, Alan M. Frieze, Ryuhei Uehara
2014 J jnl
UNO is hard, even for a single player.
Theor. Comput. Sci.
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013 B conf
Base Location Problems for Base-Monotone Regions.
WALCOM
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2013 J jnl
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
Discret. Math. Algorithms Appl.
Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2013 — conf
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
CCCG
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
2013 J jnl
Common Developments of Three Incongruent Orthogonal Boxes.
Int. J. Comput. Geom. Appl.
Toshihiro Shirakawa, Ryuhei Uehara
2013 — conf
Computational complexity and an integer programming model of Shakashaka.
CCCG
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2013 J jnl
Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim.
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
2013 J jnl
Efficient algorithms for a simple network design problem.
Networks
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2013 J jnl
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.
IEICE Trans. Inf. Syst.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2013 J jnl
Route-Enabling Graph Orientation Problems.
Algorithmica
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2013 J jnl
The Japanese Chapter.
Bull. EATCS
Ryuhei Uehara
2013 J jnl
The complexity of the stamp folding problem.
Theor. Comput. Sci.
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
2013 J jnl
Tractabilities and Intractabilities on Geometric Intersection Graphs.
Algorithms
Ryuhei Uehara
2013 — conf
Variations on Instant Insanity.
Space-Efficient Data Structures, Streams, and Algorithms
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
2013 — conf
Zipper Unfoldability of Domes and Prismoids.
CCCG
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012 B conf
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.
ISAAC
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 — conf
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.
SWAT
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 J jnl
Any Monotone Function Is Realized by Interlocked Polygons.
Algorithms
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012 J jnl
Bipartite Permutation Graphs are reconstructible.
Discret. Math. Algorithms Appl.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2012 B conf
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
WALCOM
Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2012 — conf
Common Developments of Three Different Orthogonal Boxes.
CCCG
Toshihiro Shirakawa, Ryuhei Uehara
2012 — conf
Covering Points with Disjoint Unit Disks.
CCCG
Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara
2012 J jnl
Faster computation of the Robinson-Foulds distance between phylogenetic networks.
Inf. Sci.
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2012 J jnl
Ghost chimneys.
Int. J. Comput. Geom. Appl.
David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
2012 J jnl
NP-completeness of generalized Kaboozle.
Inf. Media Technol.
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012 J jnl
NP-completeness of generalized Kaboozle.
J. Inf. Process.
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012 J jnl
On Complexity of Flooding Games on Graphs with Interval Representations
CoRR
Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 — conf
On Complexity of Flooding Games on Graphs with Interval Representations.
TJJCCGG
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 J jnl
On bipartite powers of bigraphs.
Discret. Math. Theor. Comput. Sci.
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara
2012 — conf
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.
CCCG
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
2012 J jnl
Random generation and enumeration of bipartite permutation graphs.
J. Discrete Algorithms
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2012 J jnl
Report from the Japanese Chapter.
Bull. EATCS
Ryuhei Uehara
2011 J jnl
Algorithmic Folding Complexity.
Graphs Comb.
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
2011 — conf
Common Developments of Several Different Orthogonal Boxes.
CCCG
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara
2011 C conf
Complexity of the Stamp Folding Problem.
COCOA
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
2011 J jnl
Guest Editor's Foreword.
J. Graph Algorithms Appl.
Sandip Das, Ryuhei Uehara
2011 C conf
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.
TAMC
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011 J jnl
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.
J. Graph Algorithms Appl.
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011 — conf
On covering of any point configuration by disjoint unit disks.
CCCG
Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara
2011 J jnl
On the complexity of reconfiguration problems.
Theor. Comput. Sci.
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2011 J jnl
The Voronoi game on graphs and its complexity.
J. Graph Algorithms Appl.
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
2011 J jnl
Voronoi Game on a Path.
IEICE Trans. Inf. Syst.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 — conf
Any monotone boolean function can be realized by interlocked polygons.
CCCG
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2010 — conf
Bipartite Permutation Graphs Are Reconstructible.
COCOA (2)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 — conf
Coverage with
COCOA (2)
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
2010 J jnl
Efficient enumeration of all ladder lotteries and its application.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
2010 J jnl
Enumeration of the perfect sequences of a chordal graph.
Theor. Comput. Sci.
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
2010 B conf
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.
CPM
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2010 — conf
Ghost chimneys.
CCCG
David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
2010 Misc conf
Kaboozle Is NP-complete, Even in a Strip.
FUN
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2010 — conf
On stretch minimization problem on unit strip paper.
CCCG
Ryuhei Uehara
2010 J jnl
Random Generation and Enumeration of Proper Interval Graphs.
IEICE Trans. Inf. Syst.
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2010 B conf
Reconstruction Algorithm for Permutation Graphs.
WALCOM
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 J jnl
Reconstruction of interval graphs.
Theor. Comput. Sci.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 J jnl
Scale Free Properties of Random
Math. Comput. Sci.
Colin Cooper, Ryuhei Uehara
2010 J jnl
The complexity of UNO
CoRR
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2010 Misc conf
UNO Is Hard, Even for a Single Player.
FUN
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2009 J jnl
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
J. Comput. Sci. Technol.
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2009 B conf
Algorithmic Folding Complexity.
ISAAC
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
2009 B conf
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.
WG
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
2009 — conf
How to make a picturesque maze.
CCCG
Yoshio Okamoto, Ryuhei Uehara
2009 J jnl
Laminar structure of ptolemaic graphs with applications.
Discret. Appl. Math.
Ryuhei Uehara, Yushi Uno
2009 B conf
Random Generation and Enumeration of Bipartite Permutation Graphs.
ISAAC
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2009 B conf
Random Generation and Enumeration of Proper Interval Graphs.
WALCOM
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2009 Misc conf
Reconstruction of Interval Graphs.
COCOON
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2009 B conf
Route-Enabling Graph Orientation Problems.
ISAAC
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2009 J jnl
Scale free interval graphs.
Theor. Comput. Sci.
Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
2009 B ed.
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings
WALCOM
Sandip Das, Ryuhei Uehara
2008 B conf
Bandwidth of Bipartite Permutation Graphs.
ISAAC
Ryuhei Uehara
2008 J jnl
Counting the number of independent sets in chordal graphs.
J. Discrete Algorithms
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2008 B conf
Enumeration of Perfect Sequences of Chordal Graph.
ISAAC
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
2008 — conf
Inverting Linkages with Stretch.
CCCG
Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara
2008 J jnl
Longest Path Problems on Ptolemaic Graphs.
IEICE Trans. Inf. Syst.
Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara
2008 B conf
On the Complexity of Reconfiguration Problems.
ISAAC
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2008 — conf
Polygons Folding to Plural Incongruent Orthogonal Boxes.
CCCG
Ryuhei Uehara
2008 C conf
Scale Free Interval Graphs.
AAIM
Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
2008 B conf
Simple Geometrical Intersection Graphs.
WALCOM
Ryuhei Uehara
2008 J jnl
Special Section on Discrete Mathematics and Its Applications.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ryuhei Uehara
2007 C conf
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
TAMC
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007 C conf
Efficient Algorithms for Airline Problem.
TAMC
Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007 J jnl
Linear structure of bipartite permutation graphs and the longest path problem.
Inf. Process. Lett.
Ryuhei Uehara, Gabriel Valiente
2007 J jnl
On Computing Longest Paths in Small Graph Classes.
Int. J. Found. Comput. Sci.
Ryuhei Uehara, Yushi Uno
2007 J jnl
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
Algorithmica
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2006 — conf
The Complexity of a Pop-Up Book.
CCCG
Ryuhei Uehara, Sachio Teramoto
2006 — conf
Voronoi game on graphs and its complexity.
CIG
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
2005 J jnl
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
Discret. Appl. Math.
Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya
2005 B conf
Laminar Structure of Ptolemaic Graphs and Its Applications.
ISAAC
Ryuhei Uehara, Yushi Uno
2005 B conf
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
WG
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2004 J jnl
A double classification tree search algorithm for index SNP selection.
BMC Bioinform.
Peisen Zhang, Huitao Sheng, Ryuhei Uehara
2004 B conf
Canonical Data Structure for Interval Probe Graphs.
ISAAC
Ryuhei Uehara
2004 B conf
Efficient Algorithms for the Longest Path Problem.
ISAAC
Ryuhei Uehara, Yushi Uno
2003 B conf
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
WG
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2002 A* conf
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.
ICALP
Ryuhei Uehara
2002 — conf
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
CCCG
Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang
2000 J jnl
Identification of Partial Disjunction, Parity, and Threshold Functions.
Theor. Comput. Sci.
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
2000 — conf
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.
IFIP TCS
Ryuhei Uehara, Zhi-Zhong Chen
2000 J jnl
Parallel approximation algorithms for maximum weighted matching in general graphs.
Inf. Process. Lett.
Ryuhei Uehara, Zhi-Zhong Chen
1999 J jnl
A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.
Int. J. Found. Comput. Sci.
Ryuhei Uehara
1999 — conf
Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.
ISPAN
Ryuhei Uehara
1999 J jnl
Fast
Theor. Comput. Sci.
Ryuhei Uehara, Zhi-Zhong Chen, Xin He
1997 B conf
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.
WG
Ryuhei Uehara
1997 J jnl
Collapse of PP with a Semi-Random Source to BPP.
Inf. Process. Lett.
Ryuhei Uehara
1997 — conf
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.
EuroCOLT
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
1996 Misc conf
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.
COCOON
Ryuhei Uehara, Zhi-Zhong Chen, Xin He
1996 J jnl
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
Electron. Colloquium Comput. Complex.
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
1995 J jnl
Efficient Simulations by a Biased Coin.
Inf. Process. Lett.
Ryuhei Uehara