{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:49:59Z","timestamp":1754484599466},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015445","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"392-401","source":"Crossref","is-referenced-by-count":6,"title":["The first subquadratic algorithm for complete linkage clustering"],"prefix":"10.1007","author":[{"given":"Drago","family":"Krznaric","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"3","key":"44_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Franz Aurenhammer. Voronoi diagrams \u2014 A survey of a fundamental geometric data structure. ACM comp. Surveys 23(3), 1991, 345\u2013405.","journal-title":"ACM comp. Surveys"},{"key":"44_CR2","unstructured":"A. D. Gordon. Classification. Chapman and Hall, 1981."},{"key":"44_CR3","volume-title":"Algorithms for clustering data","author":"A. K. Jain","year":"1988","unstructured":"A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, New Jersey, 1988."},{"issue":"1","key":"44_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing 12(1), 1983, 28\u201335.","journal-title":"SIAM Journal of Computing"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"D. Krznaric and C. Levcopoulos. Fast algorithms for complete linkage clustering. Tech. Rep. LU-CS-TR:95-143, Dep. Comp. Sci., Lund Univ., 1995.","DOI":"10.1007\/BFb0015445"},{"key":"44_CR6","unstructured":"D. Krznaric and C. Levcopoulos. Computing a threaded quadtree (with links between neighbors) from the Delaunay triangulation in linear time. 7th Canadian Conf. on Computational Geometry, 1995, 187\u2013192."},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"D. Krznaric and C. Levcopoulos. Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time. 15th Conf. on FST & TCS, Lecture Notes in Comp. Sci., 1995.","DOI":"10.1007\/3-540-60692-0_66"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"F. Preparata and M. Shamos. Computational geometry: an introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"44_CR9","unstructured":"M. I. Shamos. Computational geometry. Ph. D. thesis, Dep. Comp. Sci., Yale Univ., 1978."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T10:58:10Z","timestamp":1683284290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0015445","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}