Efficient Simulations by a Biased Coin. - Ryuhei Uehara (Inf. Process. Lett., 1995)

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (COCOON, 1996)

Optimal attribute-efficient learning of disjunction, parity, and threshold functions - Ryuhei Uehara; Kensei Tsuchida; Ingo Wegener (Electron. Colloquium Comput. Complex., 1996)

A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. - Ryuhei Uehara (WG, 1997)

Collapse of PP with a Semi-Random Source to BPP. - Ryuhei Uehara (Inf. Process. Lett., 1997)

Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. - Ryuhei Uehara (ISPAN, 1999)

A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. - Ryuhei Uehara (Int. J. Found. Comput. Sci., 1999)

Fast RNC and NC Algorithms for Maximal Path Sets. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (Theor. Comput. Sci., 1999)

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. - Ryuhei Uehara; Zhi-Zhong Chen (IFIP TCS, 2000)

Parallel approximation algorithms for maximum weighted matching in general graphs. - Ryuhei Uehara; Zhi-Zhong Chen (Inf. Process. Lett., 2000)

Identification of Partial Disjunction, Parity, and Threshold Functions. - Ryuhei Uehara; Kensei Tsuchida; Ingo Wegener (Theor. Comput. Sci., 2000)

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 (CCCG, 2002)

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. - Ryuhei Uehara (ICALP, 2002)

Canonical Data Structure for Interval Probe Graphs. - Ryuhei Uehara (ISAAC, 2004)

Efficient Algorithms for the Longest Path Problem. - Ryuhei Uehara; Yushi Uno (ISAAC, 2004)

A double classification tree search algorithm for index SNP selection. - Peisen Zhang; Huitao Sheng; Ryuhei Uehara (BMC Bioinform., 2004)

Laminar Structure of Ptolemaic Graphs and Its Applications. - Ryuhei Uehara; Yushi Uno (ISAAC, 2005)

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. - Yoshio Okamoto; Takeaki Uno; Ryuhei Uehara (WG, 2005)

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. - Ryuhei Uehara; Seinosuke Toda; Takayuki Nagoya (Discret. Appl. Math., 2005)

The Complexity of a Pop-Up Book. - Ryuhei Uehara; Sachio Teramoto (CCCG, 2006)

Efficient Algorithms for Airline Problem. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (TAMC, 2007)

Tree Spanners for Bipartite Graphs and Probe Interval Graphs. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le; Ryuhei Uehara (Algorithmica, 2007)

On Computing Longest Paths in Small Graph Classes. - Ryuhei Uehara; Yushi Uno (Int. J. Found. Comput. Sci., 2007)

Linear structure of bipartite permutation graphs and the longest path problem. - Ryuhei Uehara; Gabriel Valiente (Inf. Process. Lett., 2007)

Inverting Linkages with Stretch. - Youichi Fujimoto; Mitsuo Motoki; Ryuhei Uehara (CCCG, 2008)

Polygons Folding to Plural Incongruent Orthogonal Boxes. - Ryuhei Uehara (CCCG, 2008)

Bandwidth of Bipartite Permutation Graphs. - Ryuhei Uehara (ISAAC, 2008)

Simple Geometrical Intersection Graphs. - Ryuhei Uehara (WALCOM, 2008)

Longest Path Problems on Ptolemaic Graphs. - Yoshihiro Takahara; Sachio Teramoto; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2008)

Special Section on Discrete Mathematics and Its Applications. - Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Counting the number of independent sets in chordal graphs. - Yoshio Okamoto; Takeaki Uno; Ryuhei Uehara (J. Discrete Algorithms, 2008)

How to make a picturesque maze. - Yoshio Okamoto; Ryuhei Uehara (CCCG, 2009)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Stefan Langerman; Ryuhei Uehara (ISAAC, 2009)

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. - Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno (WG, 2009)

Laminar structure of ptolemaic graphs with applications. - Ryuhei Uehara; Yushi Uno (Discret. Appl. Math., 2009)

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (J. Comput. Sci. Technol., 2009)

Scale free interval graphs. - Naoto Miyoshi; Takeya Shigezumi; Ryuhei Uehara; Osamu Watanabe 001 (Theor. Comput. Sci., 2009)

