{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T07:59:59Z","timestamp":1790755199407,"version":"4.1.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["No. 864228 (AdjustNet)"],"award-info":[{"award-number":["No. 864228 (AdjustNet)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s00446-026-00513-2","type":"journal-article","created":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T06:41:53Z","timestamp":1786171313000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Demand-aware plane Spanners of Bounded Degree"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9577-4142","authenticated-orcid":false,"given":"Esra","family":"Ceylan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsiaryna","family":"Zaitsava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"513_CR1","doi-asserted-by":"crossref","unstructured":"Avin, C., Ghobadi, M., Griner, C., Schmid, S.: On the complexity of traffic traces and implications. In Proc, ACM SIGMETRICS (2020)","DOI":"10.1145\/3393691.3394205"},{"key":"513_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. In: ACM SIGCOMM CCR (2018)","DOI":"10.1145\/3310165.3310170"},{"key":"513_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacherjee, D., Singla, A.: Network topology design at 27, 000 km\/hour. In: CoNEXT, ACM (2019)","DOI":"10.1145\/3359989.3365407"},{"key":"513_CR4","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane spanners of maximum degree six. In: ICALP, pp. 19\u201330. Springer (2010)","DOI":"10.1007\/978-3-642-14165-2_3"},{"issue":"3","key":"513_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/s00454-015-9676-z","volume":"53","author":"N Bonichon","year":"2015","unstructured":"Bonichon, N., Kanj, I., Perkovi\u0107, L., Xia, G.: There are plane spanners of degree 4 and moderate stretch factor. Discrete Comput. Geom. 53(3), 514\u2013546 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"513_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jda.2012.03.004","volume":"15","author":"P Bose","year":"2012","unstructured":"Bose, P., Carmi, P., Chaitman-Yerushalmi, L.: On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15, 16\u201331 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"513_CR7","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(3), 249\u2013264 (2005)","journal-title":"Algorithmica"},{"issue":"7","key":"513_CR8","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.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"key":"513_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1142\/S0218195909002861","volume":"19","author":"P Bose","year":"2009","unstructured":"Bose, P., Smid, M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19, 119\u2013140 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"513_CR10","doi-asserted-by":"crossref","unstructured":"Ceylan, E., Foerster, K.T., Schmid, S., Zaitsava, K.: Demand-aware plane spanners of bounded degree. In: 2021 IFIP Networking Conference (IFIP Networking), pp. 1\u20139. IEEE (2021)","DOI":"10.23919\/IFIPNetworking52078.2021.9472769"},{"key":"513_CR11","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: SOCG, ACM (1986)","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"513_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comp. Sys. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comp. Sys. Sci."},{"key":"513_CR13","unstructured":"Durairajan, R., Barford, P., Sommers, J., Willinger, W.: Greyfiber: a system for providing flexible access to wide-area connectivity. CoRR\u00a0abs\/1807.05242 (2018)"},{"key":"513_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comcom.2020.10.003","volume":"164","author":"T Fenz","year":"2020","unstructured":"Fenz, T., Foerster, K.T., Schmid, S., Villedieu, A.: Efficient non-segregated routing for reconfigurable demand-aware networks. Comput. Commun. 164, 138\u2013147 (2020)","journal-title":"Comput. Commun."},{"issue":"2","key":"513_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/3336937.3336939","volume":"49","author":"KT Foerster","year":"2019","unstructured":"Foerster, K.T., Pacut, M., Schmid, S.: On the complexity of non-segregated routing in reconfigurable data center architectures. Comput. Commun. Rev. 49(2), 2\u20138 (2019)","journal-title":"Comput. Commun. Rev."},{"issue":"2","key":"513_CR16","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3351452.3351464","volume":"50","author":"KT Foerster","year":"2019","unstructured":"Foerster, K.T., Schmid, S.: Survey of reconfigurable data center networks: enablers, algorithms, complexity. SIGACT News 50(2), 62\u201379 (2019)","journal-title":"SIGACT News"},{"key":"513_CR17","doi-asserted-by":"crossref","unstructured":"Handley, M.: Using ground relays for low-latency wide-area routing in megaconstellations. In: HotNets, ACM (2019)","DOI":"10.1145\/3365609.3365859"},{"key":"513_CR18","doi-asserted-by":"crossref","unstructured":"Hauri, Y., Bhattacherjee, D., Grossmann, M., Singla, A.: \u201cInternet from space\u201d without inter-satellite links. In: HotNets, ACM (2020)","DOI":"10.1145\/3422604.3425938"},{"issue":"2","key":"513_CR19","first-page":"3","volume":"8","author":"I Kanj","year":"2017","unstructured":"Kanj, I., Perkovic, L., T\u00fcrkoglu, D.: Degree four plane spanners: simpler and better. J. Comput. Geom. 8(2), 3\u201331 (2017)","journal-title":"J. Comput. Geom."},{"key":"513_CR20","unstructured":"Kanj, I.A., Perkovic, L.: On geometric spanners of Euclidean and unit disk graphs. In: STACS (2008)"},{"issue":"1","key":"513_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"9","key":"513_CR22","first-page":"1765","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE JSAC 29(9), 1765\u20131775 (2011)","journal-title":"IEEE JSAC"},{"key":"513_CR23","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-45071-8_38","volume-title":"Computing and Combinatorics","author":"XY Li","year":"2003","unstructured":"Li, X.Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner. In: Warnow, T., Zhu, B. (eds.) Computing and Combinatorics, pp. 374\u2013384. Springer (2003)"},{"key":"513_CR24","unstructured":"Malkevitch, J.: AMS feature column: sales and chips. Accessed 19 January 2021 (2005)"},{"key":"513_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100621","volume":"41","author":"M Nance Hall","year":"2021","unstructured":"Nance Hall, M., Foerster, K.T., Schmid, S., Durairajan, R.: A survey of reconfigurable optical networks. Opt. Switch. Netw. 41, 100621 (2021)","journal-title":"Opt. Switch. Netw."},{"key":"513_CR26","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546884"},{"key":"513_CR27","doi-asserted-by":"crossref","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pi\u00f3ro, M., Tomaszewski, A.: Sndlib 1.0\u2014survivable network design library. Netw. Int. J. 55(3), 276\u2013286 (2010)","DOI":"10.1002\/net.20371"},{"issue":"3","key":"513_CR28","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The euclidean traveling salesman problem is np-complete. Theor. Comput. Sci. 4(3), 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"513_CR29","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1096536.1096551","volume":"35","author":"M Roughan","year":"2005","unstructured":"Roughan, M.: Simplifying the synthesis of internet traffic matrices. ACM SIGCOMM CCR 35(5), 93\u201396 (2005)","journal-title":"ACM SIGCOMM CCR"},{"issue":"4","key":"513_CR30","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1137\/110832458","volume":"42","author":"G Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620\u20131659 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-026-00513-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-026-00513-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-026-00513-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T07:28:21Z","timestamp":1790753301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-026-00513-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["513"],"URL":"https:\/\/doi.org\/10.1007\/s00446-026-00513-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"7 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"22"}}