{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:27:59Z","timestamp":1757626079125,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,26]],"date-time":"2004-03-26T00:00:00Z","timestamp":1080259200000},"content-version":"vor","delay-in-days":4743,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0166-218x(91)90063-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computing external farthest neighbors for a simple polygon"],"prefix":"10.1016","volume":"31","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Alok","family":"Aggarwal","sequence":"additional","affiliation":[]},{"given":"Boris","family":"Aronov","sequence":"additional","affiliation":[]},{"given":"S.Rao","family":"Kosaraju","sequence":"additional","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90063-3_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(86)90028-1","article-title":"Deques with heap order","volume":"22","author":"Gajewska","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(91)90063-3_BIB2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","article-title":"Finding the convex hull of a simple polygon","volume":"4","author":"Graham","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(91)90063-3_BIB3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","article-title":"Optimal shortest path queries in a simple polygon","volume":"39","author":"Guibas","year":"1989","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0166-218X(91)90063-3_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for shortest path and visibility problems","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(91)90063-3_BIB5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(91)90063-3_BIB6","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF02187751","article-title":"Computing the geodesic center of a polygon","volume":"4","author":"Pollack","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(91)90063-3_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02247961","article-title":"Computing the external geodesic diameter of a simple polygon","volume":"44","author":"Samuel","year":"1990","journal-title":"Computing"},{"key":"10.1016\/0166-218X(91)90063-3_BIB8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0020-0190(89)90071-9","article-title":"Worst case data structures for the priority queue with attrition","volume":"31","author":"Sundar","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(91)90063-3_BIB9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(89)90045-7","article-title":"The all-geodesic-furthest neighbors problem for simple polygons","volume":"39","author":"Suri","year":"1989","journal-title":"J. Comput. Systems Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900633?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900633?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:52:46Z","timestamp":1757451166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91900633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0166218X91900633"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90063-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1991,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing external farthest neighbors for a simple polygon","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(91)90063-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}