default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDrago Krznaric
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j8]Drago Krznaric, Christos Levcopoulos
:
Optimal algorithms for complete linkage clustering in d dimensions. Theor. Comput. Sci. 286(1): 139-149 (2002)
1990 – 1999
- 1999
- [j7]Christos Levcopoulos, Drago Krznaric:
The greedy triangulation can be computed from the Delaunay triangulation in linear time. Comput. Geom. 14(4): 197-220 (1999) - [j6]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999) - 1998
- [j5]Christos Levcopoulos, Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21(3): 285-311 (1998) - [j4]Drago Krznaric, Christos Levcopoulos:
Fast Algorithms for Complete Linkage Clustering. Discret. Comput. Geom. 19(1): 131-145 (1998) - [j3]Christos Levcopoulos, Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. J. Algorithms 27(2): 303-338 (1998) - [j2]Drago Krznaric, Christos Levcopoulos:
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. Nord. J. Comput. 5(1) (1998) - 1997
- [b1]Drago Krznaric:
Progress in Hierarchical Clustering & Minimum Weight Triangulation. Lund University, Sweden, 1997 - [c7]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349 - [c6]Drago Krznaric, Christos Levcopoulos:
Optimal Algorithms for Complete Linkage Clustering in d Dimensions. MFCS 1997: 368-377 - [c5]Christos Levcopoulos, Drago Krznaric:
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). SODA 1997: 518-527 - 1996
- [j1]Christos Levcopoulos, Drago Krznaric:
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. Inf. Process. Lett. 57(3): 129-135 (1996) - [c4]Christos Levcopoulos, Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. SODA 1996: 392-401 - [c3]Christos Levcopoulos, Drago Krznaric:
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). SWAT 1996: 296-308 - 1995
- [c2]Drago Krznaric, Christos Levcopoulos:
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. FSTTCS 1995: 443-455 - [c1]Drago Krznaric, Christos Levcopoulos:
The First Subquadratic Algorithm for Complete Linkage Clustering. ISAAC 1995: 392-401
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
