( en | de | ru )

 

Disambiguation of "Levcopoulos, Christos"

Author of the publication

copydeleteadd this publication to your clipboard
A fast heuristic for covering polygons by rectangles.

. FCT, volume 199 of Lecture Notes in Computer Science, page 269-278. Springer, (1985)

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 Tagarakis

Christos Koutras

Christos Vrettos

Christos Jordanides

Christos Kapnukajas

 

Other publications of authors with the same name

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem., and . Parallel Process. Lett., (1994)Approximate distance oracles for geometric spanners., , , and . ACM Trans. Algorithms, 4 (1): 10:1-10:34 (2008)Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases., , , , and . J. Comput. Syst. Sci., (2021)Quickest path queries on transportation network., , and . Comput. Geom., 47 (7): 695-709 (2014)A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract)., and . SODA, page 518-527. ACM/SIAM, (1997)Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique., , and . CoRR, (2023)Approximating a Minimum Manhattan Network., , and . Nord. J. Comput., 8 (2): 219-232 (2001)A Parallel Approximation Algorithm for Minimum Weight Triangulation., and . Nord. J. Comput., 7 (1): 32-57 (2000)Minimum Spanning Trees in d Dimensions., , and . Nord. J. Comput., 6 (4): 446-461 (1999)There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees., and . Algorithmica, 8 (3): 251-256 (1992)