Drago Krznaric

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The first subquadratic algorithm for complete linkage clustering	2023-03-21	Paper
A fast heuristic for approximating the minimum weight triangulation Algorithm Theory — SWAT'96	2022-12-09	Paper
Minimum spanning trees in \(d\) dimensions	2021-12-20	Paper
Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time Lecture Notes in Computer Science	2017-01-19	Paper
scientific article; zbMATH DE number 6472628 (Why is no real title available?)	2015-08-14	Paper
Optimal algorithms for complete linkage clustering in \(d\) dimensions Theoretical Computer Science	2002-08-13	Paper
The greedy triangulation can be computed from the Delaunay triangulation in linear time Computational Geometry	2000-10-22	Paper
scientific article; zbMATH DE number 1436136 (Why is no real title available?)	2000-04-26	Paper
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation Journal of Algorithms	1998-12-02	Paper
A linear-time approximation scheme for minimum weight triangulation of convex polygons Algorithmica	1998-08-02	Paper
scientific article; zbMATH DE number 1156715 (Why is no real title available?)	1998-05-26	Paper
Fast algorithms for complete linkage clustering Discrete & Computational Geometry	1998-03-11	Paper
scientific article; zbMATH DE number 871937 (Why is no real title available?)	1996-04-28	Paper

Research outcomes over time

This page was built for person: Drago Krznaric