( en | de | ru )

 

Disambiguation of "Levcopoulos, Christos"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Minimum Manhattan Networks.

, , and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 28-38. Springer, (1999)

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.

Christos Kapnukajas

Christos Vlachos

Christos Xenakis

Christos Melemenidis

Christos Vrettos

 

Other publications of authors with the same name

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