( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial-Time Computable Backup Tables for Shortest-Path Routing.

, , , и . SIROCCO, том 17 из Proceedings in Informatics, стр. 163-177. Carleton Scientific, (2003)

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.

Hiro Shivdasani

Nobutaka Ito

Morimichi Hirota

Masayuki Hirosue

Takao Ito

 

Другие публикации лиц с тем же именем

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , и . J. Inf. Process., (2017)Property Testing on k-Vertex-Connectivity of Graphs., и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 539-550. Springer, (2008)Constant-Time Algorithms for Sparsity Matroids., , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 498-509. Springer, (2012)Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.. JCDCG, том 3742 из Lecture Notes in Computer Science, стр. 123-130. Springer, (2004)Linear-Time Enumeration of Isolated Cliques., , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 119-130. Springer, (2005)Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs., , и . ICNC, стр. 407-413. IEEE Computer Society, (2012)Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon., и . JCDCG, том 2866 из Lecture Notes in Computer Science, стр. 176-181. Springer, (2002)2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces., , и . JCDCG, том 1763 из Lecture Notes in Computer Science, стр. 129-157. Springer, (1998)Helly Numbers of Polyominoes., , , и . CoRR, (2017)Imperfectness of Data for STS-Based Physical Mapping., , и . IFIP TCS, том 155 из IFIP, стр. 279-292. Kluwer/Springer, (2004)