{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T17:44:52Z","timestamp":1763747092253},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T00:00:00Z","timestamp":1331769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10878-012-9475-x","type":"journal-article","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T17:05:24Z","timestamp":1331744724000},"page":"208-233","source":"Crossref","is-referenced-by-count":12,"title":["Coverage with k-transmitters in the presence of obstacles"],"prefix":"10.1007","volume":"25","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","published-online":{"date-parts":[[2012,3,15]]},"reference":[{"key":"9475_CR1","first-page":"117","volume-title":"Proc 25th European conference on computational geometry","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer O, Aurenhammer F, Hurtado F, Ramos P, Urrutia J (2009a) k-convex polygons. In: Proc 25th European conference on computational geometry, pp 117\u2013120"},{"key":"9475_CR2","first-page":"167","volume-title":"Proc 25th European conference on computational geometry","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer O, Fabila-Monroy R, Flores-Pe\u00f1aloza D, Hackl T, Huemer C, Urrutia J, Vogtenhuber B (2009b) Modem illumination of monotone polygons. In: Proc 25th European conference on computational geometry, pp 167\u2013170"},{"key":"9475_CR3","series-title":"Contemporary mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/098","volume-title":"Every planar map is four colorable","author":"K Appel","year":"1989","unstructured":"Appel K, Haken W (1989) Every planar map is four colorable. Contemporary mathematics, vol 98."},{"key":"9475_CR4","first-page":"12","volume":"41","author":"O Borodin","year":"1984","unstructured":"Borodin O (1984) Solution of Ringel\u2019s problem on vertex-face coloring of plane graphs and coloring of 1-planar graphs (in Russian). Metody Diskret Analiz 41:12\u201326","journal-title":"Metody Diskret Analiz"},{"issue":"4","key":"9475_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"O Borodin","year":"1995","unstructured":"Borodin O (1995) A new proof of the 6 color theorem. J Graph Theory 19(4):507\u2013521","journal-title":"J Graph Theory"},{"issue":"1\u20133","key":"9475_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0012-365X(99)00018-7","volume":"203","author":"O Borodin","year":"1999","unstructured":"Borodin O, Sanders DP, Zhao Y (1999) On cyclic colorings and their generalizations. Discrete Math 203(1\u20133):23\u201340","journal-title":"Discrete Math"},{"key":"9475_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-69903-3_9","volume-title":"SWAT \u201908: proceedings of the 11th Scandinavian workshop on algorithm theory","author":"T Christ","year":"2008","unstructured":"Christ T, Hoffmann M, Okamoto Y, Uno T (2008) Improved bounds for wireless localization. In: SWAT \u201908: proceedings of the 11th Scandinavian workshop on algorithm theory. Springer, Berlin\/Heidelberg, pp 77\u201389"},{"key":"9475_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal V (1975) A combinatorial theorem in plane geometry. J Comb Theory, Ser B 18:39\u201341","journal-title":"J Comb Theory, Ser B"},{"key":"9475_CR9","doi-asserted-by":"crossref","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 (1994) Guarding rectangular art galleries. Discrete Appl Math 50:149\u2013157","journal-title":"Discrete Appl Math"},{"key":"9475_CR10","first-page":"21","volume-title":"FWCG 07: proc of the 17th fall workshop on computational geometry","author":"M Damian","year":"2007","unstructured":"Damian M, Flatland R, O\u2019Rourke J, Ramaswami S (2007) A new lower bound on guard placement for wireless localization. In: FWCG 07: proc of the 17th fall workshop on computational geometry, pp 21\u201324"},{"key":"9475_CR11","series-title":"LNCS","first-page":"73","volume-title":"Proc of graph drawing","author":"AM Dean","year":"2005","unstructured":"Dean AM, Evans W, Gethner E, Laison J, Safari MA, Trotter WT (2005) Bar k-visibility graphs: bounds on the number of edges, chromatic number, and thickness. In: Proc of graph drawing. LNCS, vol 3843, pp 73\u201382"},{"key":"9475_CR12","first-page":"27","volume-title":"SoCG","author":"D Eppstein","year":"2007","unstructured":"Eppstein D, Goodrich MT, Sitchinava N (2007) Guard placement for efficient point-in-polygon proofs. In: SoCG, pp 27\u201336"},{"key":"9475_CR13","volume-title":"XIII encuentros de geometria computacional","author":"R Fabila-Monroy","year":"2009","unstructured":"Fabila-Monroy R, Vargas AR, Urrutia J (2009) On modem illumination problems. In: XIII encuentros de geometria computacional, Zaragoza, Spain"},{"issue":"1","key":"9475_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00157","volume":"12","author":"S Felsner","year":"2008","unstructured":"Felsner S, Massow M (2008) Parameters of bar k-visibility graphs. J Graph Algorithms Appl 12(1):5\u201327","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"9475_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00454-009-9163-5","volume":"42","author":"R Fulek","year":"2009","unstructured":"Fulek R, Holmsen AF, Pach J (2009) Intersecting convex sets by rays. Discrete Comput Geom 42(3):343\u2013358","journal-title":"Discrete Comput Geom"},{"issue":"2","key":"9475_CR16","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1137\/050644240","volume":"21","author":"SG Hartke","year":"2007","unstructured":"Hartke SG, Vandenbussche J, Wenger P (2007) Further results on bar k-visibility graphs. SIAM J Discrete Math 21(2):523\u2013531","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"9475_CR17","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"DT Lee","year":"1986","unstructured":"Lee DT, Lin AK (1986) Computational complexity of art gallery problems. IEEE Trans Inf Theory 32(2):276\u2013282","journal-title":"IEEE Trans Inf Theory"},{"key":"9475_CR18","volume-title":"Art gallery theorems and algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke J (1987) Art gallery theorems and algorithms. Oxford University Press, New York"},{"issue":"1","key":"9475_CR19","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jctb.2001.2046","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders DP, Zhao Y (2001) A new bound on the cyclic chromatic number. J Comb Theory, Ser B 83(1):102\u2013111","journal-title":"J Comb Theory, Ser B"},{"key":"9475_CR20","doi-asserted-by":"crossref","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 (2000) Art gallery and illumination problems. In: Sack J-R, Urrutia J (eds) Handbook of computational geometry. North-Holland, Amsterdam, pp 973\u20131027"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9475-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9475-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9475-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:17Z","timestamp":1559262197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9475-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,15]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9475"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9475-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,15]]}}}