{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:46:03Z","timestamp":1768434363043,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091192","type":"print"},{"value":"9783032091208","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"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-09120-8_8","type":"book-chapter","created":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:10Z","timestamp":1763466730000},"page":"104-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal Cycle Detection and\u00a0Acyclic Temporalizations"],"prefix":"10.1007","author":[{"given":"Davi","family":"de Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00falio","family":"Ara\u00fajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allen","family":"Ibiapina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Schoeters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"8_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.L.: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120, 179\u2013193 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/J.TCS.2022.06.023","volume":"928","author":"J Bang-Jensen","year":"2022","unstructured":"Bang-Jensen, J., Bessy, S., Gon\u00e7alves, D., Picasarri-Arrieta, L.: Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928, 167\u2013182 (2022). https:\/\/doi.org\/10.1016\/J.TCS.2022.06.023","journal-title":"Theor. Comput. Sci."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bartlang, U.: Architecture and Methods for Flexible Content Management in Peer-to-Peer Systems. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-8348-9645-2","DOI":"10.1007\/978-3-8348-9645-2"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2012.06.015","volume":"504","author":"JC Bermond","year":"2013","unstructured":"Bermond, J.C., Cosnard, M., P\u00e9rennes, S.: Directed acyclic graphs with the unique dipath property. Theoret. Comput. Sci. 504, 5\u201311 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s00453-022-01018-7","volume":"85","author":"BM Bumpus","year":"2023","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. Algorithmica 85(3), 688\u2013716 (2023)","journal-title":"Algorithmica"},{"key":"8_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press (2022)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.01.005","volume":"119","author":"T Erlebach","year":"2021","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. J. Comput. Syst. Sci. 119, 1\u201318 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2023.01.003","volume":"135","author":"T Erlebach","year":"2023","unstructured":"Erlebach, T., Spooner, J.T.: Parameterised temporal exploration problems. J. Comput. Syst. Sci. 135, 73\u201388 (2023)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2013.10.038","volume":"168","author":"R Ganian","year":"2014","unstructured":"Ganian, R., Hlin\u011bn\u1ef3, P., Kneis, J., Langer, A., Obdr\u017e\u00e1lek, J., Rossmanith, P.: On digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168, 88\u2013107 (2014)","journal-title":"Discret. Appl. Math."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/J.DAM.2021.09.029","volume":"307","author":"R Haag","year":"2022","unstructured":"Haag, R., Molter, H., Niedermeier, R., Renken, M.: Feedback edge sets in temporal graphs. Discret. Appl. Math. 307, 65\u201378 (2022). https:\/\/doi.org\/10.1016\/J.DAM.2021.09.029","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"8_CR12","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":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory Ser. B 82(1), 138\u2013154 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., Spirakis, P.G.: The Complexity of Computing Optimum Labelings for Temporal Connectivity. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0241, pp. 62:1\u201362:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.62","DOI":"10.4230\/LIPIcs.MFCS.2022.62"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., Spirakis, P.G.: Temporal Graph Realization from Fastest Paths. In: Casteigts, A., Kuhn, F. (eds.) 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0292, pp. 16:1\u201316:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SAND.2024.16","DOI":"10.4230\/LIPIcs.SAND.2024.16"},{"issue":"1","key":"8_CR16","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."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00453-022-01021-y","volume":"85","author":"A Marino","year":"2023","unstructured":"Marino, A., Silva, A.: Eulerian walks in temporal graphs. Algorithmica 85(3), 805\u2013830 (2023)","journal-title":"Algorithmica"},{"key":"8_CR18","unstructured":"Mertzios, G.B., Molter, H., Spirakis, P.G.: Realizing temporal transportation trees (2024). https:\/\/arxiv.org\/abs\/2403.18513"},{"issue":"4","key":"8_CR19","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":"8_CR20","doi-asserted-by":"publisher","unstructured":"Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., Latora, V.: Graph metrics for temporal networks. In: Temporal networks, pp. 15\u201340. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-36461-7_2","DOI":"10.1007\/978-3-642-36461-7_2"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Sapatnekar, S.: Timing. Springer (2004). https:\/\/doi.org\/10.1007\/b117318","DOI":"10.1007\/b117318"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Shmulevich, I., Dougherty, E.R.: Probabilistic Boolean networks: the modeling and control of gene regulatory networks. SIAM (2010)","DOI":"10.1137\/1.9780898717631"},{"issue":"9","key":"8_CR23","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","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)","journal-title":"Proc. VLDB Endow."},{"issue":"02","key":"8_CR24","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","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09120-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:14Z","timestamp":1763466734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09120-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"ISBN":["9783032091192","9783032091208"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09120-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"19 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","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":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}