{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:27Z","timestamp":1742913267420,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_2","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Temporal Explorer Who Returns to the Base"],"prefix":"10.1007","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 29\u201341 (2014)","DOI":"10.1007\/978-3-319-12340-0_3"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s00224-017-9757-x","volume":"61","author":"EC Akrida","year":"2017","unstructured":"Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3), 907\u2013944 (2017)","journal-title":"Theory Comput. Syst."},{"key":"2_CR3","unstructured":"Akrida, E.C., Mertzios, G., Spirakis, P.G., Zamaraev, V.: Temporal vertex covers and sliding time windows. In: International Colloquium on Automata, Languages and Programming (ICALP) (2018)"},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-22849-5_2","volume-title":"Database and Expert Systems Applications","author":"S Biswas","year":"2015","unstructured":"Biswas, S., Ganguly, A., Shah, R.: Restricted shortest path in temporal graphs. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9261, pp. 13\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22849-5_2"},{"key":"2_CR6","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: On exploring temporal graphs of small pathwidth. CoRR, abs\/1807.11869 (2018)"},{"key":"2_CR7","unstructured":"Casteigts, A., Flocchini, P.: Deterministic algorithms in dynamic networks: formal models and metrics. Technical report, Defence R&D Canada, April 2013"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.-H.H., Ning, L.: Fast convergence for consensus in dynamic networks. ACM Trans. Algorithms 10, 15-1 (2014)","DOI":"10.1145\/2601072"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/moor.1060.0218","volume":"31","author":"J Chuzhoy","year":"2006","unstructured":"Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. Math. Oper. Res. 31, 730\u2013738 (2006)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1137\/090756053","volume":"24","author":"AEF Clementi","year":"2010","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time of edge-Markovian evolving graphs. SIAM J. Discrete Math. (SIDMA) 24(4), 1694\u20131712 (2010)","journal-title":"SIAM J. Discrete Math. (SIDMA)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2006.11.006","volume":"171","author":"C Demetrescu","year":"2007","unstructured":"Demetrescu, C., Italiano, G.F.: Algorithmic techniques for maintaining shortest routes in dynamic networks. Electron. Notes Theor. Comput. Sci. 171, 3\u201315 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR12","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"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"A-S Himmel","year":"2017","unstructured":"Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1), 35:1\u201335:16 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"key":"2_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":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: ACM Symposium on Theory of Computing (STOC), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"2_CR16","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley Longman, Boston (2005)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_57"},{"key":"2_CR18","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)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Upper Saddle River (1982)"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"FCR Spieksma","year":"1999","unstructured":"Spieksma, F.C.R.: On the approximability of an interval scheduling problem. J. Sched. 2, 215\u2013227 (1999)","journal-title":"J. Sched."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.entcs.2003.12.023","volume":"92","author":"D Wagner","year":"2004","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.D.: Dynamic shortest paths containers. Electron. Notes Theor. Comput. Sci. 92, 65\u201384 (2004)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Zhuang, H., Sun, Y., Tang, J., Zhang, J., Sun, X.: Influence maximization in dynamic social networks. In: International Conference on Data Mining (2013)","DOI":"10.1109\/ICDM.2013.145"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:09Z","timestamp":1710347229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"30","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":"32% - 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":"14","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)"}}]}}