| 2008 |
|---|
| 93 | EE | Christos Levcopoulos:
Minimum Geometric Spanning Trees.
Encyclopedia of Algorithms 2008 |
| 92 | EE | Christos Levcopoulos:
Minimum Weight Triangulation.
Encyclopedia of Algorithms 2008 |
| 91 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate distance oracles for geometric spanners.
ACM Transactions on Algorithms 4(1): (2008) |
| 90 | EE | 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 |
|---|
| 89 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos:
Approximate distance oracles for graphs with dense clusters.
Comput. Geom. 37(3): 142-154 (2007) |
| 88 | EE | Joachim Gudmundsson,
Christos Levcopoulos:
Minimum weight pseudo-triangulations.
Comput. Geom. 38(3): 139-153 (2007) |
| 2006 |
|---|
| 87 | EE | Magdalene Grantson,
Christos Levcopoulos:
Covering a Set of Points with a Minimum Number of Lines.
CIAC 2006: 6-17 |
| 86 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions.
COCOON 2006: 196-204 |
| 85 | EE | 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 |
|---|
| 84 | EE | Magdalene Grantson,
Christian Borgelt,
Christos Levcopoulos:
Minimum Weight Triangulation by Cutting Out Triangles.
ISAAC 2005: 984-994 |
| 83 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos:
Chips on wafers, or packing rectangles into grids.
Comput. Geom. 30(2): 95-111 (2005) |
| 82 | EE | 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 |
|---|
| 81 | EE | Joachim Gudmundsson,
Christos Levcopoulos:
Minimum Weight Pseudo-Triangulations.
FSTTCS 2004: 299-310 |
| 80 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos:
Approximate Distance Oracles for Graphs with Dense Clusters.
ISAAC 2004: 53-64 |
| 79 | EE | Magdalene Grantson,
Christos Levcopoulos:
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.
JCDCG 2004: 83-94 |
| 78 | EE | Magdalene Grantson,
Christos Levcopoulos:
Tight Time Bounds for the Minimum Local Convex Partition Problem.
JCDCG 2004: 95-105 |
| 2003 |
|---|
| 77 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos:
Chips on Wafers.
WADS 2003: 412-423 |
| 76 | EE | 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 |
|---|
| 75 | EE | 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 |
| 74 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate Distance Oracles Revisited.
ISAAC 2002: 357-368 |
| 73 | EE | Mattias Andersson,
Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees.
International Conference on Computational Science (3) 2002: 26-35 |
| 72 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Approximate distance oracles for geometric graphs.
SODA 2002: 828-837 |
| 71 | EE | Christos Levcopoulos,
Andrzej Lingas,
Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
SWAT 2002: 80-89 |
| 70 | EE | Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Improved Algorithms for Constructing Fault-Tolerant Spanners.
Algorithmica 32(1): 144-156 (2002) |
| 69 | EE | Joachim Gudmundsson,
Thore Husfeldt,
Christos Levcopoulos:
Lower bounds for approximate polygon decomposition and minimum gap.
Inf. Process. Lett. 81(3): 137-141 (2002) |
| 68 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan:
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.
SIAM J. Comput. 31(5): 1479-1500 (2002) |
| 67 | EE | Drago Krznaric,
Christos Levcopoulos:
Optimal algorithms for complete linkage clustering in d dimensions.
Theor. Comput. Sci. 286(1): 139-149 (2002) |
| 2001 |
|---|
| 66 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan:
Approximating a Minimum Manhattan Network.
Nord. J. Comput. 8(2): 219-232 (2001) |
| 2000 |
|---|
| 65 | EE | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan:
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.
SWAT 2000: 314-327 |
| 64 | | Joachim Gudmundsson,
Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
Nord. J. Comput. 7(1): 32-57 (2000) |
| 1999 |
|---|
| 63 | EE | Joachim Gudmundsson,
Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.
COCOON 1999: 473-482 |
| 62 | | Joachim Gudmundsson,
Christos Levcopoulos,
Giri Narasimhan:
Approximating Minimum Manhattan Networks.
RANDOM-APPROX 1999: 28-38 |
| 61 | | Christos Levcopoulos,
Drago Krznaric:
The greedy triangulation can be computed from the Delaunay triangulation in linear time.
Comput. Geom. 14(4): 197-220 (1999) |
| 60 | | Joachim Gudmundsson,
Christos Levcopoulos:
Close Approximations of Minimum Rectangular Coverings.
J. Comb. Optim. 3(4): 437-452 (1999) |
| 59 | | Drago Krznaric,
Christos Levcopoulos,
Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions.
Nord. J. Comput. 6(4): 446-461 (1999) |
| 58 | | Joachim Gudmundsson,
Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods.
Nord. J. Comput. 6(4): 469- (1999) |
| 1998 |
|---|
| 57 | | Joachim Gudmundsson,
Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
FSTTCS 1998: 233-244 |
| 56 | EE | Christos Levcopoulos,
Giri Narasimhan,
Michiel H. M. Smid:
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
STOC 1998: 186-195 |
| 55 | | Christos Levcopoulos,
Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.
Algorithmica 21(3): 285-311 (1998) |
| 54 | EE | Drago Krznaric,
Christos Levcopoulos:
Fast Algorithms for Complete Linkage Clustering.
Discrete & Computational Geometry 19(1): 131-145 (1998) |
| 53 | | Christos Levcopoulos,
Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
J. Algorithms 27(2): 303-338 (1998) |
| 52 | | Drago Krznaric,
Christos Levcopoulos:
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.
Nord. J. Comput. 5(1): (1998) |
| 1997 |
|---|
| 51 | | Drago Krznaric,
Christos Levcopoulos,
Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions.
ESA 1997: 341-349 |
| 50 | | Christos Levcopoulos,
Joachim Gudmundsson:
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
FCT 1997: 305-316 |
| 49 | | Drago Krznaric,
Christos Levcopoulos:
Optimal Algorithms for Complete Linkage Clustering in d Dimensions.
MFCS 1997: 368-377 |
| 48 | | Christos Levcopoulos,
Joachim Gudmundsson:
Approximation Algorithms for Covering Polygons with Squares and Similar Problems.
RANDOM 1997: 27-41 |
| 47 | | Christos Levcopoulos,
Drago Krznaric:
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).
SODA 1997: 518-527 |
| 1996 |
|---|
| 46 | | Christos Levcopoulos,
Joachim Gudmundsson:
Close Approximation of Minimum Rectangular Coverings.
FSTTCS 1996: 135-146 |
| 45 | | Christos Levcopoulos,
Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
SODA 1996: 392-401 |
| 44 | | Christos Levcopoulos,
Anna Östlin:
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).
SWAT 1996: 271-283 |
| 43 | | Christos Levcopoulos,
Drago Krznaric:
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).
SWAT 1996: 296-308 |
| 42 | EE | Bengt Aspvall,
Christos Levcopoulos,
Andrzej Lingas,
Robert Storlind:
On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett. 57(2): 89-93 (1996) |
| 41 | EE | Christos Levcopoulos,
Drago Krznaric:
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.
Inf. Process. Lett. 57(3): 129-135 (1996) |
| 40 | EE | Christos Levcopoulos,
Ola Petersson:
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.
Theor. Comput. Sci. 163(1&2): 211-238 (1996) |
| 1995 |
|---|
| 39 | | Christos Levcopoulos,
Andrzej Lingas,
Cao Wang:
On Parallel Complexity of Planar Triangulations.
FSTTCS 1995: 413-427 |
| 38 | | Drago Krznaric,
Christos Levcopoulos:
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.
FSTTCS 1995: 443-455 |
| 37 | | Drago Krznaric,
Christos Levcopoulos:
The First Subquadratic Algorithm for Complete Linkage Clustering.
ISAAC 1995: 392-401 |
| 1994 |
|---|
| 36 | | Christos Levcopoulos,
Ola Petersson:
Sorting Shuffled Monotone Sequences
Inf. Comput. 112(1): 37-50 (1994) |
| 35 | | 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 |
|---|
| 34 | | Svante Carlsson,
Christos Levcopoulos,
Ola Petersson:
Sublinear Merging and Natural Mergesort.
Algorithmica 9(6): 629-648 (1993) |
| 33 | | Jyrki Katajainen,
Christos Levcopoulos,
Ola Petersson:
Space-Efficient Parallel Merging.
ITA 27(4): 295-310 (1993) |
| 32 | | Christos Levcopoulos,
Ola Petersson:
Adaptive Heapsort.
J. Algorithms 14(3): 395-413 (1993) |
| 1992 |
|---|
| 31 | | Jingsen Chen,
Christos Levcopoulos:
Improved Parallel Sorting of Presorted Sequences.
CONPAR 1992: 539-544 |
| 30 | | Christos Levcopoulos,
Andrzej Lingas:
C-sensitive Triangulations Approximate the MinMax Length Triangulation.
FSTTCS 1992: 104-115 |
| 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 | EE | 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 |
