Follow
Christos Levcopoulos
Christos Levcopoulos
Verified email at cs.lth.se
Title
Cited by
Cited by
Year
TSP with neighborhoods of varying size
M De Berg, J Gudmundsson, MJ Katz, C Levcopoulos, MH Overmars, ...
Journal of Algorithms 57 (1), 22-36, 2005
1452005
Fast greedy algorithms for constructing sparse geometric spanners
J Gudmundsson, C Levcopoulos, G Narasimhan
SIAM Journal on Computing 31 (5), 1479-1500, 2002
1342002
Quasi-greedy triangulations approximating the minimum weight triangulation
C Levcopoulos, D Krznaric
J. Algorithms 27 (2), 303-338, 1998
1091998
A fast approximation algorithm for TSP with neighborhoods
J Gudmundsson, C Levcopoulos
Nordic Journal of Computing 6 (4), 469-488, 1999
831999
Efficient algorithms for constructing fault-tolerant geometric spanners
C Levcopoulos, G Narasimhan, M Smid
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
831998
A balanced search tree with O(1) worst-case update time
C Levcopoulos, MH Overmars
Acta Informatica 26, 269-277, 1988
831988
Improved algorithms for constructing fault-tolerant spanners
Levcopoulos, Narasimhan, Smid
Algorithmica 32, 144-156, 2002
772002
Approximate distance oracles for geometric graphs
J Gudmundsson, C Levcopoulos, G Narasimhan, M Smid
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
682002
An Ω (√ n) lower bound for the nonoptimality of the greedy triangulation
C Levcopoulos
Information Processing Letters 25 (4), 247-251, 1987
661987
On approximation behavior of the greedy triangulation for convex polygons
C Levcopoulos, A Lingas
Algorithmica 2, 175-193, 1987
601987
Approximating a minimum Manhattan network
J Gudmundsson, C Levcopoulos, G Narasimhan
Nordic Journal of Computing 8 (2), 219-232, 2001
582001
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
C Levcopoulos, A Lingas
Algorithmica 8, 251-256, 1992
571992
Fast heuristics for minimum length rectangular partitions of polygons
C Levcopoulos
Proceedings of the second annual symposium on Computational geometry, 100-108, 1986
461986
There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
C Levcopoulos, A Lingas
International Symposium on Optimal Algorithms, 9-13, 1989
421989
Approximate distance oracles for geometric spanners
J Gudmundsson, C Levcopoulos, G Narasimhan, M Smid
ACM Transactions on Algorithms (TALG) 4 (1), 1-34, 2008
412008
Covering a set of points with a minimum number of lines
M Grantson, C Levcopoulos
Italian Conference on Algorithms and Complexity, 6-17, 2006
412006
Fast algorithms for complete linkage clustering
D Krznaric, C Levcopoulos
Discrete & Computational Geometry 19, 131-145, 1998
401998
Heapsort—adapted for presorted files
C Levcopoulos, O Petersson
Algorithms and Data Structures: Workshop WADS'89 Ottawa, Canada, August 17 …, 1989
401989
Adaptive heapsort
C Levcopoulos, O Petersson
Journal of Algorithms 14 (3), 395-413, 1993
381993
Splitsort—an adaptive sorting algorithm
C Levcopoulos, O Petersson
Information Processing Letters 39 (4), 205-211, 1991
381991
The system can't perform the operation now. Try again later.
Articles 1–20