{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:04Z","timestamp":1725453784373},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_19","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"197-207","source":"Crossref","is-referenced-by-count":2,"title":["The Discrete Voronoi Game in a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H.-K. Ahn","year":"2004","unstructured":"Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci.\u00a0310(1-3), 457\u2013467 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-36065-7_9","volume-title":"WALCOM: Algorithms and Computation","author":"S. Bandyapadhyay","year":"2013","unstructured":"Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi game on graphs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 77\u201388. Springer, Heidelberg (2013)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. Journal of Combinatorial Optimization, 1\u201315 (2012)","DOI":"10.1007\/s10878-011-9447-6"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.ejor.2012.08.009","volume":"224","author":"B.B. Bhattacharya","year":"2013","unstructured":"Bhattacharya, B.B., Nandy, S.C.: New variations of the maximum coverage facility location problem. European Journal of Operational Research\u00a0224(3), 477\u2013485 (2013)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S. Cabello","year":"2010","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research\u00a0202(1), 99\u2013106 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci.\u00a039(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0377-2217(83)90180-7","volume":"12","author":"S.L. Hakimi","year":"1983","unstructured":"Hakimi, S.L.: On locating new facilities in a competitive environment. European Journal of Operational Research\u00a012(1), 29\u201335 (1983)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"19_CR8","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1587\/transinf.E94.D.1185","volume":"94-D","author":"M. Kiyomi","year":"2011","unstructured":"Kiyomi, M., Saitoh, T., Uehara, R.: Voronoi game on a path. IEICE Transactions\u00a094-D(6), 1185\u20131189 (2011)","journal-title":"IEICE Transactions"},{"issue":"4","key":"19_CR9","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.\u00a015(4), 485\u2013501 (2011)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T01:57:40Z","timestamp":1645063060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}