{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:44:40Z","timestamp":1754487880787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031220494"},{"type":"electronic","value":"9783031220500"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22050-0_3","type":"book-chapter","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:14:39Z","timestamp":1670847279000},"page":"31-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Blackout-Tolerant Temporal Spanners"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3169-4300","authenticated-orcid":false,"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0377-7037","authenticated-orcid":false,"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6976-5579","authenticated-orcid":false,"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8848-7006","authenticated-orcid":false,"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1862-0369","authenticated-orcid":false,"given":"Mirko","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"100253","DOI":"10.1016\/j.cosrev.2020.100253","volume":"37","author":"AR Ahmed","year":"2020","unstructured":"Ahmed, A.R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100253 (2020). https:\/\/doi.org\/10.1016\/j.cosrev.2020.100253","journal-title":"Comput. Sci. Rev."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Axiotis, K., Fotakis, D.: On the size and the approximability of minimum temporally connected subgraphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy. LIPIcs, vol. 55, pp. 149:1\u2013149:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.149","DOI":"10.4230\/LIPIcs.ICALP.2016.149"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Sparse temporal spanners with low stretch. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, 5\u20139 September 2022, Berlin\/Potsdam, Germany. LIPIcs, vol. 244, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.19","DOI":"10.4230\/LIPIcs.ESA.2022.19"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Sparse temporal spanners with low stretch. CoRR abs\/2206.11113 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.11113","DOI":"10.48550\/arXiv."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Calamai, M., Crescenzi, P., Marino, A.: On computing the diameter of (weighted) link streams. In: Coudert, D., Natale, E. (eds.) 19th International Symposium on Experimental Algorithms, SEA 2021, 7\u20139 June 2021, Nice, France. LIPIcs, vol. 190, pp. 11:1\u201311:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2021.11","DOI":"10.4230\/LIPIcs.SEA.2021.11"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121, 1\u201317 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.04.004,https:\/\/doi.org\/10.1016\/j.jcss.2021.04.004","DOI":"10.1016\/j.jcss.2021.04.004,"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp thresholds in random simple temporal graphs. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7\u201310 February 2022. pp. 319\u2013326. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00040","DOI":"10.1109\/FOCS52979.2021.00040"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"F\u00fcchsle, E., Molter, H., Niedermeier, R., Renken, M.: Delay-robust routes in temporal graphs. In: Berenbrink, P., Monmege, B. (eds.) 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 15\u201318 March 2022, Marseille, France (Virtual Conference). LIPIcs, vol. 219, pp. 30:1\u201330:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2022.30","DOI":"10.4230\/LIPIcs.STACS.2022.30"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"F\u00fcchsle, E., Molter, H., Niedermeier, R., Renken, M.: Temporal connectivity: Coping with foreseen and unforeseen delays. In: Aspnes, J., Michail, O. (eds.) 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, 28\u201330 March 2022, Virtual Conference. LIPIcs, vol. 221, pp. 17:1\u201317:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SAND.2022.17","DOI":"10.4230\/LIPIcs.SAND.2022.17"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7131-2_42","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"P Holme","year":"2018","unstructured":"Holme, P.: Temporal networks. In: Alhajj, R., Rokne, J.G. (eds.) Encyclopedia of Social Network Analysis and Mining, 2nd edn. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_42","edition":"2"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Huang, S., Fu, A.W., Liu, R.: Minimum spanning trees in temporal graphs. In: Sellis, T.K., Davidson, S.B., Ives, Z.G. (eds.) Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, 31 May - 4 June 2015, pp. 419\u2013430. ACM (2015). https:\/\/doi.org\/10.1145\/2723372.2723717","DOI":"10.1145\/2723372.2723717"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1829","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","volume":"81","author":"GB Mertzios","year":"2018","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0478-6","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016). https:\/\/doi.org\/10.1080\/15427951.2016.1177801","journal-title":"Internet Math."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. In: Proceedings of the VLDB Endow, vol. 7, no. 9, pp. 721\u2013732 (2014). https:\/\/doi.org\/10.14778\/2732939.2732945","DOI":"10.14778\/2732939.2732945"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22050-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:15:11Z","timestamp":1670847311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22050-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220494","9783031220500"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22050-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Wireless Sensor Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","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":"10","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":"48% - 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.2","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":"2.9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}