{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T11:24:55Z","timestamp":1746703495014,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_8","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"129-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-strict Temporal Exploration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4470-5868","authenticated-orcid":false,"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3816-6308","authenticated-orcid":false,"given":"Jakob T.","family":"Spooner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-17402-6_2","volume-title":"Algorithms and Complexity","author":"EC Akrida","year":"2019","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G.: The temporal explorer who returns to the base. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 13\u201324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_2"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2018.10.016","volume":"142","author":"HL Bodlaender","year":"2019","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142, 68\u201371 (2019). https:\/\/doi.org\/10.1016\/j.ipl.2018.10.016","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-004-1088-z","volume":"39","author":"B Brod\u00e9n","year":"2004","unstructured":"Brod\u00e9n, B., Hammar, M., Nilsson, B.J.: Online and offline algorithms for the time-dependent TSP with time zones. Algorithmica 39(4), 299\u2013319 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1088-z","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR4","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(2), 267\u2013285 (2003). https:\/\/doi.org\/10.1142\/S0129054103001728","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"8_CR5","first-page":"387","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387\u2013408 (2012)","journal-title":"IJPEDS"},{"key":"8_CR6","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: The computational complexity of finding temporal paths under waiting time constraints. CoRR abs\/1909.06437 (2019). https:\/\/arxiv.org\/abs\/1909.06437"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Di Luna, G.A., Dobrev, S., Flocchini, P., Santoro, N.: Live exploration of dynamic rings. In: 36th IEEE International Conference on Distributed Computing Systems (ICDCS 2016), pp. 570\u2013579. IEEE (2016). https:\/\/doi.org\/10.1109\/ICDCS.2016.59","DOI":"10.1109\/ICDCS.2016.59"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-47672-7_36","volume-title":"Automata, Languages, and Programming","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 444\u2013455. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_36"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Kammer, F., Luo, K., Sajenko, A., Spooner, J.T.: Two moves per time step make a difference. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). LIPIcs, vol. 132, pp. 141:1\u2013141:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.141","DOI":"10.4230\/LIPIcs.ICALP.2019.141"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Spooner, J.T.: Faster exploration of degree-bounded temporal graphs. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). LIPIcs, vol. 117, pp. 36:1\u201336:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.36","DOI":"10.4230\/LIPIcs.MFCS.2018.36"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2012.10.029","volume":"469","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci. 469, 53\u201368 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.029","journal-title":"Theor. Comput. Sci."},{"key":"8_CR12","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. Theor. Comput. Sci. 806, 197\u2013218 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.031","journal-title":"Theor. Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Gotoh, T., Flocchini, P., Masuzawa, T., Santoro, N.: Tight bounds on distributed exploration of temporal graphs. In: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). LIPIcs, vol. 153, pp. 22:1\u201322:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2019.22","DOI":"10.4230\/LIPIcs.OPODIS.2019.22"},{"key":"8_CR14","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"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-03578-9_2","volume-title":"Structural Information and Communication Complexity","author":"D Ilcinkas","year":"2013","unstructured":"Ilcinkas, D., Wade, A.M.: Exploration of the T-interval-connected dynamic graphs: the case of the ring. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 13\u201323. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03578-9_2"},{"issue":"4","key":"8_CR16","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.M., 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."},{"issue":"4","key":"8_CR17","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). https:\/\/doi.org\/10.1080\/15427951.2016.1177801","journal-title":"Internet Math."},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1016\/j.jpdc.2013.07.007","volume":"74","author":"O Michail","year":"2014","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distrib. Comput. 74(1), 2016\u20132026 (2014). https:\/\/doi.org\/10.1016\/j.jpdc.2013.07.007","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR19","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. Theor. Comput. Sci. 634, 1\u201323 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.04.006","journal-title":"Theor. Comput. Sci."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jnca.2016.01.002","volume":"67","author":"CC Sobin","year":"2016","unstructured":"Sobin, C.C., Raychoudhury, V., Marfia, G., Singla, A.: A survey of routing and data dissemination in delay tolerant networks. J. Netw. Comput. Appl. 67, 128\u2013146 (2016). https:\/\/doi.org\/10.1016\/j.jnca.2016.01.002","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discr. Appl. Math. 8(1), 85\u201389 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90081-7","journal-title":"Discr. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:41:33Z","timestamp":1619232093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}