{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:39:29Z","timestamp":1769978369040,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258725","type":"print"},{"value":"9783642258732","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_31","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"451-464","source":"Crossref","is-referenced-by-count":21,"title":["On the Power of Waiting When Exploring Public Transportation Systems"],"prefix":"10.1007","author":[{"given":"David","family":"Ilcinkas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed Mouhamadou","family":"Wade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C. Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. CoRR, abs\/1012.0009 (2010)","DOI":"10.1007\/978-3-642-22450-8_27"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, C., Frieze, A.M.: Crawling on simple models of web graphs. Internet Mathematics\u00a01(1) (2003)","DOI":"10.1080\/15427951.2004.10129078"},{"issue":"1-3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.tcs.2004.07.031","volume":"326","author":"A. Dessmark","year":"2004","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theor. Comput. Sci.\u00a0326(1-3), 343\u2013362 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-13122-6_20","volume-title":"Fun with Algorithms","author":"P. Flocchini","year":"2010","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Mapping an Unfriendly Subway System. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 190\u2013201. Springer, Heidelberg (2010)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-10631-6_55","volume-title":"Algorithms and Computation","author":"P. Flocchini","year":"2009","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Exploration of Periodically Varying Graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 534\u2013543. Springer, Heidelberg (2009)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"2","key":"31_CR8","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\u00a033(2), 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: 37th ACM Symposium on Theory of Computing (STOC), pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:53:07Z","timestamp":1561031587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}