( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Longest Increasing Subsequence Over Sequential Data Streams.

, , , и . CoRR, (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.

Huaming Wu

Huaming Wu

Huaming Li

Zhang Zhang

Meng Zhang

Methods and implementations of road-network matching. TU München, (2009)
 

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

On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs.. FAW, том 5598 из Lecture Notes in Computer Science, стр. 163-172. Springer, (2009)Optimal st -Orientations for Plane Triangulations., и . AAIM, том 4508 из Lecture Notes in Computer Science, стр. 296-305. Springer, (2007)An Application of Well-orderly Trees in Graph Drawing., и . Int. J. Found. Comput. Sci., 17 (5): 1129-1142 (2006)On Even Triangulations of 2-Connected Embedded Graphs., и . SIAM J. Comput., 34 (3): 683-696 (2005)Improved visibility representation of plane graphs., и . Comput. Geom., 30 (1): 29-39 (2005)Closed rectangle-of-influence drawings for irreducible triangulations., и . Comput. Geom., 44 (1): 9-19 (2011)An optimal greedy routing algorithm for triangulated polygons., и . Comput. Geom., 46 (6): 640-647 (2013)Nearly Optimal Visibility Representations of Plane Graphs., и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 407-418. Springer, (2006)On Even Triangulations of 2-Connected Embedded Graphs., и . COCOON, том 2697 из Lecture Notes in Computer Science, стр. 139-148. Springer, (2003)Schnyder Greedy Routing Algorithm., и . TAMC, том 6108 из Lecture Notes in Computer Science, стр. 271-283. Springer, (2010)