{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:11:41Z","timestamp":1768648301645,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031210167","type":"print"},{"value":"9783031210174","type":"electronic"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21017-4_1","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Casteigts","sequence":"first","affiliation":[]},{"given":"Timoth\u00e9e","family":"Corsini","sequence":"additional","affiliation":[]},{"given":"Writika","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, \u0141., Spirakis, P.G.: Temporal flows in temporal networks. J. Comput. Syst. Sci. 103, 46\u201360 (2019)","DOI":"10.1016\/j.jcss.2019.02.003"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s00224-017-9757-x","volume":"61","author":"EC Akrida","year":"2017","unstructured":"Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3), 907\u2013944 (2017)","journal-title":"Theory Comput. Syst."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Altisen, K., Devismes, S., Durand, A., Johnen, C., Petit, F.: On implementing stabilizing leader election with weak assumptions on network dynamics. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 21\u201331 (2021)","DOI":"10.1145\/3465084.3467917"},{"key":"1_CR4","unstructured":"Axiotis, K., Fotakis, D.: On the size and the approximability of minimum temporally connected subgraphs. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 149:1\u2013149:14 (2016)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00446-011-0133-9","volume":"24","author":"H Baumann","year":"2011","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31\u201344 (2011)","journal-title":"Distrib. Comput."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-39611-6_23","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"S Bhadra","year":"2003","unstructured":"Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 259\u2013270. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39611-6_23"},{"key":"1_CR7","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Sparse temporal spanners with low stretch. arXiv preprint arXiv:2206.11113 (2022)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-21741-3_3","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"Q Bramas","year":"2015","unstructured":"Bramas, Q., Tixeuil, S.: The complexity of data aggregation in static and dynamic wireless sensor networks. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 36\u201350. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21741-3_3"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-021-00851-y","volume":"12","author":"LFA Brito","year":"2022","unstructured":"Brito, L.F.A., Albertini, M.K., Casteigts, A., Traven\u00e7olo, B.A.N.: A dynamic data structure for temporal reachability with unsorted contact insertions. Soc. Netw. Anal. Min. 12(1), 1\u201312 (2022)","journal-title":"Soc. Netw. Anal. Min."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"106086","DOI":"10.1016\/j.ipl.2020.106086","volume":"168","author":"F Brunelli","year":"2021","unstructured":"Brunelli, F., Crescenzi, P., Viennot, L.: On computing pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168, 106086 (2021)","journal-title":"Inf. Process. Lett."},{"issue":"02","key":"1_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(02), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0602002","volume":"2","author":"RT Bumby","year":"1979","unstructured":"Bumby, R.T.: A problem with telephones. SIAM J. Algebraic Discrete Methods 2(1), 13\u201318 (1979)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"5","key":"1_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"9","key":"1_CR14","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A.-S., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.004","volume":"121","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121, 1\u201317 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp thresholds in random simple temporal graphs. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 319\u2013326. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00040"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.4153\/CMB-1971-028-8","volume":"14","author":"V Chv\u00e1tal","year":"1971","unstructured":"Chv\u00e1tal, V., Koml\u00f3s, J.: Some combinatorial theorems on monotonicity. Can. Math. Bull. 14(2), 151\u2013157 (1971)","journal-title":"Can. Math. Bull."},{"key":"1_CR18","unstructured":"Conte, A., Crescenzi, P., Marino, A., Punzi, G.: Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00446-018-0339-1","volume":"33","author":"G Di Luna","year":"2020","unstructured":"Di Luna, G., Dobrev, S., Flocchini, P., Santoro, N.: Distributed exploration of dynamic rings. Distrib. Comput. 33(1), 41\u201367 (2020)","journal-title":"Distrib. Comput."},{"key":"1_CR20","unstructured":"Enright, J., Meeks, K., Mertzios, G.B., Zamaraev, V.: Deleting edges to restrict the size of an epidemic in temporal networks. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Enright, J., Meeks, K., Molter, H.: Counting temporal paths. arXiv preprint arXiv:2202.12055 (2022)","DOI":"10.21203\/rs.3.rs-3181661\/v1"},{"key":"1_CR22","unstructured":"Erlebach, T., Spooner, J.T.: Parameterized temporal exploration problems. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2019.03.031","volume":"806","author":"T Fluschnik","year":"2020","unstructured":"Fluschnik, T., Molter, H., Niedermeier, R., Renken, M., Zschoche, P.: Temporal graph classes: a view through temporal separators. Theoret. Comput. Sci. 806, 197\u2013218 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-48096-0_26","volume-title":"Euro-Par 2015: Parallel Processing","author":"C G\u00f3mez-Calzado","year":"2015","unstructured":"G\u00f3mez-Calzado, C., Casteigts, A., Lafuente, A., Larrea, M.: A connectivity model for agreement in dynamic systems. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 333\u2013345. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_26"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-09620-9_20","volume-title":"Structural Information and Communication Complexity","author":"D Ilcinkas","year":"2014","unstructured":"Ilcinkas, D., Klasing, R., Wade, A.M.: Exploration of constantly connected dynamic graphs based on cactuses. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 250\u2013262. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09620-9_20"},{"issue":"4","key":"1_CR26","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., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21(3), 295\u2013319 (1991)","journal-title":"Networks"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Rannou, L., Magnien, C., Latapy, M.: Strongly connected components in stream graphs: computation and experimentations. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) COMPLEX NETWORKS 2020. SCI, vol. 943, pp. 568\u2013580. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-65347-7_47"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2019.12.012","volume":"296","author":"M Vernet","year":"2021","unstructured":"Vernet, M., Drozdowski, M., Pign\u00e9, Y., Sanlaville, E.: A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. Discret. Appl. Math. 296, 203\u2013216 (2021)","journal-title":"Discret. Appl. Math."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Whitbeck, J., de Amorim, M.D., Conan, V., Guillaume, J.-L.: Temporal reachability graphs. In: Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, pp. 377\u2013388 (2012)","DOI":"10.1145\/2348543.2348589"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21017-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T12:38:09Z","timestamp":1701347889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}