{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:47:52Z","timestamp":1767134872165,"version":"3.48.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031252105"},{"type":"electronic","value":"9783031252112"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25211-2_7","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:02:42Z","timestamp":1674673362000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rectilinear Voronoi Games with\u00a0a\u00a0Simple Rectilinear Obstacle in\u00a0Plane"],"prefix":"10.1007","author":[{"given":"Arun Kumar","family":"Das","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"family":"Sarvottamananda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"HK Ahn","year":"2004","unstructured":"Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Theoret. Comput. Sci. 310(1), 457\u2013467 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.tcs.2014.10.003","volume":"562","author":"S Bandyapadhyay","year":"2015","unstructured":"Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi game on graphs. Theoret. Comput. Sci. 562, 270\u2013282 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10878-011-9447-6","volume":"26","author":"A Banik","year":"2013","unstructured":"Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4), 655\u2013669 (2013)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2019.01.003","volume":"47","author":"A Banik","year":"2019","unstructured":"Banik, A., Bhattacharya, B.B., Das, S., Das, S.: The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47(2), 115\u2013121 (2019)","journal-title":"Oper. Res. Lett."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.comgeo.2017.02.003","volume":"63","author":"A Banik","year":"2017","unstructured":"Banik, A., Bhattacharya, B.B., Das, S., Mukherjee, S.: The discrete Voronoi game in $$\\mathbb{R} ^2$$. Comput. Geom. 63, 53\u201362 (2017)","journal-title":"Comput. Geom."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2021.06.023","volume":"882","author":"A Banik","year":"2021","unstructured":"Banik, A., Das, A.K., Das, S., Maheshwari, A.: Sarvottamananda: Voronoi game on polygons. Theoret. Comput. Sci. 882, 125\u2013142 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-030-64843-5_35","volume-title":"Combinatorial Optimization and Applications","author":"A Banik","year":"2020","unstructured":"Banik, A., Das, A.K., Das, S., Maheshwari, A., Sarvottamananda, S.: Optimal strategies in single round Voronoi game on convex polygons with constraints. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 515\u2013529. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64843-5_35"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2019.04.012","volume":"793","author":"A Banik","year":"2019","unstructured":"Banik, A., Das, S., Maheshwari, A., Smid, M.: The discrete Voronoi game in a simple polygon. Theoret. Comput. Sci. 793, 28\u201335 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","unstructured":"de Berg, M., Kisfaludi-Bak, S., Mehr, M.: On one-round discrete Voronoi games. In: Lu, P., Zhang, G. (eds.) 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 149, pp. 37:1\u201337:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O Cheong","year":"2004","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matousek, J.: The one-round Voronoi game. Discrete Comput. Geom. 31(1), 125\u2013138 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Das, A.K., Das, S., Maheshwari, A., Sarvattomananda, S.: Voronoi games using geodesics. In: Balachandran, N., Inkulu, R. (eds.) Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, 10\u201312 February 2022, LNCS, vol. 13179, pp. 195\u2013207. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95018-7_16","DOI":"10.1007\/978-3-030-95018-7_16"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75520-3_4","volume-title":"Algorithms \u2013 ESA 2007","author":"C D\u00fcrr","year":"2007","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash equilibria in Voronoi games on graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 17\u201328. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_4"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"SP Fekete","year":"2005","unstructured":"Fekete, S.P., Meijer, H.: The one-round Voronoi game replayed. Comput. Geom. 30(2), 81\u201394 (2005)","journal-title":"Comput. Geom."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Sun, X., Sun, Y., Xia, Z., Zhang, J.: The one-round multi-player discrete Voronoi game on grids and trees. Theoret. Comput. Sci. 838, 143\u2013159 (2020)","DOI":"10.1016\/j.tcs.2020.06.028"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"485","DOI":"10.7155\/jgaa.00235","volume":"15","author":"S Teramoto","year":"2011","unstructured":"Teramoto, S., Demaine, E.D., Uehara, R.: The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4), 485\u2013501 (2011)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25211-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:44:04Z","timestamp":1767134644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25211-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252105","9783031252112"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25211-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","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":"Gandhinagar","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2023.daiict.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}