( en | de | ru )

 

Disambiguation of "Uehara, Ryuhei"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Folding Algorithms for Convex Polyhedra.

, , , and . Discret. Comput. Geom., 70 (4): 1499-1522 (December 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alan Fonseca Uehara

 

Other publications of authors with the same name

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces., , , , , , , , and . CoRR, (2017)The complexity of UNO, , , , and . CoRR, (2010)Sankaku-tori: An Old Western-Japanese Game Played on a Point Set., , , , , , , and . J. Inf. Process., (2017)Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern., , and . J. Inf. Process., (2020)Voronoi Game on a Path., , and . IEICE Trans. Inf. Syst., 94-D (6): 1185-1189 (2011)On Computational Complexity of Pipe Puzzles., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 102-A (9): 1134-1141 (2019)Complexity of the Maximum k-Path Vertex Cover Problem., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 103-A (10): 1193-1201 (2020)Symmetric assembly puzzles are hard, beyond a few pieces., , , , , , , , and . Comput. Geom., (2020)Guest Editor's Foreword., and . J. Graph Algorithms Appl., 15 (3): 319-321 (2011)The Voronoi game on graphs and its complexity., , and . J. Graph Algorithms Appl., 15 (4): 485-501 (2011)