Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. - Drago Krznaric; Christos Levcopoulos (FSTTCS, 1995)

The First Subquadratic Algorithm for Complete Linkage Clustering. - Drago Krznaric; Christos Levcopoulos (ISAAC, 1995)

A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). - Christos Levcopoulos; Drago Krznaric (SWAT, 1996)

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. - Christos Levcopoulos; Drago Krznaric (Inf. Process. Lett., 1996)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (ESA, 1997)

A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). - Christos Levcopoulos; Drago Krznaric (SODA, 1997)

Progress in Hierarchical Clustering & Minimum Weight Triangulation. - Drago Krznaric (1997)

A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. - Christos Levcopoulos; Drago Krznaric (Algorithmica, 1998)

Fast Algorithms for Complete Linkage Clustering. - Drago Krznaric; Christos Levcopoulos (Discret. Comput. Geom., 1998)

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. - Christos Levcopoulos; Drago Krznaric (J. Algorithms, 1998)

Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. - Drago Krznaric; Christos Levcopoulos (Nord. J. Comput., 1998)

The greedy triangulation can be computed from the Delaunay triangulation in linear time. - Christos Levcopoulos; Drago Krznaric (Comput. Geom., 1999)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (Nord. J. Comput., 1999)

Optimal algorithms for complete linkage clustering in d dimensions. - Drago Krznaric; Christos Levcopoulos (Theor. Comput. Sci., 2002)