( en | de | ru )

 

Disambiguation of "Ito, Hiro"

Author of the publication

copydeleteadd this publication to your clipboard
Single-Player and Two-Player Buttons & Scissors Games.

, , , , , , , , , , , , , , and . CoRR, (2016)

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.

Hiro Shivdasani

Nobutaka Ito

Morimichi Hirota

Masayuki Hirosue

Takao Ito

 

Other publications of authors with the same name

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , and . J. Inf. Process., (2017)Constant-Time Algorithms for Sparsity Matroids., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 498-509. Springer, (2012)Property Testing on k-Vertex-Connectivity of Graphs., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 539-550. Springer, (2008)Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.. JCDCG, volume 3742 of Lecture Notes in Computer Science, page 123-130. Springer, (2004)Linear-Time Enumeration of Isolated Cliques., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 119-130. Springer, (2005)Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs., , and . ICNC, page 407-413. IEEE Computer Society, (2012)Number of Ties and Undefeated Signs in a Generalized Janken., and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 143-154. Springer, (2015)Avoiding Routing Loops on the Internet., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)Minimum cost source location problem with vertex-connectivity requirements in digraphs., , and . Inf. Process. Lett., 80 (6): 287-293 (2001)File Transfer Tree Problems., , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 441-452. Springer, (2002)