| 2002 |
|---|
| 15 | EE | Drago Krznaric,
Christos Levcopoulos:
Optimal algorithms for complete linkage clustering in d dimensions.
Theor. Comput. Sci. 286(1): 139-149 (2002) |
| 1999 |
|---|
| 14 | | Christos Levcopoulos,
Drago Krznaric:
The greedy triangulation can be computed from the Delaunay triangulation in linear time.
Comput. Geom. 14(4): 197-220 (1999) |
| 13 | | Drago Krznaric,
Christos Levcopoulos,
Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions.
Nord. J. Comput. 6(4): 446-461 (1999) |
| 1998 |
|---|
| 12 | | Christos Levcopoulos,
Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.
Algorithmica 21(3): 285-311 (1998) |
| 11 | EE | Drago Krznaric,
Christos Levcopoulos:
Fast Algorithms for Complete Linkage Clustering.
Discrete & Computational Geometry 19(1): 131-145 (1998) |
| 10 | | Christos Levcopoulos,
Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
J. Algorithms 27(2): 303-338 (1998) |
| 9 | | Drago Krznaric,
Christos Levcopoulos:
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.
Nord. J. Comput. 5(1): (1998) |
| 1997 |
|---|
| 8 | | Drago Krznaric,
Christos Levcopoulos,
Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions.
ESA 1997: 341-349 |
| 7 | | Drago Krznaric,
Christos Levcopoulos:
Optimal Algorithms for Complete Linkage Clustering in d Dimensions.
MFCS 1997: 368-377 |
| 6 | | Christos Levcopoulos,
Drago Krznaric:
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).
SODA 1997: 518-527 |
| 1996 |
|---|
| 5 | | Christos Levcopoulos,
Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
SODA 1996: 392-401 |
| 4 | | Christos Levcopoulos,
Drago Krznaric:
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).
SWAT 1996: 296-308 |
| 3 | EE | Christos Levcopoulos,
Drago Krznaric:
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.
Inf. Process. Lett. 57(3): 129-135 (1996) |
| 1995 |
|---|
| 2 | | Drago Krznaric,
Christos Levcopoulos:
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.
FSTTCS 1995: 443-455 |
| 1 | | Drago Krznaric,
Christos Levcopoulos:
The First Subquadratic Algorithm for Complete Linkage Clustering.
ISAAC 1995: 392-401 |
