{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:03Z","timestamp":1780783143014,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_15","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:48Z","timestamp":1780780428000},"page":"204-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumerating Spanners in\u00a0Directed Temporal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4605-8473","authenticated-orcid":false,"given":"Lapo","family":"Cioni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9854-7885","authenticated-orcid":false,"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7257-5426","authenticated-orcid":false,"given":"Jason","family":"Schoeters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7274-279X","authenticated-orcid":false,"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"100253","DOI":"10.1016\/j.cosrev.2020.100253","volume":"37","author":"R Ahmed","year":"2020","unstructured":"Ahmed, R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100253 (2020)","journal-title":"Comput. Sci. Rev."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Akrida, E.C., G\u0105sieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3) (2017)","DOI":"10.1007\/s00224-017-9757-x"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, pp. 98\u2013104 (1991)","DOI":"10.1145\/109648.109659"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1), 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"key":"15_CR5","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 2016) (2016)"},{"key":"15_CR6","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Sparse temporal spanners with low stretch. In: 30th Annual European Symposium on Algorithms (ESA 2022) (2022)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"103495","DOI":"10.1016\/j.jcss.2023.103495","volume":"141","author":"D Bil\u00f2","year":"2024","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141, 103495 (2024)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., Rudolf, G.: Generating minimal k-vertex connected spanning subgraphs. In: Computing and Combinatorics, pp. 222\u2013231 (2007)","DOI":"10.1007\/978-3-540-73545-8_23"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"103596","DOI":"10.1016\/j.jcss.2024.103596","volume":"148","author":"D Bubboloni","year":"2025","unstructured":"Bubboloni, D., Catalano, C., Marino, A., Silva, A.: On computing optimal temporal branchings and spanning subgraphs. J. Comput. Syst. Sci. 148, 103596 (2025)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Corsini, T.: In search of the lost tree: hardness and relaxation of spanning trees in temporal graphs. In: International Colloquium on Structural Information and Communication Complexity, pp. 138\u2013155 (2024)","DOI":"10.1007\/978-3-031-60603-8_8"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"114434","DOI":"10.1016\/j.tcs.2024.114434","volume":"991","author":"A Casteigts","year":"2024","unstructured":"Casteigts, A., Corsini, T., Sarkar, W.: Simple, strict, proper, happy: a study of reachability in temporal graphs. Theoret. Comput. Sci. 991, 114434 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","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":"15_CR13","unstructured":"Conte, A., Kurita, K., Marino, A., Punzi, G., Uno, T., Wasa, K.: Designing output sensitive algorithms for subgraph enumeration. In: From Strings to Graphs, and Back Again. OASIcs, vol.\u00a0132, pp. 19:1\u201319:40 (2025)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. 156(11), 2035\u20132049 (2008), in Memory of Leonid Khachiyan (1952 - 2005 )","DOI":"10.1016\/j.dam.2007.04.017"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.09.027","volume":"767","author":"K Elbassioni","year":"2019","unstructured":"Elbassioni, K., Rauf, I., Ray, S.: A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theoret. Comput. Sci. 767, 26\u201333 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second annual ACM Symposium on Theory of Computing, pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.dam.2006.04.032","volume":"155","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155(2), 137\u2013149 (2007)","journal-title":"Discret. Appl. Math."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Linear-delay enumeration for minimal steiner problems. In: PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, June 12\u201317, 2022, pp. 301\u2013313. ACM (2022)","DOI":"10.1145\/3517804.3524148"},{"key":"15_CR19","unstructured":"Kurita, K., Marino, A., Schoeters, J., Uno, T.: Spanner enumeration for temporal graphs. In: 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9\u201311, 2025. LIPIcs, vol.\u00a0330, pp. 9:1\u20139:21 (2025)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Mary, A., Strozecki, Y.: Efficient enumeration of solutions produced by closure operations. Discret. Math. Theor. Comput. Sci. 21(3) (2019)","DOI":"10.23638\/DMTCS-21-3-22"},{"issue":"4","key":"15_CR21","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)","journal-title":"Internet Math."},{"key":"15_CR22","unstructured":"Strozecki, Y.: Enumeration complexity. Bull. EATCS 129 (2019)"},{"issue":"02","key":"15_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan, B.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."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:50Z","timestamp":1780780430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}