{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:56:05Z","timestamp":1648666565257},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00103-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"207-210","source":"Crossref","is-referenced-by-count":2,"title":["Finding a shortest Hamiltonian path inside a simple polygon"],"prefix":"10.1016","volume":"59","author":[{"given":"Muhammad H.","family":"Alsuwaiyel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(96)00103-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(93)90027-4","article-title":"Minimal link visibility paths inside a simple polygon","volume":"3","author":"Alsuwaiyel","year":"1993","journal-title":"Comput. Geometry Theory Appl."},{"key":"10.1016\/0020-0190(96)00103-2_BIB2","series-title":"Proc. 4th Ann. Internat. Symp. on Algorithms Comput. (ISAAC93)","article-title":"Finding the shortest watchman route in a simple polygon","author":"Carlsson","year":"1993"},{"key":"10.1016\/0020-0190(96)00103-2_BIB3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","article-title":"Optimum watchman routes","volume":"28","author":"Chin","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00103-2_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:46Z","timestamp":1555959166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001032"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00103-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}