{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:30Z","timestamp":1759638030019,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_18","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"205-216","source":"Crossref","is-referenced-by-count":18,"title":["Revisiting the Problem of Searching on a Line"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_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. App. Prob.\u00a036(1), 223\u2013231 (1999)","journal-title":"J. App. Prob."},{"key":"18_CR2","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research & Management Science. Kluwer Academic Publishers (2003)"},{"issue":"2","key":"18_CR3","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. Inf. & Comp.\u00a0106(2), 234\u2013252 (1993)","journal-title":"Inf. & Comp."},{"issue":"3","key":"18_CR4","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":"18_CR5","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, pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"50","key":"18_CR7","doi-asserted-by":"publisher","first-page":"6926","DOI":"10.1016\/j.tcs.2011.09.002","volume":"412","author":"J. Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Asynchronous deterministic rendezvous in bounded terrains. Theor. Comp. Sci.\u00a0412(50), 6926\u20136937 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. In: SODA, pp. 737\u2013747 (2013)","DOI":"10.1137\/1.9781611973105.53"},{"issue":"3","key":"18_CR9","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":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(99)00009-8","volume":"93","author":"C.A. Hipke","year":"1999","unstructured":"Hipke, C.A., Icking, C., Klein, R., Langetepe, E.: How to find a point on a line within a fixed distance. Disc. App. Math.\u00a093(1), 67\u201373 (1999)","journal-title":"Disc. App. Math."},{"issue":"2","key":"18_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/00150517.1974.12430744","volume":"12","author":"V. Hoggatt","year":"1974","unstructured":"Hoggatt, V., Long, C.: Divisibility properties of generalized fibonacci polynomials. Fibonacci Quart.\u00a012(2), 113\u2013120 (1974)","journal-title":"Fibonacci Quart."},{"key":"18_CR12","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)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(00)00144-4","volume":"261","author":"A. L\u00f3pez-Ortiz","year":"2001","unstructured":"L\u00f3pez-Ortiz, A., Schuierer, S.: The ultimate strategy to search on m rays? Theor. Comp. Sci.\u00a0261(2), 267\u2013295 (2001)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G. Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comp. Sci.\u00a0355(3), 315\u2013326 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer (1985)","DOI":"10.1007\/978-1-4612-1098-6"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T13:54:23Z","timestamp":1746021263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}