Christos Levcopoulos

	2010
97		Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos: Quickest Path Queries on Transportation Network CoRR abs/1012.0634: (2010)
	2009
96		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geometry Appl. 19(3): 247-265 (2009)
	2008
95		Christos Levcopoulos: Minimum Geometric Spanning Trees. Encyclopedia of Algorithms 2008
94		Christos Levcopoulos: Minimum Weight Triangulation. Encyclopedia of Algorithms 2008
93		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008)
92		Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos: Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem. Int. J. Comput. Geometry Appl. 18(3): 185-220 (2008)
	2007
91		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007)
90		Joachim Gudmundsson, Christos Levcopoulos: Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007)
	2006
89		Magdalene Grantson, Christos Levcopoulos: Covering a Set of Points with a Minimum Number of Lines. CIAC 2006: 6-17
88		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204
87		Rolf Klein, Christos Levcopoulos, Andrzej Lingas: A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Comput. Geom. 34(1): 28-34 (2006)
	2005
86		Magdalene Grantson, Christos Levcopoulos: Bounds on optimally triangulating connected subsets of the minimum weight convex partition. EuroCG 2005: 13-16
85		Magdalene Grantson, Christian Borgelt, Christos Levcopoulos: Minimum Weight Triangulation by Cutting Out Triangles. ISAAC 2005: 984-994
84		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005)
83		Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005)
	2004
82		Joachim Gudmundsson, Christos Levcopoulos: Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310
81		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64
80		Magdalene Grantson, Christos Levcopoulos: A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. JCDCG 2004: 83-94
79		Magdalene Grantson, Christos Levcopoulos: Tight Time Bounds for the Minimum Local Convex Partition Problem. JCDCG 2004: 95-105
	2003
78		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on Wafers. WADS 2003: 412-423
77		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
	2002
76		Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with Neighborhoods of Varying Size. ESA 2002: 187-199
75		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
74		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
73		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
72		Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell: Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89
71		Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
70		Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002)
69		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
68		Drago Krznaric, Christos Levcopoulos: Optimal algorithms for complete linkage clustering in d dimensions. Theor. Comput. Sci. 286(1): 139-149 (2002)
	2001
67		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
	2000
66		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
65		Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000)
	1999
64		Joachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482
63		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
62		Christos Levcopoulos, Drago Krznaric: The greedy triangulation can be computed from the Delaunay triangulation in linear time. Comput. Geom. 14(4): 197-220 (1999)
61		Joachim Gudmundsson, Christos Levcopoulos: Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999)
60		Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999)
59		Joachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999)
	1998
58		Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244
57		Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195
56		Christos Levcopoulos, Drago Krznaric: A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21(3): 285-311 (1998)
55		Drago Krznaric, Christos Levcopoulos: Fast Algorithms for Complete Linkage Clustering. Discrete & Computational Geometry 19(1): 131-145 (1998)
54		Christos Levcopoulos, Drago Krznaric: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. J. Algorithms 27(2): 303-338 (1998)
53		Drago Krznaric, Christos Levcopoulos: Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. Nord. J. Comput. 5(1): (1998)
	1997
52		Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349
51		Christos Levcopoulos, Joachim Gudmundsson: A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316
50		Drago Krznaric, Christos Levcopoulos: Optimal Algorithms for Complete Linkage Clustering in d Dimensions. MFCS 1997: 368-377
49		Christos Levcopoulos, Joachim Gudmundsson: Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41
48		Christos Levcopoulos, Drago Krznaric: A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). SODA 1997: 518-527
	1996
47		Christos Levcopoulos, Joachim Gudmundsson: Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146
46		Christos Levcopoulos, Drago Krznaric: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. SODA 1996: 392-401
45		Christos Levcopoulos, Anna Östlin: Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). SWAT 1996: 271-283
44		Christos Levcopoulos, Drago Krznaric: A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). SWAT 1996: 296-308
43		Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind: On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996)
42		Christos Levcopoulos, Drago Krznaric: Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. Inf. Process. Lett. 57(3): 129-135 (1996)
41		Christos Levcopoulos, Ola Petersson: Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. 163(1&2): 211-238 (1996)
	1995
40		Christos Levcopoulos, Andrzej Lingas, Cao Wang: On Parallel Complexity of Planar Triangulations. FSTTCS 1995: 413-427
39		Drago Krznaric, Christos Levcopoulos: Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. FSTTCS 1995: 443-455
38		Drago Krznaric, Christos Levcopoulos: The First Subquadratic Algorithm for Complete Linkage Clustering. ISAAC 1995: 392-401
	1994
37		Christos Levcopoulos, Ola Petersson: Sorting Shuffled Monotone Sequences Inf. Comput. 112(1): 37-50 (1994)
36		Christos Levcopoulos, Teresa M. Przytycka: A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. Parallel Processing Letters 4: 37-43 (1994)
	1993
35		Svante Carlsson, Christos Levcopoulos, Ola Petersson: Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993)
34		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. ITA 27(4): 295-310 (1993)
33		Christos Levcopoulos, Ola Petersson: Adaptive Heapsort. J. Algorithms 14(3): 395-413 (1993)
	1992
