{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:16Z","timestamp":1725664156814},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57568-5_237","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:12:05Z","timestamp":1330243925000},"page":"78-87","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A graph coloring result and its consequences for some guarding problems"],"prefix":"10.1007","author":[{"given":"Frank","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, A combinatorial theorem in plane geometry, J. Combin. Theory Ser. B, 1975, Vol. 18, pp. 39\u201341.","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR2","unstructured":"Z. F\u00fcredi and D. Kleitmann, The Prison Yard Problem, to appear in Combinatorica"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"J. Kahn and M. Klawe and D. Kleitman, Traditional galleries require fewer watchmen, SIAM Journal of Alg. Disc. Math., 1983, pp. 194\u2013206.","DOI":"10.1137\/0604020"},{"key":"9_CR4","first-page":"717","volume":"443","author":"F. Hoffmann","year":"1990","unstructured":"F. Hoffmann, On the rectilinear art gallery problem, Proc. ICALP'90, LNCS 443, 1990, pp. 717\u2013728.","journal-title":"LNCS"},{"key":"9_CR5","volume-title":"Technical Report B93-08","author":"F. Hoffmann","year":"1993","unstructured":"F. Hoffmann and K. Kriegel, A Graph Coloring Result and Its Concequences For Polygon Guarding Problems, Technical Report B93-08 Institut f\u00fcr Informatik, FU Berlin, June 1993."},{"key":"9_CR6","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North Holland, Amsterdam, 1979."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"A. Lubiw, Decomposing polygonal regions into convex quadrilaterals, Proc. 1st ACM Symp. Comp. Geometry, 1985, pp. 97\u2013106.","DOI":"10.1145\/323233.323247"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"G. Miller, Finding small simple cycle separators for 2-connected planar graphs, Journal of Comp. and System Sciences, 1986, pp. 265\u2013279.","DOI":"10.1016\/0022-0000(86)90030-9"},{"key":"9_CR9","unstructured":"J. O'Rourke, Art gallery theorems and algorithms, Oxford University Press, 1987"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/130956.130957","volume":"23","author":"J. O'Rourke","year":"1992","unstructured":"J. O'Rourke, Computational Geometry Column 15, SIGACT News 23:2, 1992, pp. 26\u201328","journal-title":"SIGACT News"},{"key":"9_CR11","unstructured":"T. Shermer, Triangulation graphs that require extra guards, NYIT, Computer Graphics tech. report No.3D-13, 1984."},{"issue":"9","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. Shermer","year":"1992","unstructured":"T. Shermer, Recent results in art galleries, Proc. IEEE, 80(9), 1992, pp. 1384\u20131399","journal-title":"Proc. IEEE"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:21:32Z","timestamp":1578518492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_237"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_237","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}