{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:34:55Z","timestamp":1725525295712},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_9","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"93-104","source":"Crossref","is-referenced-by-count":3,"title":["Maximum Neighbour Voronoi Games"],"prefix":"10.1007","author":[{"given":"Md. Muhibur","family":"Rasheed","sequence":"first","affiliation":[]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","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., 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","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-44679-6_26","volume-title":"Computing and Combinatorics","author":"H.-K. Ahn","year":"2001","unstructured":"Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location along a highway. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 237\u2013246. Springer, Heidelberg (2001)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/B978-044482537-7\/50006-1","volume-title":"Handbook of Computational Geometry","author":"F. Aurenhammer","year":"2000","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 201\u2013290. North-Holland, Amsterdam (2000)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45678-3_27","volume-title":"Algorithms and Computation","author":"T. Biedl","year":"2001","unstructured":"Biedl, T., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G.: Tight bounds on maximal and maximum matchings. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 308\u2013319. Springer, Heidelberg (2001)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00454-007-1328-5","volume":"37","author":"O. Cheong","year":"2007","unstructured":"Cheong, O., Efrat, A., Har-Peled, S.: Finding a guard that sees most and a shop that sells most. Discrete Comput. Geom.\u00a037(4), 545\u2013563 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR6","first-page":"97","volume-title":"SCG 2002: Proceedings of the 18th Annual Symposium on Computational Geometry","author":"O. Cheong","year":"2002","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matou\u0161ek, J.: The one-round Voronoi game. In: SCG 2002: Proceedings of the 18th Annual Symposium on Computational Geometry, pp. 97\u2013101. ACM, New York (2002)"},{"key":"9_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/3-540-36136-7_54","volume-title":"Algorithms and Computation","author":"F.K.H.A. Dehne","year":"2002","unstructured":"Dehne, F.K.H.A., Klein, R., Seidel, R.: Maximizing a voronoi region: The convex case. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 624\u2013634. Springer, Heidelberg (2002)"},{"issue":"2","key":"9_CR9","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. Theory Appl.\u00a030(2), 81\u201394 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR10","unstructured":"Rasheed, M.M.: Voronoi neighbors: Optimization, Variation and Games, MSc Thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh (2008)"},{"key":"9_CR11","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2002","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2002)","edition":"2"}],"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-00202-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:23:58Z","timestamp":1551756238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}