Author of the publication

How to Generalize Janken - Rock-Paper-Scissors-King-Flea.

. TJJCCGG, volume 8296 of Lecture Notes in Computer Science, page 85-94. Springer, (2012)

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.

 

Other publications of authors with the same name

How to Solve the Cake-Cutting Problem in Sublinear Time., and . FUN, volume 49 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Avoiding Routing Loops on the Internet., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)Source location problems considering vertex-connectivity and edge-connectivity simultaneously., , , , , and . Networks, 40 (2): 63-70 (2002)Testing Outerplanarity of Bounded Degree Graphs., and . Algorithmica, 73 (1): 1-20 (2015)Minimum cost source location problem with vertex-connectivity requirements in digraphs., , and . Inf. Process. Lett., 80 (6): 287-293 (2001)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)Cookie Clicker., , , , , and . Graphs Comb., 36 (2): 269-302 (2020)Semi-Distance Codes and Steiner Systems., , and . Graphs Comb., 23 (Supplement-1): 283-290 (2007)Inferring Pedigree Graphs from Genetic Distances., and . IEICE Trans. Inf. Syst., 91-D (2): 162-169 (2008)Hyperfiniteness of Real-World Networks., , , , , and . Rev. Socionetwork Strateg., 13 (2): 123-141 (2019)