{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:34Z","timestamp":1760439994423},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0012-365x(90)90147-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"153-164","source":"Crossref","is-referenced-by-count":20,"title":["Covering convex sets with non-overlapping polygons"],"prefix":"10.1016","volume":"81","author":[{"given":"Herbert","family":"Edelsbrunner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arch D.","family":"Robison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Jun","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90147-A_BIB1","unstructured":"H. Edelsbrunner and M. Sharir, The maximum number of ways to stab n convex non-intersecting sets in the plane is 2n\u22122, to appear in Discrete Comput. Geom."},{"key":"10.1016\/0012-365X(90)90147-A_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00181607","article-title":"Zerlegung von Dreiecken in Dreiecke mit Nebenbedingungen","volume":"24","author":"Florian","year":"1987","journal-title":"Geometriae Dedicata"},{"key":"10.1016\/0012-365X(90)90147-A_BIB3","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02187708","article-title":"Geometric permutations and common transversals","volume":"1","author":"Katchalski","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0012-365X(90)90147-A_BIB4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0012-365X(85)90111-6","article-title":"Geometric permutations for convex sets","volume":"54","author":"Katchalski","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90147-A_BIB5","series-title":"Rep. TR-SOCS-86.19","article-title":"Upper bounds on linear orderings","author":"Wenger","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090147A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090147A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:18Z","timestamp":1555120398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090147A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0012365X9090147A"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90147-a","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}