Drago Krznaric

According to our database, Drago Krznaric authored at least 14 papers between 1995 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

Optimal algorithms for complete linkage clustering in d dimensions.

Drago Krznaric, Christos Levcopoulos

Theor. Comput. Sci., 2002

1999

Minimum Spanning Trees in d Dimensions.

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson

Nord. J. Comput., 1999

The greedy triangulation can be computed from the Delaunay triangulation in linear time.

Christos Levcopoulos, Drago Krznaric

Comput. Geom., 1999

1998

Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.

Drago Krznaric, Christos Levcopoulos

Nord. J. Comput., 1998

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.

Christos Levcopoulos, Drago Krznaric

J. Algorithms, 1998

Fast Algorithms for Complete Linkage Clustering.

Drago Krznaric, Christos Levcopoulos

Discret. Comput. Geom., 1998

A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.

Christos Levcopoulos, Drago Krznaric

Algorithmica, 1998

1997

Progress in Hierarchical Clustering & Minimum Weight Triangulation.

Drago Krznaric

PhD thesis, 1997

A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).

Christos Levcopoulos, Drago Krznaric

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Minimum Spanning Trees in <i>d</i> Dimensions.

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson

Proceedings of the Algorithms, 1997

1996

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.

Christos Levcopoulos, Drago Krznaric

Inf. Process. Lett., 1996

A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).

Christos Levcopoulos, Drago Krznaric

Proceedings of the Algorithm Theory, 1996

1995

The First Subquadratic Algorithm for Complete Linkage Clustering.

Drago Krznaric, Christos Levcopoulos

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.

Drago Krznaric, Christos Levcopoulos

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995