( en | de | ru )

 

Disambiguation of "Ito, Hiro"

Author of the publication

copydeleteadd this publication to your clipboard
Arrangements of n Points whose Incident-Line-Numbers are at most n/2.

, , , and . Graphs Comb., 27 (3): 321-326 (2011)

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

Property Testing on k-Vertex-Connectivity of Graphs., and . Algorithmica, 62 (3-4): 701-712 (2012)Single-Player and Two-Player Buttons & Scissors Games., , , , , , , , , and 5 other author(s). CoRR, (2016)Enumeration of isolated cliques and pseudo-cliques., and . ACM Trans. Algorithms, 5 (4): 40:1-40:21 (2009)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)On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs., , and . Comput. Complex., 29 (1): 1 (2020)On computational complexity of graph inference from counting., , , , and . Nat. Comput., 12 (4): 589-603 (2013)Winning Ways of Weighted Poset Games., , and . Graphs Comb., 23 (Supplement-1): 291-306 (2007)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)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)