{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:14Z","timestamp":1725663614228},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:47:30Z","timestamp":1330249650000},"page":"105-112","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tight bounds for the rectangular art gallery problem"],"prefix":"10.1007","author":[{"given":"J.","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Rivera-Campo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"N. Chiba and T. Nishizeki, The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs, J. Algorithms, V.10 (2) (1989), 187\u2013212.","journal-title":"J. Algorithms"},{"key":"10_CR2","unstructured":"B. Grunbaum, Convex polytopes, J. Weily & Sons, 1967."},{"key":"10_CR3","unstructured":"B. Grunbaum and J. O'Rourke, 1983 (see [5].)."},{"key":"10_CR4","unstructured":"T. Nishizeki, Lower bounds on cardinality of the maximum matchings of planar graphs, Carnegie Mellon Tech. Report, 1977."},{"key":"10_CR5","unstructured":"J. O'Rourke, Art gallery theorems and algorithms, Oxford U. Press, 1987."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W. Tutte","year":"1956","unstructured":"W. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc.\n82 (1956), 99\u2013116.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:42:49Z","timestamp":1558269769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"5 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}