( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximate distance oracles for geometric graphs.

, , , и . SODA, стр. 828-837. ACM/SIAM, (2002)

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.

Christos Vrettos

Christos Tagarakis

Christos Koutras

Christos Jordanides

Christos Kapnukajas

 

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

A Fast Approximation Algorithm for TSP with Neighborhoods., и . Nord. J. Comput., 6 (4): 469- (1999)Efficiently Correcting Matrix Products., , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 53-64. Springer, (2014)Improved Parallel Sorting of Presorted Sequences., и . CONPAR, том 634 из Lecture Notes in Computer Science, стр. 539-544. Springer, (1992)Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case., и . ICCI, том 497 из Lecture Notes in Computer Science, стр. 139-148. Springer, (1991)Covering Polygons with Minimum Number of Rectangles., и . STACS, том 166 из Lecture Notes in Computer Science, стр. 63-72. Springer, (1984)Close Approximation of Minimum Rectangular Coverings., и . FSTTCS, том 1180 из Lecture Notes in Computer Science, стр. 135-146. Springer, (1996)On Parallel Complexity of Planar Triangulations., , и . FSTTCS, том 1026 из Lecture Notes in Computer Science, стр. 413-427. Springer, (1995)Minimum Weight Pseudo-Triangulations., и . FSTTCS, том 3328 из Lecture Notes in Computer Science, стр. 299-310. Springer, (2004)Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains., , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 80-89. Springer, (2002)Covering a Set of Points with a Minimum Number of Lines., и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 6-17. Springer, (2006)