{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:16Z","timestamp":1742914156835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_16","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"220-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Red-Black Spanners for\u00a0Mixed-Charging Vehicular Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2866-6766","authenticated-orcid":false,"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Yuya","family":"Higashikawa","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Junichi","family":"Teruyama","sequence":"additional","affiliation":[]},{"given":"Yuki","family":"Tokuni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3929-4128","authenticated-orcid":false,"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1","key":"16_CR1","first-page":"11","volume":"8","author":"A Biniaz","year":"2017","unstructured":"Biniaz, A., Bose, P., Carufel, J.D., Gavoille, C., Maheshwari, A., Smid, M.H.M.: Towards plane spanners of degree 3. J. Comput. Geom. 8(1), 11\u201331 (2017)","journal-title":"J. Comput. Geom."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-33090-2_19","volume-title":"Algorithms \u2013 ESA 2012","author":"N Bonichon","year":"2012","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: The stretch factor of L 1- and L$$\\infty $$-delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 205\u2013216. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_19"},{"issue":"7","key":"16_CR3","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.H.M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1142\/S0218195909002861","volume":"19","author":"P Bose","year":"2009","unstructured":"Bose, P., Smid, M.H.M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19(2), 119\u2013140 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chew, P.: There is a planar graph almost as good as the complete graph. In: Aggarwal, A. (ed.), Proceedings of the Second Annual ACM SIGACT\/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, 2\u20134 June 1986, pp. 169\u2013177. ACM (1986)","DOI":"10.1145\/10515.10534"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27\u201329 October 1987, pp. 20\u201326. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.18"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1142\/S0218195916500059","volume":"26","author":"A Dumitrescu","year":"2016","unstructured":"Dumitrescu, A., Ghosh, A.: Lower bounds on the dilation of plane spanners. Int. J. Comput. Geom. Appl. 26(2), 89\u2013110 (2016)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1016\/j.apenergy.2016.06.125","volume":"179","author":"MA Kazemi","year":"2016","unstructured":"Kazemi, M.A., Sedighizadeh, M., Mirzaei, M.J., Homaee, O.: Optimal siting and sizing of distribution system operator owned EV parking lots. Appl. Energy 179, 1176\u20131184 (2016)","journal-title":"Appl. Energy"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"M Keil","year":"1992","unstructured":"Keil, M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discret. Comput. Geom. 7, 13\u201328 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"6","key":"16_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1049\/iet-gtd.2019.0292","volume":"14","author":"Y Liang","year":"2020","unstructured":"Liang, Y., Guo, C., Yang, J., Ding, Z.: Optimal planning of charging station based on discrete distribution of charging demand. IET Gener. Trans. Distrib. 14(6), 965\u2013974 (2020)","journal-title":"IET Gener. Trans. Distrib."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511546884"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.apenergy.2014.03.077","volume":"125","author":"P Sadeghi-Barzani","year":"2014","unstructured":"Sadeghi-Barzani, P., Rajabi-Ghahnavieh, A., Kazemi-Karegar, H.: Optimal fast charging station placing and sizing. Appl. Energy 125, 289\u2013299 (2014)","journal-title":"Appl. Energy"},{"key":"16_CR14","unstructured":"Sperling, D.: New Transportation Fuels: A Strategic Approach to Technological Change. University of California Press, Berkeley (1990)"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.apenergy.2018.07.025","volume":"228","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Shi, J., Wang, R., Liu, Z., Wang, L.: Siting and sizing of fast charging stations in highway network with budget constraint. Appl. Energy 228, 1255\u20131271 (2018)","journal-title":"Appl. Energy"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620\u20131659 (2013)","DOI":"10.1137\/110832458"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of delaunay triangulations. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, 10\u201312 August 2011 (2011)","DOI":"10.1145\/1998196.1998235"},{"issue":"5","key":"16_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ifacol.2021.04.078","volume":"53","author":"H Zhu","year":"2020","unstructured":"Zhu, H., Pei, Z.: Data-driven layout design of regional battery swapping stations for electric bicycles. IFAC PapersOnLine 53(5), 13\u201318 (2020)","journal-title":"IFAC PapersOnLine"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:09:51Z","timestamp":1702026591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"3","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}