{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:00Z","timestamp":1725815940659},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_5","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"45-57","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Guarding in Weak Visibility Polygons"],"prefix":"10.1007","author":[{"given":"Pritam","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Subir Kumar","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Bodhayan","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. PhD thesis, The Johns Hopkins University, Baltimore, MD (1984)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers\u00a030, 910\u2013914 (1981)","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR3","unstructured":"Bhattacharya, P., Ghosh, S.K., Roy, B.: Vertex guarding in weak visibility polygons. CoRR, abs\/1409.4621 (2014)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chvatal","year":"1975","unstructured":"Chvatal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B\u00a018(1), 39\u201341 (1975)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-73951-7_15","volume-title":"Algorithms and Data Structures","author":"A. Deshpande","year":"2007","unstructured":"Deshpande, A., Kim, T.-J., Demaine, E.D., Sarma, S.E.: A pseudopolynomial time o(logn)-approximation algorithm for art gallery problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 163\u2013174. Springer, Heidelberg (2007)"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","volume":"100","author":"A. Efrat","year":"2006","unstructured":"Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Information Processing Letters\u00a0100(6), 238\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"5_CR7","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability of some art gallery problems. In: Canadian Conference on Computational Geometry, pp. 1\u201311 (1998)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-001-0040-8","volume":"31","author":"S. Eidenbenz","year":"2001","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica\u00a031(1), 79\u2013113 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","volume":"24","author":"S. Fisk","year":"1978","unstructured":"Fisk, S.: A short proof of Chv\u00e1tal\u2019s watchman theorem. Journal of Combinatorial Theory, Series B\u00a024(3), 374 (1978)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"5_CR10","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems. In: Proc. of Canadian Information Processing Society Congress, pp. 429\u2013434 (1987)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"issue":"6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.dam.2009.12.004","volume":"158","author":"S.K. Ghosh","year":"2010","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discrete Applied Mathematics\u00a0158(6), 718\u2013722 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-11440-3_3","volume-title":"WALCOM: Algorithms and Computation","author":"S.K. Ghosh","year":"2010","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons and terrains. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 21\u201334. Springer, Heidelberg (2010)"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0925-7721(93)90010-4","volume":"3","author":"S.K. Ghosh","year":"1993","unstructured":"Ghosh, S.K., Maheshwari, A., Pal, S., Saluja, S., Veni Madhavan, C.E.: Characterizing and recognizing weak visibility polygons. Computational Geometry\u00a03(4), 213\u2013233 (1993)","journal-title":"Computational Geometry"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.comgeo.2007.02.002","volume":"39","author":"M.J. Katz","year":"2008","unstructured":"Katz, M.J., Roisman, G.S.: On guarding the vertices of rectilinear domains. Computational Geometry\u00a039(3), 219\u2013228 (2008)","journal-title":"Computational Geometry"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/s00454-011-9352-x","volume":"46","author":"J. King","year":"2011","unstructured":"King, J., Kirkpatrick, D.G.: Improved approximation for guarding simple galleries from the perimeter. Discrete & Computational Geometry\u00a046(2), 252\u2013269 (2011)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"5_CR18","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.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory\u00a032(2), 276\u2013282 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory\u00a029(2), 181\u2013189 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/malq.19950410212","volume":"41","author":"D. Schuchardt","year":"1995","unstructured":"Schuchardt, D., Hecker, H.-D.: Two NP-Hard Art-Gallery Problems for Ortho-Polygons. Mathematical Logic Quarterly\u00a041, 261\u2013267 (1995)","journal-title":"Mathematical Logic Quarterly"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:17:06Z","timestamp":1559107026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}