Ryuhei Uehara
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
75
Venues
17
Active years
1996–2026
Best venue rank
A*
Where they publish
Papers
75 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | FUN | A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles. | Brynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della H. Hendrickson, Tonan Kamata, Ryuhei Uehara |
| 2026 | FUN | Computational Complexity of Swish Is Solved. | Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi |
| 2025 | ECAI | Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Kazuki Takada, Mutsunori Banbara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Torsten Schaub, Ryuhei Uehara |
| 2024 | FUN | Computational Complexity of Matching Match Puzzle. | Yuki Iburi, Ryuhei Uehara |
| 2024 | SOFSEM | On the Computational Complexity of Generalized Common Shape Puzzles. | Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara |
| 2024 | WALCOM | Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara |
| 2023 | WALCOM | Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. | Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara |
| 2022 | FUN | 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 |
| 2022 | FUN | 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 |
| 2021 | COCOON | Computational Complexity of Jumping Block Puzzles. | Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara |
| 2021 | COCOON | Token Shifting on Graphs. | Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta |
| 2021 | WALCOM | Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. | Ko Minamisawa, Ryuhei Uehara, Masao Hara |
| 2021 | WALCOM | Cyclic Shift Problems on Graphs. | Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta |
| 2021 | WALCOM | Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. | Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara |
| 2020 | WALCOM | Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. | Dat Hoang Tran, Ryuhei Uehara |
| 2019 | CIAC | Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. | Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | ISAAC | On the Complexity of Lattice Puzzles. | Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara |
| 2019 | WADS | Reconfiguring Undirected Paths. | Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2019 | WALCOM | Efficient Algorithm for Box Folding. | Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara |
| 2018 | FAW | 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 |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | WALCOM | Complexity of the Maximum k-Path Vertex Cover Problem. | Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden |
| 2018 | WALCOM | Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. | Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara |
| 2017 | WALCOM | Sliding Tokens on Block Graphs. | Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara |
| 2017 | WALCOM | Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. | Koji Ouchi, Ryuhei Uehara |
| 2017 | WALCOM | 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 |
| 2016 | FUN | Convex Configurations on Nana-kin-san Puzzle. | Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya |
| 2016 | ISAAC | Sliding Tokens on a Cactus. | Duc A. Hoang, Ryuhei Uehara |
| 2016 | WALCOM | Shortest Reconfiguration of Sliding Tokens on a Caterpillar. | Takeshi Yamada, Ryuhei Uehara |
| 2015 | ISAAC | Sliding Token on Bipartite Permutation Graphs. | Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara |
| 2015 | TAMC | Common Developments of Three Incongruent Boxes of Area 30. | Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara |
| 2015 | WADS | Competitive Diffusion on Weighted Graphs. | Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou |
| 2015 | WADS | Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno |
| 2015 | WALCOM | Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. | Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara |
| 2015 | WALCOM | Folding a Paper Strip to Minimize Thickness. | Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2014 | FUN | 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 |
| 2014 | GD | 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 |
| 2014 | ISAAC | 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 |
| 2014 | ISAAC | 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 |
| 2014 | TAMC | Intersection Dimension of Bipartite Graphs. | Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara |
| 2014 | TAMC | On the Parameterized Complexity for Token Jumping on Graphs. | Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka |
| 2014 | TAMC | Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. | Matsuo Konagaya, Yota Otachi, Ryuhei Uehara |
| 2013 | WALCOM | 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 |
| 2012 | ISAAC | 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 |
| 2012 | WALCOM | Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
| 2011 | COCOA | Complexity of the Stamp Folding Problem. | Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito |
| 2011 | TAMC | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
| 2010 | COCOA | Coverage with | 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 Sacristn Adinolfi, Diane L. Souvaine, Ryuhei Uehara |
| 2010 | COCOA | Bipartite Permutation Graphs Are Reconstructible. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2010 | CPM | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
| 2010 | FUN | Kaboozle Is NP-complete, Even in a Strip. | Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara |
| 2010 | FUN | UNO Is Hard, Even for a Single Player. | Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2010 | WALCOM | Reconstruction Algorithm for Permutation Graphs. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2009 | COCOON | Reconstruction of Interval Graphs. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2009 | ISAAC | Algorithmic Folding Complexity. | Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara |
| 2009 | ISAAC | Route-Enabling Graph Orientation Problems. | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
| 2009 | ISAAC | Random Generation and Enumeration of Bipartite Permutation Graphs. | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara |
| 2009 | WALCOM | Random Generation and Enumeration of Proper Interval Graphs. | Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara |
| 2009 | WG | Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. | Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
| 2008 | AAIM | Scale Free Interval Graphs. | Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe |
| 2008 | ISAAC | On the Complexity of Reconfiguration Problems. | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno |
| 2008 | ISAAC | Enumeration of Perfect Sequences of Chordal Graph. | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
| 2008 | ISAAC | Bandwidth of Bipartite Permutation Graphs. | Ryuhei Uehara |
| 2008 | WALCOM | Simple Geometrical Intersection Graphs. | Ryuhei Uehara |
| 2007 | TAMC | A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2007 | TAMC | Efficient Algorithms for Airline Problem. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2005 | ISAAC | Laminar Structure of Ptolemaic Graphs and Its Applications. | Ryuhei Uehara, Yushi Uno |
| 2005 | WG | Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
| 2004 | ISAAC | Canonical Data Structure for Interval Probe Graphs. | Ryuhei Uehara |
| 2004 | ISAAC | Efficient Algorithms for the Longest Path Problem. | Ryuhei Uehara, Yushi Uno |
| 2003 | WG | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2002 | ICALP | Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. | Ryuhei Uehara |
| 1997 | WG | A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. | Ryuhei Uehara |
| 1996 | COCOON | Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. | Ryuhei Uehara, Zhi-Zhong Chen, Xin He |