( en | de | ru )

 

Disambiguation of "Uehara, Ryuhei"

Author of the publication

copydeleteadd this publication to your clipboard
UNO Is Hard, Even for a Single Player.

, , , , and . FUN, volume 6099 of Lecture Notes in Computer Science, page 133-144. Springer, (2010)

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

The complexity of UNO, , , , and . CoRR, (2010)Guest Editors' Foreword., , and . J. Graph Algorithms Appl., 23 (5): 755-757 (2019)Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis., , , , and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 242-256. Springer, (2024)Packing Cube Nets into Rectangles with O(1) Holes., , , , and . JCDCGGG, volume 13034 of Lecture Notes in Computer Science, page 152-164. Springer, (2018)Rep-cubes: Unfolding and Dissection of Cubes., , and . CCCG, page 62-67. (2017)Common Developments of Three Different Orthogonal Boxes., and . CCCG, page 17-22. (2012)Bumpy Pyramid Folding., , , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Token Shifting on Graphs., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 643-654. Springer, (2021)Computational Complexity of Jumping Block Puzzles., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 655-667. Springer, (2021)Any Regular Polyhedron Can Transform to Another by O(1) Refoldings., , , , , and . CCCG, page 332-342. (2021)