{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:40Z","timestamp":1759638220614},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_9","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"77-88","source":"Crossref","is-referenced-by-count":3,"title":["Voronoi Game on Graphs"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[]},{"given":"Aritra","family":"Banik","sequence":"additional","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Hirak","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"9_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":"9_CR2","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":"1","key":"9_CR3","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 & Computational Geometry\u00a031(1), 125\u2013138 (2004)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"S.P. Fekete","year":"2005","unstructured":"Fekete, S.P., Meijer, H.: The one-round voronoi game replayed. Comput. Geom.\u00a030(2), 81\u201394 (2005)","journal-title":"Comput. Geom."},{"key":"9_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"9_CR6","unstructured":"Hochbaum, D.S.: Approximation algorithms for $\\mathcal{NP}$ -Hard problems. PWS Publishing Company (1996)"},{"issue":"6","key":"9_CR7","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":"9_CR8","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","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T10:55:49Z","timestamp":1644144949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}