{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:36Z","timestamp":1760440956254},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17461-2_1","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T04:53:59Z","timestamp":1292388839000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["Coverage with k-Transmitters in the Presence of Obstacles"],"prefix":"10.1007","author":[{"given":"Brad","family":"Ballinger","sequence":"first","affiliation":[]},{"given":"Nadia","family":"Benbernou","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Mirela","family":"Damian","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]},{"given":"Robin","family":"Flatland","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[]},{"given":"Diane","family":"Souvaine","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F., Ramos, P., Urrutia, J.: k-convex polygons. In: EuroCG, pp. 117\u2013120 (2009)"},{"key":"1_CR2","unstructured":"Aichholzer, O., Fabila-Monroy, R., Flores-Pealoza, D., Hackl, T., Huemer, C., Urrutia, J., Vogtenhuber, B.: Modem illumination of monotone polygons. In: EuroCG (2009)"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"O. Borodin","year":"1995","unstructured":"Borodin, O.: A new proof of the 6 color theorem. Journal of Graph Theory\u00a019(4), 507\u2013521 (1995)","journal-title":"Journal of Graph Theory"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-69903-3_9","volume-title":"SWAT 2008","author":"T. Christ","year":"2008","unstructured":"Christ, T., Hoffmann, M., Okamoto, Y., Uno, T.: Improved bounds for wireless localization. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 77\u201389. Springer, Heidelberg (2008)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory Series B\u00a018, 39\u201341 (1975)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(92)00029-L","volume":"50","author":"J. Czyzowicz","year":"1994","unstructured":"Czyzowicz, J., Rivera-Campo, E., Santoro, N., Urrutia, J., Zaks, J.: Guarding rectangular art galleries. Discrete Applied Math.\u00a050, 149\u2013157 (1994)","journal-title":"Discrete Applied Math."},{"key":"1_CR7","unstructured":"Damian, M., Flatland, R., O\u2019Rourke, J., Ramaswami, S.: A new lower bound on guard placement for wireless localization. In: Proc. of the 17th Fall Workshop on Computational Geometry, FWCG 2007, pp. 21\u201324 (November 2007)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11618058_7","volume-title":"Graph Drawing","author":"A.M. Dean","year":"2005","unstructured":"Dean, A.M., Evans, W., Gethner, E., Laison, J., Safari, M.A., Trotter, W.T.: Bar k-visibility graphs: Bounds on the number of edges, chromatic number, and thickness. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 73\u201382. Springer, Heidelberg (2005)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Sitchinava, N.: Guard placement for efficient point-in-polygon proofs. In: SoCG, pp. 27\u201336 (2007)","DOI":"10.1145\/1247069.1247075"},{"key":"1_CR10","unstructured":"Fabila-Monroy, R., Vargas, A.R., Urrutia, J.: On modem illumination problems. In: XIII Encuentros de Geometria Computacional, Zaragoza, Spain (June 2009)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00157","volume":"12","author":"S. Felsner","year":"2008","unstructured":"Felsner, S., Massow, M.: Parameters of bar k-visibility graphs. Journal of Graph Algorithms and Applications\u00a012(1), 5\u201327 (2008)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00454-009-9163-5","volume":"42","author":"R. Fulek","year":"2009","unstructured":"Fulek, R., Holmsen, A.F., Pach, J.: Intersecting convex sets by rays. Discrete Comput. Geom.\u00a042(3), 343\u2013358 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1137\/050644240","volume":"21","author":"S.G. Hartke","year":"2007","unstructured":"Hartke, S.G., Vandenbussche, J., Wenger, P.: Further results on bar k-visibility graphs. SIAM Journal of Discrete Mathematics\u00a021(2), 523\u2013531 (2007)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theor.\u00a032(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR15","volume-title":"Art gallery theorems and algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Inc., New York (1987)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume-title":"Handbook of Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131027. North-Holland, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T15:30:30Z","timestamp":1553268630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}