{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:17Z","timestamp":1758586217050,"version":"3.44.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-04700-7_7","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:30Z","timestamp":1758498330000},"page":"82-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Restless Temporal Path"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5444-8877","authenticated-orcid":false,"given":"Justine","family":"Cauvi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3657-6979","authenticated-orcid":false,"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2021.04.001","volume":"120","author":"EC Akrida","year":"2021","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Raptopoulos, C.: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120, 179\u2013193 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.04.001","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Zamaraev, V.: Temporal vertex cover with a sliding time window. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0107, pp. 1\u201314. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.148","DOI":"10.4230\/LIPIcs.ICALP.2018.148"},{"key":"7_CR3","unstructured":"Barab\u00e1si, A.: Network Science. Cambridge University Press (2016)"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/S41109-020-00311-0","volume":"5","author":"M Bentert","year":"2020","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). https:\/\/doi.org\/10.1007\/S41109-020-00311-0","journal-title":"Appl. Netw. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Xuan, B. B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14 (2011). https:\/\/doi.org\/10.1142\/S0129054103001728","DOI":"10.1142\/S0129054103001728"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s00453-022-01018-7","volume":"85","author":"BM Bumpus","year":"2022","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. Algorithmica 85(3), 688\u2013716 (2022). https:\/\/doi.org\/10.1007\/s00453-022-01018-7","journal-title":"Algorithmica"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks, vol.\u00a027 (2010). https:\/\/doi.org\/10.1007\/978-3-642-22450-8_27","DOI":"10.1007\/978-3-642-22450-8_27"},{"issue":"9","key":"7_CR8","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). https:\/\/doi.org\/10.1007\/s00453-021-00831-w","journal-title":"Algorithmica"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0132, pp. 1\u201314. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.134","DOI":"10.4230\/LIPIcs.ICALP.2019.134"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Christodoulou, F., Crescenzi, P., Marino, A., Silva, A., Thilikos, D.M.: Making the interval membership width of temporal graphs connected and bidirectional. In: Rescigno, A.A., Vaccaro, U. (eds.) Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, 1\u20133 July 2024, Proceedings. Lecture Notes in Computer Science, vol. 14764, pp. 247\u2013258. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-63021-7_19","DOI":"10.1007\/978-3-031-63021-7_19"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Enright, J., Meeks, K., Molter, H.: Counting temporal paths. In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0254, pp. 30:1\u201330:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2023.30","DOI":"10.4230\/LIPIcs.STACS.2023.30"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Haag, R., Molter, H., Niedermeier, R., Renken, M.: Feedback edge sets in temporal graphs. Discrete Appl. Math. 307, 65\u201378 (2022). https:\/\/doi.org\/10.1016\/j.dam.2021.09.029","DOI":"10.1016\/j.dam.2021.09.029"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Hand, S.D., Enright, J., Meeks, K.: Making life more confusing for firefighters. In: 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0226, pp. 1\u201315. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2022.15","DOI":"10.4230\/LIPIcs.FUN.2022.15"},{"issue":"9","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9), 1\u201330 (2015). https:\/\/doi.org\/10.1140\/epjb\/e2015-60657-4","journal-title":"Eur. Phys. J. B"},{"issue":"4","key":"7_CR15","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). https:\/\/doi.org\/10.1006\/jcss.2002.1829","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Kermack, W.O., McKendrick, A.G.: A contribution to the mathematical theory of epidemics. Proc. Roy. Soc. Lond. Ser. A, Containing Pap. Math. Phys. Charact. 115(772), 700\u2013721 (1927). https:\/\/doi.org\/10.1098\/rspa.1927.0118","DOI":"10.1098\/rspa.1927.0118"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 1\u201329 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0537-7","journal-title":"Soc. Netw. Anal. Min."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2023.04.005","volume":"137","author":"GB Mertzios","year":"2023","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137, 1\u201319 (2023). https:\/\/doi.org\/10.1016\/j.jcss.2023.04.005","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12 (2015). https:\/\/doi.org\/10.1007\/978-3-319-24024-4_18","DOI":"10.1007\/978-3-319-24024-4_18"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theoret. Comput. Sci. 634, 1\u201323 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.04.006","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR21","unstructured":"Newman, M.: Networks. OUP Oxford (2018)"},{"key":"7_CR22","unstructured":"Orda, A., Rom, R.: Traveling without waiting in time-dependent networks is NP-hard. Tech. rep., Technion - Israel Institute of Technology, Haifa, Israel 32000 (1989)"},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987). https:\/\/doi.org\/10.1137\/0216062","journal-title":"SIAM J. Comput."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Thejaswi, S., Lauri, J., Gionis, A.: Restless reachability problems in temporal graphs (2025). https:\/\/doi.org\/10.1007\/s10115-025-02405-6","DOI":"10.1007\/s10115-025-02405-6"},{"issue":"11","key":"7_CR25","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","volume":"28","author":"H Wu","year":"2016","unstructured":"Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927\u20132942 (2016). https:\/\/doi.org\/10.1109\/TKDE.2016.2594065","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Zschoche, P.: Restless temporal path parameterized above lower bounds. In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0254, pp. 1\u201316. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2023.55","DOI":"10.4230\/LIPIcs.STACS.2023.55"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:32Z","timestamp":1758498332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}