{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:50:29Z","timestamp":1764557429394,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T00:00:00Z","timestamp":1499990400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-BS02-014"],"award-info":[{"award-number":["ANR-11-BS02-014"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-13-JS02-002"],"award-info":[{"award-number":["ANR-13-JS02-002"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00224-017-9796-3","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T03:19:47Z","timestamp":1500002387000},"page":"1144-1160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring"],"prefix":"10.1007","volume":"62","author":[{"given":"David","family":"Ilcinkas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5920-8402","authenticated-orcid":false,"given":"Ahmed M.","family":"Wade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"9796_CR1","first-page":"29","volume-title":"40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 8147","author":"E Aaron","year":"2014","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 8147, pp 29\u201341 (2014)"},{"key":"9796_CR2","first-page":"22","volume-title":"10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), LNCS 8847","author":"E Aaron","year":"2014","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: Multi-Robot Foremost Coverage of Time-Varying Graphs 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), LNCS 8847, pp 22\u201338 (2014)"},{"key":"9796_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-319-49259-9_5","volume-title":"18th International Symposium on Stabilization, Safety, and security of distributed systems (SSS 2016), LNCS 10083","author":"M Bournat","year":"2016","unstructured":"Bournat, M., Datta, A.K. , Dubois, S. : Self-Stabilizing Robots in Highly Dynamic Environments 18th International Symposium on Stabilization, Safety, and security of distributed systems (SSS 2016), LNCS 10083, pp 54\u201369 (2016)"},{"key":"9796_CR4","doi-asserted-by":"crossref","unstructured":"Casteigts, A. , Flocchini, P. , Quattrociocchi, W. , Santoro, N. : Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst., 27(5) (2012)","DOI":"10.1080\/17445760.2012.668546"},{"key":"9796_CR5","first-page":"570","volume-title":"IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","author":"GA Di Luna","year":"2016","unstructured":"Di Luna, G.A., Dobrev, S., Flocchini, P., Santoro, N.: Live exploration of dynamic rings IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp 570\u2013579 (2016)"},{"key":"9796_CR6","first-page":"444","volume-title":"42nd International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 9134","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On Temporal Graph Exploration 42nd International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 9134, pp 444\u2013455 (2015)"},{"issue":"5","key":"9796_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for MANETs. Network, IEEE 18(5), 24\u201329 (2004)","journal-title":"Network, IEEE"},{"issue":"1","key":"9796_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s00224-011-9341-8","volume":"50","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Searching for black holes in subways. Theory of Computing Systems 50(1), 158\u2013184 (2012)","journal-title":"Theory of Computing Systems"},{"key":"9796_CR9","first-page":"154","volume-title":"6th International Conference on Fun with Algorithms (FUN), LNCS 7288","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Finding Good Coffee in Paris 6th International Conference on Fun with Algorithms (FUN), LNCS 7288, pp 154\u2013165 (2012)"},{"key":"9796_CR10","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."},{"key":"9796_CR11","first-page":"250","volume-title":"21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 8576","author":"D Ilcinkas","year":"2014","unstructured":"Ilcinkas, D., Klasing, R., Wade, A.M.: Exploration of Constantly Connected Dynamic Graphs Based on Cactuses 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 8576, pp 250\u2013262 (2014)"},{"key":"9796_CR12","first-page":"451","volume-title":"15th International Conference On Principles Of Distributed Systems (OPODIS), LNCS 7109","author":"D Ilcinkas","year":"2011","unstructured":"Ilcinkas, D., Wade, A.M.: On the Power of Waiting when Exploring Public Transportation Systems 15th International Conference On Principles Of Distributed Systems (OPODIS), LNCS 7109, pp 451\u2013464 (2011)"},{"key":"9796_CR13","first-page":"13","volume-title":"20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 8179","author":"D Ilcinkas","year":"2013","unstructured":"Ilcinkas, D., Wade, A.M.: Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 8179, pp 13\u201323 (2013)"},{"key":"9796_CR14","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/1806689.1806760","volume-title":"42nd ACM symposium on Theory of computing (STOC)","author":"F Kuhn","year":"2010","unstructured":"Kuhn, F., Lynch, N. A., Oshman, R.: Distributed computation in dynamic networks 42nd ACM symposium on Theory of computing (STOC), pp 513\u2013522 (2010)"},{"issue":"1","key":"9796_CR15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. ACM SIGACT News 42(1), 82\u201396 (2011)","journal-title":"ACM SIGACT News"},{"issue":"4","key":"9796_CR16","doi-asserted-by":"crossref","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."},{"issue":"1","key":"9796_CR17","doi-asserted-by":"crossref","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)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9796_CR18","doi-asserted-by":"crossref","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":"9796_CR19","unstructured":"Shannon, C.E.: Presentation of a maze-solving machine. 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), 173\u2013180 (1951)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9796-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9796-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9796-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T01:49:28Z","timestamp":1525139368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9796-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,14]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9796"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9796-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,7,14]]}}}