( en | de | ru )

 

Disambiguation of "Uehara, Ryuhei"

Author of the publication

copydeleteadd this publication to your clipboard
Linear-time algorithm for sliding tokens on trees.

, , , , , , , , and . Theor. Comput. Sci., (2015)

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

On the Complexity of Lattice Puzzles., , , and . ISAAC, volume 149 of LIPIcs, page 32:1-32:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern., , and . J. Inf. Process., (2020)Sankaku-tori: An Old Western-Japanese Game Played on a Point Set., , , , , , , and . J. Inf. Process., (2017)Algorithmic enumeration of surrounding polygons., , , , , and . Discret. Appl. Math., (2021)Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression., , and . Discret. Math. Algorithms Appl., (2013)Complexity of Tiling a Polygon with Trominoes or Bars., , , , and . Discret. Comput. Geom., 58 (3): 686-704 (2017)A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.. Int. J. Found. Comput. Sci., 10 (4): 473-482 (1999)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)