( en | de | ru )

 

Disambiguation of "Ito, Hiro"

Author of the publication

copydeleteadd this publication to your clipboard
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.

, , , and . CCCG, page 98-104. (2022)

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

Linear-Time Enumeration of Isolated Cliques., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 119-130. Springer, (2005)A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , and . J. Inf. Process., (2017)Property Testing on k-Vertex-Connectivity of Graphs., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 539-550. Springer, (2008)Constant-Time Algorithms for Sparsity Matroids., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 498-509. Springer, (2012)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)Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs., , and . ICNC, page 407-413. IEEE Computer Society, (2012)File Transfer Tree Problems., , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 441-452. Springer, (2002)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)Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data"., , , , , , , , and . Rev. Socionetwork Strateg., 13 (2): 99-100 (2019)Semi-Distance Codes and Steiner Systems., , and . Graphs Comb., 23 (Supplement-1): 283-290 (2007)