{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:09:23Z","timestamp":1742994563741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_10","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"122-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["One-Sided Discrete Terrain Guarding and Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Kasthurirangan","family":"Prahlad Narasimhan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Kolay, S., Zehavi, M.: Parameter analysis for guarding terrains. In: Albers, S. (ed.) 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, T\u00f3rshavn, Faroe Islands, 22\u201324 June 2020. LIPIcs, vol. 162, pp. 4:1\u20134:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.4","DOI":"10.4230\/LIPIcs.SWAT.2020.4"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Ashok, P., Fomin, F.V., Kolay, S., Saurabh, S., Zehavi, M.: Exact algorithms for terrain guarding. ACM Trans. Algorithms 14(2), 25:1\u201325:20 (2018). https:\/\/doi.org\/10.1145\/3186897","DOI":"10.1145\/3186897"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: A constant-factor approximation algorithm for optimal 1.5D terrain guarding. SIAM J. Comput. 36(6), 1631\u20131647 (2007). https:\/\/doi.org\/10.1137\/S0097539704446384","DOI":"10.1137\/S0097539704446384"},{"key":"10_CR4","unstructured":"Chen, D.Z., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains. In: Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995, pp. 133\u2013138. Carleton University, Ottawa, Canada (1995). http:\/\/www.cccg.ca\/proceedings\/1995\/cccg1995_0022.pdf"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discret. Comput. Geom. 37(1), 43\u201358 (2007). https:\/\/doi.org\/10.1007\/s00454-006-1273-8","DOI":"10.1007\/s00454-006-1273-8"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Elbassioni, K.M., Krohn, E., Matijevic, D., Mestre, J., Severdija, D.: Improved approximations for guarding 1.5-dimensional terrains. Algorithmica 60(2), 451\u2013463 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9358-4","DOI":"10.1007\/s00453-009-9358-4"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discret. Math. 43(2\u20133), 173\u2013189 (1983). https:\/\/doi.org\/10.1016\/0012-365X(83)90154-1","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Friedrichs, S., Hemmer, M., King, J., Schmidt, C.: The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS. J. Comput. Geom. 7(1), 256\u2013284 (2016). https:\/\/doi.org\/10.20382\/jocg.v7i1a13","DOI":"10.20382\/jocg.v7i1a13"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972). https:\/\/doi.org\/10.1137\/0201013","DOI":"10.1137\/0201013"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Networks 13(2), 304\u2013305 (1983). https:\/\/doi.org\/10.1002\/net.3230130214","DOI":"10.1002\/net.3230130214"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Katz, M.J., Roisman, G.S.: On guarding the vertices of rectilinear domains. Comput. Geom. 39(3), 219\u2013228 (2008). https:\/\/doi.org\/10.1016\/j.comgeo.2007.02.002","DOI":"10.1016\/j.comgeo.2007.02.002"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Khodakarami, F., Didehvar, F., Mohades, A.: A fixed-parameter algorithm for guarding 1.5D terrains. Theor. Comput. Sci. 595, 130\u2013142 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.06.028","DOI":"10.1016\/j.tcs.2015.06.028"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/11682462_58","volume-title":"LATIN 2006: Theoretical Informatics","author":"J King","year":"2006","unstructured":"King, J.: A 4-approximation algorithm for guarding 1.5-dimensional terrains. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 629\u2013640. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_58"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. In: Charikar, M. (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17\u201319 January 2010, pp. 1580\u20131593. SIAM (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.128","DOI":"10.1137\/1.9781611973075.128"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Krohn, E., Gibson, M., Kanade, G., Varadarajan, K.R.: Guarding terrains via local search. J. Comput. Geom. 5(1), 168\u2013178 (2014). https:\/\/doi.org\/10.20382\/jocg.v5i1a9","DOI":"10.20382\/jocg.v5i1a9"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms. SIAM Rev. 31(2), 342\u2013343 (1989). https:\/\/doi.org\/10.1137\/1031076","DOI":"10.1137\/1031076"}],"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-030-67899-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:07:40Z","timestamp":1611792460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}