{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:50:06Z","timestamp":1775260206225,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030013240","type":"print"},{"value":"9783030013257","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01325-7_17","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:43:05Z","timestamp":1540906985000},"page":"165-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Explorable Families of Graphs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29, 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1979), pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152, 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1006\/jagm.1994.1039","volume":"17","author":"E Bar-Eli","year":"1994","unstructured":"Bar-Eli, E., Berman, P., Fiat, A., Yan, R.: On-line navigation in a room. J. Algorithms 17, 319\u2013341 (1994)","journal-title":"J. Algorithms"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: exploring and mapping directed graphs. Inf. Comput. 176, 1\u201321 (2002)","journal-title":"Inf. Comput."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1022803514157","volume":"18","author":"M Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Mach. Learn. 18, 231\u2013254 (1995)","journal-title":"Mach. Learn."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26, 110\u2013137 (1997)","journal-title":"SIAM J. Comput."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-17653-1_10","volume-title":"Principles of Distributed Systems","author":"J Chalopin","year":"2010","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 119\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17653-1_10"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment I: the rectilinear case. J. ACM 45, 215\u2013245 (1998)","journal-title":"J. ACM"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. J. Algorithms 51, 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Kobourov, S.G., Anil Kumar, V.S.: Optimal constrained graph exploration. ACM Trans. Algorithms 2, 380\u2013402 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206, 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D.: Directed graphs exploration with little memory. In: Proceedings of 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004), pp. 246\u2013257 (2004)","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"17_CR15","unstructured":"Gorain, B., Pelc, A.: Deterministic graph exploration with advice. In: Proceedings of 44th International Colloquium on Automata, Languages and Programming (ICALP 2017), pp. 132:1\u2013132:14 (2017)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33, 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054114500129","volume":"25","author":"A Pelc","year":"2014","unstructured":"Pelc, A., Tiane, A.: Efficient grid exploration with a stationary token. Int. J. Found. Comput. Sci. 25, 247\u2013262 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Rao, N.S.V., Kareti, S., Shi, W., Iyengar, S.S.: Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms, Technical report ORNL\/TM-12410, Oak Ridge National Laboratory, July 1993","DOI":"10.2172\/10180101"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 17:1\u201317:24 (2008)","journal-title":"J. ACM"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01325-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:32:20Z","timestamp":1775255540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01325-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013240","9783030013257"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01325-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Ma'ale HaHamisha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/sirocco2018","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49% - 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"}},{"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"}},{"value":"1.97","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}