{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:51:07Z","timestamp":1774626667072,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4276,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0925-7721(01)00023-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:02:01Z","timestamp":1027591321000},"page":"97-104","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["On the number of disjoint convex quadrilaterals for a planar point set"],"prefix":"10.1016","volume":"20","author":[{"given":"Kiyoshi","family":"Hosono","sequence":"first","affiliation":[]},{"given":"Masatsugu","family":"Urabe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00023-2_BIB001","series-title":"Proc. of 1st ACM Symp. on Computational Geometry, Baltimore, MD","first-page":"161","article-title":"Computing the largest empty convex subset of a set of points","author":"Avis","year":"1985"},{"key":"10.1016\/S0925-7721(01)00023-2_BIB002","series-title":"Proc. of Conference University Haifa","first-page":"46","article-title":"Some combinatorial problems in geometry","volume":"792","author":"Erdo&#x030B;s","year":"1979"},{"key":"10.1016\/S0925-7721(01)00023-2_BIB003","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erdo&#x030B;s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/S0925-7721(01)00023-2_BIB004","unstructured":"G. Fabella, J. O'Rourke, Twenty-two points with no empty hexagon, Manuscript, 1986"},{"key":"10.1016\/S0925-7721(01)00023-2_BIB005","first-page":"116","article-title":"Konvexe F\u00fcnfecke in ebenen Punktmenger","volume":"33","author":"Harborth","year":"1978","journal-title":"Elem. Math."},{"key":"10.1016\/S0925-7721(01)00023-2_BIB006","doi-asserted-by":"crossref","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","article-title":"Sets with no empty convex 7-gons","volume":"26","author":"Horton","year":"1983","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0925-7721(01)00023-2_BIB007","first-page":"160","article-title":"Sets without empty convex 6-gons","volume":"37","author":"Overmars","year":"1989","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0925-7721(01)00023-2_BIB008","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0166-218X(94)00120-3","article-title":"On a partition into convex polygons","volume":"64","author":"Urabe","year":"1996","journal-title":"Discrete Appl. Math."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T11:02:59Z","timestamp":1760353379000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0925772101000232"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00023-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the number of disjoint convex quadrilaterals for a planar point set","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0925-7721(01)00023-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}