( en | de | ru )

 

Disambiguation of "Ito, Hiro"

Author of the publication

copydeleteadd this publication to your clipboard
Every Property Is Testable on a Natural Class of Scale-Free Multigraphs.

. ESA, volume 57 of LIPIcs, page 51:1-51:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Generalized River Crossing Problems., , and . Theory Comput. Syst., 56 (2): 418-435 (2015)Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks., , , , and . IEEE Access, (2019)Enumeration of isolated cliques and pseudo-cliques., and . ACM Trans. Algorithms, 5 (4): 40:1-40:21 (2009)How to Generalize Janken - Rock-Paper-Scissors-King-Flea.. TJJCCGG, volume 8296 of Lecture Notes in Computer Science, page 85-94. Springer, (2012)Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets., , , , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 338-349. Springer, (2000)Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image., , , and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 149-158. Springer, (1998)Sum of Edge Lengths of a Graph Drawn on a Convex Polygon., , and . JCDCG, volume 2098 of Lecture Notes in Computer Science, page 160-166. Springer, (2000)Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order.. CJCDGCGT, volume 4381 of Lecture Notes in Computer Science, page 59-69. Springer, (2005)Constant-Time Approximation Algorithms for the Knapsack Problem., , and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 131-142. Springer, (2012)Algorithms and Complexity of Generalized River Crossing Problems., , and . FUN, volume 7288 of Lecture Notes in Computer Science, page 235-244. Springer, (2012)