Any monotone boolean function can be realized by interlocked polygons. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (CCCG, 2010)

On stretch minimization problem on unit strip paper. - Ryuhei Uehara (CCCG, 2010)

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; et al. (COCOA (2), 2010)

Kaboozle Is NP-complete, Even in a Strip. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (FUN, 2010)

UNO Is Hard, Even for a Single Player. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (FUN, 2010)

Reconstruction Algorithm for Permutation Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (WALCOM, 2010)

The complexity of UNO - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2010)

Random Generation and Enumeration of Proper Interval Graphs. - Toshiki Saitoh; Katsuhisa Yamanaka; Masashi Kiyomi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2010)

Scale Free Properties of Random k-Trees. - Colin Cooper; Ryuhei Uehara (Math. Comput. Sci., 2010)

Reconstruction of interval graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Theor. Comput. Sci., 2010)

Enumeration of the perfect sequences of a chordal graph. - Yasuko Matsui; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 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)

Common Developments of Several Different Orthogonal Boxes. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiroaki Matsui; Günter Rote; Ryuhei Uehara (CCCG, 2011)

On covering of any point configuration by disjoint unit disks. - Yosuke Okayama; Masashi Kiyomi; Ryuhei Uehara (CCCG, 2011)

Complexity of the Stamp Folding Problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito (COCOA, 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)

Voronoi Game on a Path. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2011)

Guest Editor's Foreword. - Sandip Das 001; Ryuhei Uehara (J. Graph Algorithms Appl., 2011)

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2011)

The Voronoi game on graphs and its complexity. - Sachio Teramoto; Erik D. Demaine; Ryuhei Uehara (J. Graph Algorithms Appl., 2011)

On the complexity of reconfiguration problems. - Takehiro Ito; Erik D. Demaine; Nicholas J. A. Harvey; Christos H. Papadimitriou; Martha Sideri; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2011)

Covering Points with Disjoint Unit Disks. - Greg Aloupis; Robert A. Hearn; Hirokazu Iwasawa; Ryuhei Uehara (CCCG, 2012)

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (CCCG, 2012)

Common Developments of Three Different Orthogonal Boxes. - Toshihiro Shirakawa; Ryuhei Uehara (CCCG, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations. - Hiroyuki Fukui; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (TJJCCGG, 2012)

Any Monotone Function Is Realized by Interlocked Polygons. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (Algorithms, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations - Hiroyuki Fukui; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2012)

Bipartite Permutation Graphs are reconstructible. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Discret. Math. Algorithms Appl., 2012)

On bipartite powers of bigraphs. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara (Discret. Math. Theor. Comput. Sci., 2012)

Report from the Japanese Chapter. - Ryuhei Uehara (Bull. EATCS, 2012)

Ghost chimneys. - David Charlton; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Pat Morin; Ryuhei Uehara (Int. J. Comput. Geom. Appl., 2012)

Faster computation of the Robinson-Foulds distance between phylogenetic networks. - Tetsuo Asano; Jesper Jansson 001; Kunihiko Sadakane; Ryuhei Uehara; Gabriel Valiente (Inf. Sci., 2012)

Random generation and enumeration of bipartite permutation graphs. - Toshiki Saitoh; Yota Otachi; Katsuhisa Yamanaka; Ryuhei Uehara (J. Discrete Algorithms, 2012)

NP-completeness of generalized Kaboozle. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (J. Inf. Process., 2012)

Variations on Instant Insanity. - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Thomas D. Morgan; Ryuhei Uehara (Space-Efficient Data Structures, Streams, and Algorithms, 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 (CCCG, 2013)

Zipper Unfoldability of Domes and Prismoids. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (CCCG, 2013)

Base Location Problems for Base-Monotone Regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (WALCOM, 2013)

Route-Enabling Graph Orientation Problems. - Takehiro Ito; Yuichiro Miyamoto; Hirotaka Ono 001; Hisao Tamaki; Ryuhei Uehara (Algorithmica, 2013)

Tractabilities and Intractabilities on Geometric Intersection Graphs. - Ryuhei Uehara (Algorithms, 2013)

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. - Takeaki Uno; Ryuhei Uehara; Shin-Ichi Nakano (Discret. Math. Algorithms Appl., 2013)

The Japanese Chapter. - Ryuhei Uehara (Bull. EATCS, 2013)

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2013)

