{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:38:02Z","timestamp":1768448282819,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662460771","type":"print"},{"value":"9783662460788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_14","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"164-176","source":"Crossref","is-referenced-by-count":41,"title":["Group Search on the Line"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Gorry","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"S. Alpern","year":"1999","unstructured":"Alpern, S., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Applied Probability\u00a036(1), 223\u2013231 (1999)","journal-title":"J. Applied Probability"},{"key":"14_CR2","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishing, Dordrecht (2003)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-19487-8_20","volume-title":"SWAT \u201988","author":"R.A. Baeza-Yates","year":"1988","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching with uncertainty. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 176\u2013189. Springer, Heidelberg (1988)"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Information and Computation\u00a0106(2), 234\u2013252 (1993)","journal-title":"Information and Computation"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"R.A. Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R.A., Schott, R.: Parallel searching in the plane. Computational Geometric Theory and Applications\u00a05(3), 143\u2013154 (1995)","journal-title":"Computational Geometric Theory and Applications"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10021-9","volume":"62","author":"R. Bellman","year":"1956","unstructured":"Bellman, R.: Minimization problem. Bull. AMS\u00a062(3), 270 (1956)","journal-title":"Bull. AMS"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. In: STOC 1998, pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-40450-4_18","volume-title":"Algorithms \u2013 ESA 2013","author":"P. Bose","year":"2013","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Revisiting the problem of searching on a line. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-642-14162-1_42","volume-title":"Automata, Languages and Programming","author":"A. Collins","year":"2010","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 502\u2013514. Springer, Heidelberg (2010)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. In: SODA 2013, pp. 737\u2013747 (2013)","DOI":"10.1137\/1.9781611973105.53"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cosrev.2010.05.001","volume":"4","author":"S.K. Ghosh","year":"2010","unstructured":"Ghosh, S.K., Klein, R.: Online algorithms for searching and exploration in the plane. Computer Science Review\u00a04(4), 189\u2013201 (2010)","journal-title":"Computer Science Review"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0925-7721(00)00028-6","volume":"18","author":"M. Hammar","year":"2001","unstructured":"Hammar, M., Nilsson, B.J., Schuierer, S.: Parallel searching on m rays. Comput. Geom.\u00a018(3), 125\u2013139 (2001)","journal-title":"Comput. Geom."},{"issue":"11","key":"14_CR13","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"131","author":"A. Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opuza\u0144ski, J.: On the two-dimensional cow search problem. Information Processing Letters\u00a0131(11), 543\u2013547 (2009)","journal-title":"Information Processing Letters"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"109","author":"M.Y. Kao","year":"1996","unstructured":"Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation\u00a0109(1), 63\u201379 (1996)","journal-title":"Information and Computation"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-61440-0_135","volume-title":"Automata, Languages and Programming","author":"E. Koutsoupias","year":"1996","unstructured":"Koutsoupias, E., Papadimitriou, C.H., Yannakakis, M.: Searching a fixed graph. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 280\u2013289. Springer, Heidelberg (1996)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Li, H., Chong, K.P.: Search on lines and graphs. In: Proc. 48th IEEE Conference on Decision and Control, 2009 held Jointly with the 2009 28th Chinese Control Conference (CDC\/CCC 2009), vol.\u00a0109(11), pp. 5780\u20135785 (2009)","DOI":"10.1109\/CDC.2009.5399521"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Temple, T., Frazzoli, E.: Whittle-indexability of the cow path problem. In: American Control Conference (ACC), pp. 4152\u20134158 (2010)","DOI":"10.1109\/ACC.2010.5530603"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:18Z","timestamp":1559088018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}