( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Size and Energy of Threshold Circuits Computing Mod Functions.

, , и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 724-735. Springer, (2009)

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.

Takao Tsuboi

Takao Ito

Mario Takao Inoue

 

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

Drawing Plane Graphs Nicely., , и . Acta Inf., 22 (2): 187-201 (1985)Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts.. WALCOM, стр. 1-2. Bangladesh Academy of Sciences (BAS), (2007)Improved Edge-Coloring Algorithms for Planar Graphs., и . J. Algorithms, 11 (1): 102-116 (1990)An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks., , и . SIAM J. Comput., 14 (2): 289-302 (1985)Efficient Compression of Web Graphs., , и . COCOON, том 5092 из Lecture Notes in Computer Science, стр. 1-11. Springer, (2008)An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals., и . ISAAC, том 1350 из Lecture Notes in Computer Science, стр. 324-333. Springer, (1997)Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs., , и . Discret. Comput. Geom., 41 (4): 643-670 (2009)Grid Drawings of 4-Connected Plane Graphs., , и . Discret. Comput. Geom., 26 (1): 73-87 (2001)Improvements of HITS Algorithms for Spam Links., , и . APWeb/WAIM, том 4505 из Lecture Notes in Computer Science, стр. 479-490. Springer, (2007)Edge-Coloring Partial k-Trees., , и . J. Algorithms, 21 (3): 598-617 (1996)