32		Jingsen Chen, Christos Levcopoulos: Improved Parallel Sorting of Presorted Sequences. CONPAR 1992: 539-544
31		Christos Levcopoulos, Andrzej Lingas: C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS 1992: 104-115
30		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. PARLE 1992: 37-49
29		Christos Levcopoulos, Andrzej Lingas: There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica 8(3): 251-256 (1992)
28		Christos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992)
27		Christos Levcopoulos, Ola Petersson: Matching Parentheses in Parallel. Discrete Applied Mathematics 40(4): 423-431 (1992)
	1991
26		Christos Levcopoulos, Ola Petersson: An Optimal Adaptive In-place Sorting Algorithm. FCT 1991: 329-338
25		Christos Levcopoulos, Andrzej Lingas: Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148
24		Christos Levcopoulos, Ola Petersson: Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 205-211 (1991)
	1990
23		Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter: Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214
22		Christos Levcopoulos, Ola Petersson: Splitsort - An Adaptive Sorting Algorithm. MFCS 1990: 416-422
21		Svante Carlsson, Christos Levcopoulos, Ola Petersson: Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms 1990: 251-260
20		Christos Levcopoulos, Ola Petersson: Sorting Shuffled Monotone Sequences. SWAT 1990: 181-191
19		Christos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250
18		Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990)
	1989
17		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253
16		Christos Levcopoulos, Andrzej Lingas: Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms 1989: 9-13
15		Christos Levcopoulos, Ola Petersson: Heapsort - Adapted for Presorted Files. WADS 1989: 499-509
14		Christos Levcopoulos, Ola Petersson: A Note on Adaptive Parallel Sorting. Inf. Process. Lett. 33(4): 187-191 (1989)
13		Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. 66(2): 181-203 (1989)
	1988
12		Christos Levcopoulos: On Optimal Parallel Algorithm for Sorting Presorted Files. FSTTCS 1988: 154-160
11		Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas: An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198
10		Christos Levcopoulos, Mark H. Overmars: A Balanced Search Tree with O (1) Worst-case Update Time. Acta Inf. 26(3): 269-277 (1988)
	1987
9		Christos Levcopoulos: Improved Bounds for Covering General Polygons with Rectangles. FSTTCS 1987: 95-102
8		Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385
7		Christos Levcopoulos, Andrzej Lingas: On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica 2: 15-193 (1987)
6		Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack: Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987)
5		Christos Levcopoulos: An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. Inf. Process. Lett. 25(4): 247-251 (1987)
	1986
4		Christos Levcopoulos: Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. Symposium on Computational Geometry 1986: 100-108
	1985
3		Christos Levcopoulos: A fast heuristic for covering polygons by rectangles. FCT 1985: 269-278
	1984
2		Christos Levcopoulos, Andrzej Lingas: Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295
1		Christos Levcopoulos, Andrzej Lingas: Covering Polygons with Minimum Number of Rectangles. STACS 1984: 63-72

Coauthor Index

1	Mattias Andersson	[74] [77] [78] [81] [84] [88] [91] [96]
2	Bengt Aspvall	[43]
3	Mark de Berg	[76] [83]
4	Christian Borgelt	[85] [92]
5	Magdalene G. Borgelt (Magdalene Grantson)	[79] [80] [85] [86] [89] [92]
6	Svante Carlsson	[21] [35]
7	Jingsen Chen	[32]
8	Per-Olof Fjällström	[18]
9	Joachim Gudmundsson	[47] [49] [51] [58] [59] [61] [63] [64] [65] [66] [67] [69] [70] [73] [74] [75] [76] [77] [78] [81] [82] [83] [84] [88] [90] [91] [93] [96] [97]
10	Thore Husfeldt	[70]
11	Jyrki Katajainen	[11] [17] [18] [30] [34]
12	Matthew J. Katz (Matya Katz)	[76] [83]
13	Rolf Klein	[87]
14	Drago Krznaric	[38] [39] [42] [44] [46] [48] [50] [52] [53] [54] [55] [56] [60] [62] [68]
15	Andrzej Lingas	[1] [2] [6] [7] [8] [11] [13] [16] [19] [23] [25] [28] [29] [31] [40] [43] [72] [87]
16	Joseph S. B. Mitchell	[72]
17	Giri Narasimhan	[57] [63] [66] [67] [69] [71] [73] [74] [75] [77] [93]
18	Bengt J. Nilsson	[52] [60]
19	Mark H. Overmars	[10] [76] [83]
20	Anna Pagh (Anna Östlin)	[45]
21	Ola Petersson	[14] [15] [17] [18] [20] [21] [22] [23] [24] [26] [27] [30] [33] [34] [35] [37] [41]
22	Teresa M. Przytycka	[36]
23	Wojciech Rytter	[23]
24	Jörg-Rüdiger Sack	[6] [8] [13]
25	Radwa El Shawi	[97]
26	Michiel H. M. Smid	[57] [71] [73] [75] [93]
27	A. Frank van der Stappen	[76] [83]
28	Robert Storlind	[43]
29	Cao Wang	[40]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page