{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:14:25Z","timestamp":1649160865367},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T00:00:00Z","timestamp":1418083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-014-9822-1","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T14:20:33Z","timestamp":1418048433000},"page":"341-353","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal space coverage with white convex polygons"],"prefix":"10.1007","volume":"32","author":[{"given":"Shayan","family":"Ehsani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadAmin","family":"Fazli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadAli","family":"Safari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,9]]},"reference":[{"issue":"2","key":"9822_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"PK Agarwal","year":"2006","unstructured":"Agarwal PK, Mustafa NH (2006) Independent set of intersection graphs of convex objects in 2d. Comp Geom 34(2):83\u201395","journal-title":"Comp Geom"},{"issue":"1","key":"9822_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N Castro De","year":"2002","unstructured":"De Castro N, Cobos FJ, Dana JC, Marquez A, Noy M (2002) Triangle-free planar graphs as segment intersection graphs. J Graph Algorithms Appl 6(1):7\u201326","journal-title":"J Graph Algorithms Appl"},{"issue":"1","key":"9822_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51(1):161\u2013166","journal-title":"Ann Math"},{"key":"9822_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-18381-2_19","volume-title":"SOFSEM 2011: Theory and practice of computer science","author":"S Ehsani","year":"2011","unstructured":"Ehsani S, Fazli MA, Ghodsi M, Safari MA, Saghafian M, Tavakkoli M (2011) White space regions. In: Cerna I, Gyimothy T (eds) SOFSEM 2011: Theory and practice of computer science. Springer, Berlin, pp 226\u2013237"},{"key":"9822_CR5","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-57163-9_19","volume-title":"Fundamentals of computation theory","author":"P Fischer","year":"1993","unstructured":"Fischer P (1993) Finding maximum convex polygons. In: Esik Z (ed) Fundamentals of computation theory. Springer, Berlin, pp 234\u2013243"},{"key":"9822_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-13883-8_86","volume-title":"Foundations of software technology and theoretical computer science","author":"C Madhavan","year":"1984","unstructured":"Madhavan C (1984) Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Joseph M, Shyamasundar R (eds) Foundations of software technology and theoretical computer science. Springer, Berlin, pp 381\u2013392"},{"key":"9822_CR7","first-page":"533","volume":"48","author":"E Sas","year":"1941","unstructured":"Sas E (1941) On a certain extremum-property of the ellipse. Mat Fiz Lapok 48:533\u2013542","journal-title":"Mat Fiz Lapok"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9822-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9822-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9822-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9822-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,9]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9822"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9822-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,9]]}}}