{"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":1780783143002,"version":"3.54.1"},"publisher-location":"Cham","reference-count":30,"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_16","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:23Z","timestamp":1780780463000},"page":"220-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beer Path Problems in\u00a0Temporal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5612-0798","authenticated-orcid":false,"given":"Andrea","family":"D\u2019Ascenzo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9492-9894","authenticated-orcid":false,"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2999-0580","authenticated-orcid":false,"given":"Sotiris","family":"Kanellopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8659-7830","authenticated-orcid":false,"given":"Anna","family":"Mpanti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6220-3722","authenticated-orcid":false,"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8981-3676","authenticated-orcid":false,"given":"Christos","family":"Pergaminelis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/J.JCSS.2019.02.003","volume":"103","author":"EC Akrida","year":"2019","unstructured":"Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, L., Spirakis, P.G.: Temporal flows in temporal networks. J. Comput. Syst. Sci. 103, 46\u201360 (2019). https:\/\/doi.org\/10.1016\/J.JCSS.2019.02.003","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bacic, J., Mehrabi, S., Smid, M.: Shortest beer path queries in outerplanar graphs. Algorithmica 85(6), 1679\u20131705 (2022). https:\/\/doi.org\/10.1007\/s00453-022-01045-4","DOI":"10.1007\/s00453-022-01045-4"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bentert, M., Himmel, A., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1), 73 (2020)","DOI":"10.1007\/s41109-020-00311-0"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Straziota, A.: Graph spanners for group steiner distances. In: ESA 2024. LIPIcs, vol.\u00a0308, pp. 25:1\u201325:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2024.25","DOI":"10.4230\/LIPICS.ESA.2024.25"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Caro, D., Rodr\u00edguez, M.A., Brisaboa, N.R.: Data structures for temporal graphs based on compact sequence representations. Inf. Syst. 51, 1\u201326 (2015). https:\/\/doi.org\/10.1016\/J.IS.2015.02.002","DOI":"10.1016\/J.IS.2015.02.002"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Coudert, D., D\u2019Ascenzo, A., D\u2019Emidio, M.: Indexing graphs for shortest beer path queries. In: ATMOS 2024. OASIcs, vol.\u00a0123, pp. 2:1\u20132:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/OASICS.ATMOS.2024.2","DOI":"10.4230\/OASICS.ATMOS.2024.2"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Das, R., He, M., Kondratovsky, E., Munro, J.I., Naredla, A.M., Wu, K.: Shortest beer path queries in interval graphs. In: ISAAC, 2022. LIPIcs, vol.\u00a0248, pp. 59:1\u201359:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2022.59","DOI":"10.4230\/LIPICS.ISAAC.2022.59"},{"key":"16_CR8","unstructured":"D\u2019Ascenzo, A., Italiano, G.F., Kanellopoulos, S., Mpanti, A., Pagourtzis, A., Pergaminelis, C.: Beer path problems in temporal graphs. arXiv:2507.08685 (2025)"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. J. Comput. Syst. Sci. 119, 1\u201318 (2021). https:\/\/doi.org\/10.1016\/J.JCSS.2021.01.005","DOI":"10.1016\/J.JCSS.2021.01.005"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Gudmundsson, J., Sha, Y.: Shortest beer path queries in digraphs with bounded treewidth. In: ISAAC, 2023. LIPIcs, vol.\u00a0283, pp. 35:1\u201335:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2023.35","DOI":"10.4230\/LIPICS.ISAAC.2023.35"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Hanaka, T., Ono, H., Sadakane, K., Sugiyama, K.: Shortest beer path queries based on graph decomposition. In: ISAAC, 2023. LIPIcs, vol.\u00a0283, pp. 37:1\u201337:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2023.37","DOI":"10.4230\/LIPICS.ISAAC.2023.37"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88, 1\u201330 (2015)","DOI":"10.1140\/epjb\/e2015-60657-4"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13721-022-00406-x","volume":"12","author":"MM Hosseinzadeh","year":"2022","unstructured":"Hosseinzadeh, M.M., Cannataro, M., Guzzi, P.H., Dondi, R.: Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Netw. Model. Anal. Health Inf. Bioinf. 12(1), 10 (2022)","journal-title":"Netw. Model. Anal. Health Inf. Bioinf."},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Jain, A., Sahni, S.: Polynomial time algorithm for shortest paths in interval temporal graphs. Algorithms 17(10), 468 (2024). https:\/\/doi.org\/10.3390\/A17100468","DOI":"10.3390\/A17100468"},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. XXPhys. A 388(6), 1007\u20131023 (2009)","journal-title":"XXPhys. A"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: an integer programming approach. INFOR Inf. Syst. Oper. Rese. 21(1), 61\u201375 (1983)","DOI":"10.1080\/03155986.1983.11731885"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Lee, J.B., Nguyen, G., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Dynamic node embeddings from edge streams. IEEE Trans. Emerg. Top. Comput. Intell. 5(6), 931\u2013946 (2021). https:\/\/doi.org\/10.1109\/TETCI.2020.3011432","DOI":"10.1109\/TETCI.2020.3011432"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2019). https:\/\/doi.org\/10.1007\/S00453-018-0478-6","DOI":"10.1007\/S00453-018-0478-6"},{"key":"16_CR19","doi-asserted-by":"publisher","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","DOI":"10.1080\/15427951.2016.1177801"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2019). https:\/\/doi.org\/10.1007\/S00453-018-0478-6","DOI":"10.1007\/S00453-018-0478-6"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Naima, M.: Temporal betweenness centrality on shortest walks variants. Appl. Netw. Sci. 10(1), 11 (2025). https:\/\/doi.org\/10.1007\/S41109-024-00685-5","DOI":"10.1007\/S41109-024-00685-5"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Oettershagen, L., Kriege, N.M., Mutzel, P.: A higher-order temporal h-index for evolving networks. In: Proceedings of the 29th ACM SIGKDD, KDD 2023, pp. 1770\u20131782. ACM (2023). https:\/\/doi.org\/10.1145\/3580305.3599242","DOI":"10.1145\/3580305.3599242"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Oettershagen, L., Mutzel, P., Kriege, N.M.: Temporal walk centrality: ranking nodes in evolving networks. In: WWW \u201922, pp. 1640\u20131650. ACM (2022). https:\/\/doi.org\/10.1145\/3485447.3512210","DOI":"10.1145\/3485447.3512210"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Pop, P.C., Cosma, O., Sabo, C., Sitar, C.P.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314(3), 819\u2013835 (2024). https:\/\/doi.org\/10.1016\/J.EJOR.2023.07.022","DOI":"10.1016\/J.EJOR.2023.07.022"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp. 949\u2013960 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544888","DOI":"10.1109\/ICDE.2013.6544888"},{"issue":"2","key":"16_CR26","first-page":"97","volume":"7","author":"S Srivastava","year":"1969","unstructured":"Srivastava, S., Kumar, S., Garg, R., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS J. 7(2), 97 (1969)","journal-title":"CORS J."},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Wang, Y., Yuan, Y., Ma, Y., Wang, G.: Time-dependent graphs: Definitions, applications, and algorithms. Data Sci. Eng. 4(4), 352\u2013366 (2019). https:\/\/doi.org\/10.1007\/S41019-019-00105-0","DOI":"10.1007\/S41019-019-00105-0"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014). https:\/\/doi.org\/10.14778\/2732939.2732945","DOI":"10.14778\/2732939.2732945"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014). https:\/\/doi.org\/10.14778\/2732939.2732945","DOI":"10.14778\/2732939.2732945"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, T., et al.: Efficient exact and approximate betweenness centrality computation for temporal graphs. In: Proceedings of the ACM Web Conference 2024, pp. 2395\u20132406 (2024)","DOI":"10.1145\/3589334.3645438"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:26Z","timestamp":1780780466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_16","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"}}]}}