{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:26Z","timestamp":1742913206922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-83438-7_30","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:28Z","timestamp":1738706188000},"page":"358-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing the\u00a0Maximum Degree in\u00a0Ordered Nearest Neighbor Graphs"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"\u00c1goston","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Dumitrescu","sequence":"additional","affiliation":[]},{"given":"Arsenii","family":"Sagdeev","sequence":"additional","affiliation":[]},{"given":"Karamjeet","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Ji","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Eppstein, D., Matou\u0161ek, J.: Dynamic half-space reporting, geometric optimization, and minimum spanning trees. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 80\u201390 (1992)","DOI":"10.1109\/SFCS.1992.267816"},{"key":"30_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101898","volume":"107","author":"VH Almendra-Hern\u00e1ndez","year":"2022","unstructured":"Almendra-Hern\u00e1ndez, V.H., Mart\u00ednez-Sandoval, L.: On prescribing total orders and preorders to pairwise distances of points in Euclidean space. Comput. Geom. 107, 101898 (2022)","journal-title":"Comput. Geom."},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.comgeo.2007.07.004","volume":"40","author":"B Aronov","year":"2008","unstructured":"Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Vigneron, A.: Sparse geometric graphs with small dilation. Comput. Geom. 40(3), 207\u2013219 (2008)","journal-title":"Comput. Geom."},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comgeo.2004.01.003","volume":"28","author":"P Bose","year":"2004","unstructured":"Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Comput. Geom. 28(1), 11\u201318 (2004)","journal-title":"Comput. Geom."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica 42, 249\u2013264 (2005)","journal-title":"Algorithmica"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3), 233\u2013249 (2004)","journal-title":"Comput. Geom."},{"key":"30_CR7","first-page":"507","volume":"38","author":"P Boyvalenkov","year":"2012","unstructured":"Boyvalenkov, P., Dodunekov, S., Musin, O.R.: A survey on the kissing numbers. Serdica Math. J. 38, 507\u2013522 (2012)","journal-title":"Serdica Math. J."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, 3rd edn. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"30_CR10","unstructured":"Eppstein, D.: Fully dynamic maintenance of Euclidean minimum spanning trees and maxima of decomposable functions. Technical Report 92-88, University of California, Irvine (1992)"},{"key":"30_CR11","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, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. Discret. Comput. Geom. 17, 263\u2013282 (1997)","journal-title":"Discret. Comput. Geom."},{"issue":"11","key":"30_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0895-7177(93)90257-Y","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary, F., Jacobson, M.S., Lipman, M.J., McMorris, F.R.: Abstract sphere-of-influence graphs. Math. Comput. Model. 17(11), 77\u201383 (1993)","journal-title":"Math. Comput. Model."},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1112\/plms.12400","volume":"123","author":"X He","year":"2021","unstructured":"He, X., Fox, J.: Independent sets in hypergraphs with a forbidden link. Proc. Lond. Math. Soc. 123(4), 384\u2013409 (2021)","journal-title":"Proc. Lond. Math. Soc."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"30_CR16","unstructured":"Mitchell, J.S.B., Mulzer, W.: Proximity algorithms. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn. CRC Press (2017)"},{"key":"30_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"30_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985)"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1112\/S0025579300012079","volume":"44","author":"CA Rogers","year":"1997","unstructured":"Rogers, C.A., Zong, C.: Covering convex bodies by translates of convex bodies. Mathematika 44(1), 215\u2013218 (1997)","journal-title":"Mathematika"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Smid, M.: Closest-point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877\u2013936. Elsevier Science, Amsterdam (2000)","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in $$k$$-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","DOI":"10.1137\/0211059"}],"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-83438-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:32Z","timestamp":1738706192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","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":"Coimbatore","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}