{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:09:34Z","timestamp":1764785374944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606021"},{"type":"electronic","value":"9783031606038"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_31","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"513-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4956-255X","authenticated-orcid":false,"given":"Erik","family":"van den Akker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7877","authenticated-orcid":false,"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4635-4480","authenticated-orcid":false,"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"van\u00a0den Akker, E., Buchin, K., Foerster, K.: Multi-agent online graph exploration on cycles and tadpole graphs. CoRR abs\/2402.13845 (2024)","key":"31_CR1","DOI":"10.1007\/978-3-031-60603-8_31"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.tcs.2020.06.007","volume":"839","author":"S Brandt","year":"2020","unstructured":"Brandt, S., Foerster, K., Maurer, J., Wattenhofer, R.: Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs. Theor. Comput. Sci. 839, 176\u2013185 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ic.2014.12.005","volume":"243","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Disser, Y., Kosowski, A., Pajak, D., Uznanski, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37\u201349 (2015)","journal-title":"Inf. Comput."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2018.03.006","volume":"811","author":"Y Disser","year":"2020","unstructured":"Disser, Y., Mousset, F., Noever, A., Skoric, N., Steger, A.: A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811, 70\u201378 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol. 3894, pp. 341\u2013351. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682127_24"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72951-8_5","volume-title":"Structural Information and Communication Complexity","author":"M Dynia","year":"2007","unstructured":"Dynia, M., \u0141opusza\u0144ski, J., Schindelhauer, C.: Why robots need maps. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 41\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72951-8_5"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2015.11.017","volume":"655","author":"K Foerster","year":"2016","unstructured":"Foerster, K., Wattenhofer, R.: Lower and upper competitive bounds for online directed graph exploration. Theor. Comput. Sci. 655, 15\u201329 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"31_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106096","volume":"168","author":"R Fritsch","year":"2021","unstructured":"Fritsch, R.: Online graph exploration on trees, unicyclic graphs and cactus graphs. Inf. Process. Lett. 168, 106096 (2021)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s10878-012-9571-y","volume":"28","author":"Y Higashikawa","year":"2014","unstructured":"Higashikawa, Y., Katoh, N., Langerman, S., Tanigawa, S.: Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28(2), 480\u2013495 (2014)","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Ortolf, C., Schindelhauer, C.: Online multi-robot exploration of grid graphs with rectangular obstacles. In: SPAA 2012, pp. 27\u201336. ACM (2012)","key":"31_CR11","DOI":"10.1145\/2312005.2312010"}],"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-031-60603-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:51:58Z","timestamp":1732038718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","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":"Vietri sul Mare","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}