{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:08Z","timestamp":1742914148922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181253"},{"type":"electronic","value":"9783030181260"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-18126-0_3","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"26-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Guarding of Polygons and Terrains"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meghana M.","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00453-001-0116-5","volume":"33","author":"J Alber","year":"2002","unstructured":"Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461\u2013493 (2002)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR2","first-page":"25","volume":"14","author":"P Ashok","year":"2018","unstructured":"Ashok, P., Fomin, F.V., Kolay, S., Saurabh, S., Zehavi, M.: Exact algorithms for terrain guarding. ACM Trans. Algorithms (TALG) 14(2), 25 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"3_CR3","first-page":"189","volume":"189","author":"DW Bange","year":"1988","unstructured":"Bange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. Appl. Discrete Math. 189, 189\u2013199 (1988)","journal-title":"Appl. Discrete Math."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., Ghosh, S.K., Mihal\u00e1k, M., Tschager, T., Widmayer, P.: Improved bounds for the conflict-free chromatic art gallery problem. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, p. 144. ACM (2014)","DOI":"10.1145\/2582112.2582117"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00453-012-9732-5","volume":"68","author":"A B\u00e4rtschi","year":"2014","unstructured":"B\u00e4rtschi, A., Suri, S.: Conflict-free chromatic art gallery coverage. Algorithmica 68(1), 265\u2013283 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"15","author":"N Biggs","year":"1973","unstructured":"Biggs, N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15(3), 289\u2013296 (1973)","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR7","unstructured":"Bonnet, E., Miltzow, T.: Parameterized hardness of art gallery problems. In: 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 22\u201324 August 2016, pp. 19:1\u201319:17 (2016)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-57568-5_282","volume-title":"Algorithms and Computation","author":"GJ Chang","year":"1993","unstructured":"Chang, G.J., Pandu Rangan, C., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 506\u2013514. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_282"},{"issue":"1","key":"3_CR9","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. J. Comb. Theory Ser. B 18(1), 39\u201341 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 3. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"3_CR11","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (2012)"},{"key":"3_CR12","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability of some art gallery problems. In: CCCG, pp. 64\u201365 (1998)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Erickson, L.H., LaValle, S.M.: An art gallery approach to ensuring that landmarks are distinguishable. In: Robotics: Science and Systems, vol. 7, pp. 81\u201388 (2012)","DOI":"10.7551\/mitpress\/9481.003.0016"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(90)90026-B","volume":"11","author":"H Everett","year":"1990","unstructured":"Everett, H., Corneil, D.G.: Recognizing visibility graphs of spiral polygons. J. Algorithms 11(1), 1\u201326 (1990)","journal-title":"J. Algorithms"},{"key":"3_CR15","unstructured":"Fekete, S.P., Friedrichs, S., Hemmer, M.: Complexity of the general chromatic art gallery problem. arXiv preprint arXiv:1403.2972 (2014)"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"issue":"6","key":"3_CR17","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.dam.2009.12.004","volume":"158","author":"SK Ghosh","year":"2010","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discrete Appl. Math. 158(6), 718\u2013722 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.comgeo.2013.08.012","volume":"47","author":"A Gilbers","year":"2014","unstructured":"Gilbers, A., Klein, R.: A new upper bound for the VC-dimension of visibility regions. Comput. Geom. 47(1), 61\u201374 (2014)","journal-title":"Comput. Geom."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.tcs.2015.06.028","volume":"595","author":"F Khodakarami","year":"2015","unstructured":"Khodakarami, F., Didehvar, F., Mohades, A.: A fixed-parameter algorithm for guarding 1.5D terrains. Theor. Comput. Sci. 595, 130\u2013142 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2016.11.015","volume":"661","author":"F Khodakarami","year":"2017","unstructured":"Khodakarami, F., Didehvar, F., Mohades, A.: 1.5D terrain guarding problem parameterized by guard range. Theor. Comput. Sci. 661, 65\u201369 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR21","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.: Improved approximation for guarding simple galleries from the perimeter. Discrete Comput. Geom. 46(2), 252\u2013269 (2011)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"J King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011)","journal-title":"SIAM J. Comput."},{"key":"3_CR23","unstructured":"Krohn, E., Nilsson, B.J.: The complexity of guarding monotone polygons (2012)"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D Lee","year":"1986","unstructured":"Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0045090","volume-title":"Computing and Combinatorics","author":"YD Liang","year":"1997","unstructured":"Liang, Y.D., Lu, C.L., Tang, C.Y.: Efficient domination on permutation graphs and trapezoid graphs. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 232\u2013241. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0045090"},{"issue":"1\u20133","key":"3_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0166-218X(01)00184-6","volume":"117","author":"CL Lu","year":"2002","unstructured":"Lu, C.L., Tang, C.Y.: Weighted efficient domination problem on some perfect graphs. Discrete Appl. Math. 117(1\u20133), 163\u2013182 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"4\u20135","key":"3_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\u20135), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM (JACM) 55(2), 11 (2008)","journal-title":"J. ACM (JACM)"},{"key":"3_CR29","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms, vol. 57. Oxford University Press, Oxford (1987)"},{"issue":"2","key":"3_CR30","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. Math. Logic Q. 41(2), 261\u2013267 (1995)","journal-title":"Math. Logic Q."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:44:37Z","timestamp":1709815477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}