{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:38:07Z","timestamp":1761514687793},"reference-count":15,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"published-print":{"date-parts":[[2021,4,3]]},"DOI":"10.1080\/23799927.2020.1862302","type":"journal-article","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T21:57:36Z","timestamp":1607637456000},"page":"130-136","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A progressive algorithm for the closest pair problem"],"prefix":"10.1080","volume":"6","author":[{"given":"Amir","family":"Mesrikhani","sequence":"first","affiliation":[{"name":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"}]},{"given":"Mohammad","family":"Farshi","sequence":"additional","affiliation":[{"name":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"}]},{"given":"Behnam","family":"Iranfar","sequence":"additional","affiliation":[{"name":"Combinatorial and Geometric Algorithms Lab., Department of Computer Science, Yazd University, Yazd, Iran"}]}],"member":"301","published-online":{"date-parts":[[2020,12,30]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582156"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808735"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/173"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90150-0"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1049"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"CIT0009","unstructured":"A. Mesrikhani, M. Farshi, M. Davoodi, Progressive algorithm for Euclidean minimum spanning tree, 1st Iranian Conference on Computational Geometry, Tehran, Iran, 2018."},{"key":"CIT0010","unstructured":"A. Mesrikhani, M. Farshi, Solving the convex hull problem progressively in the external memory model, 2nd Iranian Conference on Computational Geometry, Tehran, Iran, 2019."},{"key":"CIT0011","unstructured":"A. Mesrikhani, M. Farshi, Progressive sorting in the external memory model, CSI J. Comput. Sci. Eng. 15(2), pp. 1-4."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/0209024"},{"key":"CIT0013","unstructured":"M. Shamos, Geometric complexity, Proceedings of the 16th Annual IEEE Symposium on the Foundation of Computer Science, Albuquerque, NM, USA, 1975, pp. 151\u2013162."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1137\/0220041"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2015.45"}],"container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/23799927.2020.1862302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T09:16:55Z","timestamp":1621675015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/23799927.2020.1862302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,30]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,3]]}},"alternative-id":["10.1080\/23799927.2020.1862302"],"URL":"https:\/\/doi.org\/10.1080\/23799927.2020.1862302","relation":{},"ISSN":["2379-9927","2379-9935"],"issn-type":[{"value":"2379-9927","type":"print"},{"value":"2379-9935","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-05-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-07","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}