{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:08:50Z","timestamp":1751285330839},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":[[1990,8]]},"DOI":"10.1016\/0020-0190(90)90053-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"249-254","source":"Crossref","is-referenced-by-count":7,"title":["Finding Hamiltonian cycles in certain planar graphs"],"prefix":"10.1016","volume":"35","author":[{"given":"Robert J.","family":"Cimikowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90053-Z_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB2","first-page":"265","article-title":"Approximation algorithms for NP-complete problems on planar graphs","author":"Baker","year":"1983","journal-title":"Proc. IEEE Foundations of Computer Science Conference"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","article-title":"The Hamilton cycle problem is linear-time solvable for 4-connected planar graphs","volume":"10","author":"Chiba","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB4","first-page":"793","article-title":"Sur la sph\u00e9re vide","volume":"6","author":"Delaunay","year":"1934","journal-title":"Izv. Akad. Nauk SSSR, VII Ser. Otdel. Mat. Estestv. Nauk"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0095-8956(89)90008-7","article-title":"An upper bound on the shortness exponent of inscribable polytopes","volume":"46","author":"Dillencourt","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB7","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","article-title":"Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane","volume":"3","author":"Matula","year":"1980","journal-title":"Geog. Anal."},{"key":"10.1016\/0020-0190(90)90053-Z_BIB9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90053-Z_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0146-664X(74)80004-3","article-title":"Computing the perceptual boundaries of dot patterns","volume":"3","author":"O'Callaghan","year":"1974","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0020-0190(90)90053-Z_BIB11","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB12","first-page":"14","article-title":"The Dirichlet Tessellation as an aid in data analysis","volume":"7","author":"Sibson","year":"1980","journal-title":"Scand. J. Statist."},{"key":"10.1016\/0020-0190(90)90053-Z_BIB13","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1980","journal-title":"Proc. Fifth International Conference on Pattern Recognition"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-8655(83)90070-3","article-title":"Some properties of the planar euclidean relative neighborhood graph","volume":"1","author":"Urquhart","year":"1983","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0020-0190(90)90053-Z_BIB15","author":"Wigderson","year":"1982"},{"key":"10.1016\/0020-0190(90)90053-Z_BIB16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","article-title":"Embedding planar graphs in four pages","volume":"1","author":"Yannakakis","year":"1989","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090053Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090053Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T16:18:43Z","timestamp":1704212323000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090053Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["002001909090053Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90053-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}