{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:14Z","timestamp":1725790934176},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_30","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"342-354","source":"Crossref","is-referenced-by-count":0,"title":["Collision-Free Network Exploration"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz","family":"Dereniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Paj\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_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.\u00a029(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"30_CR2","first-page":"218","volume-title":"Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS 1979","author":"R. Aleliunas","year":"1979","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 218\u2013223. IEEE Computer Society, Washington, DC (1979)"},{"key":"#cr-split#-30_CR3.1","doi-asserted-by":"crossref","unstructured":"Alon, N., Chung, F.R.K., Graham, R.L.: Routing permutations on graphs via matchings. In: STOC, pp. 583-591 (1993)","DOI":"10.1145\/167088.167239"},{"key":"#cr-split#-30_CR3.2","doi-asserted-by":"crossref","unstructured":"Also SIAM J. Discrete Math. 7(3), 513-530 (1994)","DOI":"10.1137\/S0895480192236628"},{"key":"30_CR4","unstructured":"Alpern, S., Gal, S.: Theory of Search Games and Rendezvous. Kluwer Acad. Publ. (2003)"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ipl.2008.08.011","volume":"109","author":"R. Baldoni","year":"2008","unstructured":"Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett.\u00a0109(2), 98\u2013103 (2008)","journal-title":"Inf. Process. Lett."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-15763-9_29","volume-title":"Distributed Computing","author":"L. Blin","year":"2010","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 312\u2013327. Springer, Heidelberg (2010)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Programming\u00a01, 127\u2013136 (1971)","journal-title":"Math. Programming"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2-3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms\u00a017(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273\u2013282 (2006)","DOI":"10.1109\/FOCS.2006.48"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Krizanc, D., Zhang, L.: Many-to-one packed routing via matchings. In: COCOON, pp. 11\u201317 (1997)","DOI":"10.1007\/BFb0045067"},{"issue":"2","key":"30_CR13","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"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(97)00049-2","volume":"185","author":"G.E. Pantziou","year":"1997","unstructured":"Pantziou, G.E., Roberts, A., Symvonis, A.: Many-to-many routings on trees via matchings. Theor. Comput. Sci.\u00a0185(2), 347\u2013377 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR15","unstructured":"Zhang, L.: Optimal bounds for matching routing on trees. In: SODA, pp. 445\u2013453 (1997)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:57:44Z","timestamp":1558861064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}