Drago Krznaric

Available identifiers

zbMath Open krznaric.dragoMaRDI QIDQ826103

List of research outcomes

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	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	2017-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5501830	2015-08-14	Paper
Optimal algorithms for complete linkage clustering in \(d\) dimensions	2002-08-13	Paper
The greedy triangulation can be computed from the Delaunay triangulation in linear time	2000-10-22	Paper
https://portal.mardi4nfdi.de/entity/Q4948733	2000-04-26	Paper
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation	1998-12-02	Paper
A linear-time approximation scheme for minimum weight triangulation of convex polygons	1998-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q4390742	1998-05-26	Paper
Fast algorithms for complete linkage clustering	1998-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q4875212	1996-04-28	Paper

Research outcomes over time

This page was built for person: Drago Krznaric