Common Developments of Three Incongruent Orthogonal Boxes. - Toshihiro Shirakawa; Ryuhei Uehara (Int. J. Comput. Geom. Appl., 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; et al. (J. Comb. Optim., 2013)

Efficient algorithms for a simple network design problem. - Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (Networks, 2013)

The complexity of the stamp folding problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito; Yoshio Okamoto (Theor. Comput. Sci., 2013)

The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles. - Eli Fox-Epstein; Ryuhei Uehara (CCCG, 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 (FUN, 2014)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Polynomial-Time Algorithm for Sliding Tokens on Trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (ISAAC, 2014)

Intersection Dimension of Bipartite Graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (TAMC, 2014)

On the Parameterized Complexity for Token Jumping on Graphs. - Takehiro Ito; Marcin Kaminski 001; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (TAMC, 2014)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 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 001; Birgit Vogtenhuber; Emo Welzl (Discret. Math. Theor. Comput. Sci., 2014)

The graph isomorphism problem on geometric graphs. - Ryuhei Uehara (Discret. Math. Theor. Comput. Sci., 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)

Computational Complexity and an Integer Programming Model of Shakashaka. - Erik D. Demaine; Yoshio Okamoto; Ryuhei Uehara; Yushi Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

The height of random k-trees and related branching processes. - Colin Cooper; Alan M. Frieze; Ryuhei Uehara (Random Struct. Algorithms, 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 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)

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 (Theor. Comput. Sci., 2014)

Sliding Token on Bipartite Permutation Graphs. - Eli Fox-Epstein; Duc A. Hoang 001; Yota Otachi; Ryuhei Uehara (ISAAC, 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 (JCDCGG, 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 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Takashi Horiyama; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (WADS, 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)

Linear-time algorithm for sliding tokens on trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (Theor. Comput. Sci., 2015)

Convex Configurations on Nana-kin-san Puzzle. - Takashi Horiyama; Ryuhei Uehara; Haruo Hosoya (FUN, 2016)

Sliding Tokens on a Cactus. - Duc A. Hoang 001; Ryuhei Uehara (ISAAC, 2016)

Shortest Reconfiguration of Sliding Tokens on a Caterpillar. - Takeshi Yamada; Ryuhei Uehara (WALCOM, 2016)

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 (Comput. Geom., 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. - Matsuo Konagaya; Yota Otachi; Ryuhei Uehara (Discret. Appl. Math., 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)

Folding a paper strip to minimize thickness. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Hiro Ito; Anna Lubiw; Ryuhei Uehara; Yushi Uno (J. Discrete Algorithms, 2016)

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. - Yoshiaki Araki; Takashi Horiyama; Ryuhei Uehara (J. Graph Algorithms Appl., 2016)

Rep-cubes: Unfolding and Dissection of Cubes. - Dawei Xu; Takashi Horiyama; Ryuhei Uehara (CCCG, 2017)

Sliding Tokens on Block Graphs. - Duc A. Hoang 001; Eli Fox-Epstein; Ryuhei Uehara (WALCOM, 2017)

Common developments of three incongruent boxes of area 30. - Dawei Xu; Takashi Horiyama; Toshihiro Shirakawa; Ryuhei Uehara (Comput. Geom., 2017)

Ferrers dimension of grid intersection graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (Discret. Appl. Math., 2017)

Complexity of Tiling a Polygon with Trominoes or Bars. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (Discret. Comput. Geom., 2017)

Report from EATCS Japan Chapter. - Ryuhei Uehara (Bull. EATCS, 2017)

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. - Zachary Abel; Brad Ballinger; Erik D. Demaine; Martin L. Demaine; Jeff Erickson 001; Adam Hesterberg; Hiro Ito; Irina Kostitsyna; Jayson Lynch; Ryuhei Uehara (J. Inf. Process., 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)

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 (FAW, 2018)

Computational Complexity of Robot Arm Simulation Problems. - Tianfeng Feng; Takashi Horiyama; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Takeaki Uno; Ryuhei Uehara (IWOCA, 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 (JCDCGGG, 2018)

Packing Cube Nets into Rectangles with O(1) Holes. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Yushi Uno; Andrew Winslow (JCDCGGG, 2018)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (WALCOM, 2018)

Special Issue on Reconfiguration Problems. - Faisal N. Abu-Khzam; Henning Fernau; Ryuhei Uehara (Algorithms, 2018)

Bumpy pyramid folding. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiro Ito; Jack Snoeyink; Ryuhei Uehara (Comput. Geom., 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)

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 (J. Comput. Geom., 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)

First Course in Algorithms Through Puzzles - Ryuhei Uehara (Springer, 2019)

Rectangular Unfoldings of Polycubes. - Martin L. Demaine; Robert A. Hearn; Jason S. Ku; Ryuhei Uehara (CCCG, 2019)

Ecient Segment Folding is Hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (CCCG, 2019)

Simple Fold and Cut Problem for Line Segments. - Guoxin Hu; Shin-Ichi Nakano; Ryuhei Uehara; Takeaki Uno (CCCG, 2019)

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. - Duc A. Hoang 001; Amanj Khorramian; Ryuhei Uehara (CIAC, 2019)

On the Complexity of Lattice Puzzles. - Yasuaki Kobayashi; Koki Suetsugu; Hideki Tsuiki; Ryuhei Uehara (ISAAC, 2019)

Reconfiguring Undirected Paths. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Kshitij Jain 001; Anna Lubiw; Ryuhei Uehara; Yushi Uno (WADS, 2019)

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. - Koji Ouchi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 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)

Guest Editors' Foreword. - M. Sohel Rahman; Wing-Kin Sung; Ryuhei Uehara (J. Graph Algorithms Appl., 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Introduction to Computational Origami - The World of New Computational Geometry - Ryuhei Uehara (Springer, 2020)

Efficient Folding Algorithms for Regular Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (CCCG, 2020)

Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. - Dat Hoang Tran; Ryuhei Uehara (WALCOM, 2020)

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 (Comput. Geom., 2020)

Parameterized complexity of independent set reconfiguration problems. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (Discret. Appl. Math., 2020)

Complexity of the Maximum k-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)

Efficient Algorithm for Box Folding. - Koichi Mizunashi; Takashi Horiyama; Ryuhei Uehara (J. Graph Algorithms Appl., 2020)

Rectangular Unfoldings of Polycubes. - Martin L. Demaine; Robert A. Hearn; Junnosuke Hoshido; Jason S. Ku; Ryuhei Uehara (J. Inf. Process., 2020)

Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern. - Yiyang Jia; Jun Mitani; Ryuhei Uehara (J. Inf. Process., 2020)

Valid Orderings of Layers When Simple-Folding a Map. - Yiyang Jia; Jun Mitani; Ryuhei Uehara (J. Inf. Process., 2020)

Minimum Forcing Sets for Single-vertex Crease Pattern. - Koji Ouchi; Ryuhei Uehara (J. Inf. Process., 2020)

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. - Kazuaki Yamazaki; Toshiki Saitoh; Masashi Kiyomi; Ryuhei Uehara (Theor. Comput. Sci., 2020)

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (CCCG, 2021)

Computational Complexity of Jumping Block Puzzles. - Masaaki Kanzaki; Yota Otachi; Ryuhei Uehara (COCOON, 2021)

Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. - Kazuaki Yamazaki; Mengze Qian; Ryuhei Uehara (WALCOM, 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)

Algorithmic enumeration of surrounding polygons. - Katsuhisa Yamanaka; David Avis; Takashi Horiyama; Yoshio Okamoto; Ryuhei Uehara; Tanami Yamauchi (Discret. Appl. Math., 2021)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (IEICE Trans. Fundam. Electron. Commun. 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)

Shortest reconfiguration of sliding tokens on subclasses of interval graphs. - Takeshi Yamada; Ryuhei Uehara (Theor. Comput. Sci., 2021)

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. - Elena Arseneva; Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CCCG, 2022)

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. - Erik D. Demaine; Hiro Ito; Jayson Lynch; Ryuhei Uehara (CCCG, 2022)

Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature. - Junnosuke Hoshido; Tonan Kamata; Tsutomu Ansai; Ryuhei Uehara (CCCG, 2022)

Quasi-Twisting Convex Polyhedra. - Joseph O'Rourke; Anna Lubiw; Ryuhei Uehara; Chie Nara; Thomas C. Hull; Klara Mundilova; Josef Tkadlec (CCCG, 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 001 (FUN, 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 (SWAT, 2022)

Ununfoldable polyhedra with 6 vertices or 6 faces. - Hugo A. Akitaya; Erik D. Demaine; David Eppstein; Tomohiro Tachi; Ryuhei Uehara (Comput. Geom., 2022)

Efficient segment folding is hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (Comput. Geom., 2022)

Bicolored Path Embedding Problems Inspired by Protein Folding Models. - Tianfeng Feng; Ryuhei Uehara; Giovanni Viglietta (IEICE Trans. Inf. Syst., 2022)

Research on Dissections of a Net of a Cube into Nets of Cubes. - Tamami Okada; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2022)

Cyclic Shift Problems on Graphs. - Kwon Kham Sai; Giovanni Viglietta; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2022)

Guest Editors' Foreword. - Seok-Hee Hong 001; Subhas C. Nandy; Ryuhei Uehara (J. Graph Algorithms Appl., 2022)

Logical Matrix Representations in Map Folding. - Yiyang Jia; Jun Mitani; Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Token shifting on graphs. - Win Hlaing Hlaing Myint; Ryuhei Uehara; Giovanni Viglietta (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Developing a tetramonohedron with minimum cut length. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (Comput. Geom., 2023)

Mathematical characterizations and computational complexity of anti-slide puzzles. - Ko Minamisawa; Ryuhei Uehara; Masao Hara (Theor. Comput. Sci., 2023)

Any platonic solid can transform to another by O(1) refoldings. - Erik D. Demaine; Martin L. Demaine; Yevhenii Diomidov; Tonan Kamata; Ryuhei Uehara; Hanyu Alice Zhang (Comput. Geom., 2023)

Sorting balls and water: Equivalence and computational complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (Theor. Comput. Sci., 2023)

Efficient Folding Algorithms for Convex Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (Discret. Comput. Geom., 2023)

Computational Complexity of Matching Match Puzzle. - Yuki Iburi; Ryuhei Uehara (FUN, 2024)

On the Computational Complexity of Generalized Common Shape Puzzles. - Mutsunori Banbara; Shin-ichi Minato; Hirotaka Ono 001; Ryuhei Uehara (SOFSEM, 2024)

Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. - Yuya Yamada; Mutsunori Banbara; Katsumi Inoue; Torsten Schaub; Ryuhei Uehara (WALCOM, 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)

Dudeney's Dissection is Optimal. - Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CoRR, 2024)

Reconfiguration of vertex-disjoint shortest paths on graphs. - Rin Saito; Hiroshi Eto; Takehiro Ito; Ryuhei Uehara (J. Graph Algorithms Appl., 2024)

Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs. - Kazuaki Yamazaki; Mengze Qian; Ryuhei Uehara (Discret. Appl. Math., 2024)

Computational complexity of jumping block puzzles. - Masaaki Kanzaki; Yota Otachi; Giovanni Viglietta; Ryuhei Uehara (Theor. Comput. Sci., 2024)

Constant time enumeration of weighted trees. - Mengze Qian; Ryuhei Uehara (Discret. Appl. Math., 2025)

Overlapping of Lattice Unfolding for Cuboids. - Takumi Shiota; Tonan Kamata; Ryuhei Uehara (IEICE Trans. Inf. Syst., 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)

Gathering on a circle with limited visibility by anonymous oblivious robots. - Giuseppe Antonio Di Luna; Ryuhei Uehara; Giovanni Viglietta; Yukiko Yamauchi (Theor. Comput. Sci., 2025)