{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:08Z","timestamp":1725815228430},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_16","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T14:54:29Z","timestamp":1421247269000},"page":"189-200","source":"Crossref","is-referenced-by-count":5,"title":["Deterministic Rendezvous in Restricted Graphs"],"prefix":"10.1007","author":[{"given":"Ashley","family":"Farrugia","sequence":"first","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"\u0141ukasz","family":"Kuszner","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Pacheco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proc.\u00a0PODC 2013, pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control and Optimization\u00a0(33), 673\u2013683 (1995)","DOI":"10.1137\/S0363012993249195"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Alpern, S.: Rendezvous search on labeled networks. Naval Reaserch Logistics\u00a0(49), 256\u2013274 (2002)","DOI":"10.1002\/nav.10011"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Alpern, S., Fokkink, R.: G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V.S.: Search Theory, A Game Theoretic Perspective. Springer (2013)","DOI":"10.1007\/978-1-4614-6825-7"},{"key":"16_CR5","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers (2002)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. Symp. on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research\u00a0(49), 107\u2013118 (2001)","DOI":"10.1287\/opre.49.1.107.11191"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability\u00a0(28), 839\u2013851 (1990)","DOI":"10.2307\/3214827"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Baston, V., Gal, S.: Rendezvous on the line when the players\u2019 initial distance is given by an unknown probability distribution. SIAM J. Control and Optimization\u00a0(36), 1880\u20131889 (1998)","DOI":"10.1137\/S0363012996314130"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics\u00a0(48), 722\u2013731 (2001)","DOI":"10.1002\/nav.1044"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chen, S., Russell, A., Samanta, A., Sundaram, R.: Deterministic Blind Rendezvous in Cognitive Radio Networks. In: Proc. ICDCS (2014)","DOI":"10.1109\/ICDCS.2014.44"},{"key":"16_CR12","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":"16_CR13","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Martin, R.: Synchronous Rendezvous for Location-Aware Agents. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 447\u2013459. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_42"},{"issue":"6-7","key":"16_CR14","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoretical Computer Science\u00a0410(6-7), 481\u2013499 (2009)","journal-title":"Theoretical Computer Science"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. Distributed Computing\u00a0(25), 165\u2013178 (2012)","DOI":"10.1007\/s00446-011-0141-9"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms (8), article 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-09620-9_24","volume-title":"Structural Information and Communication Complexity","author":"D. Dereniowski","year":"2014","unstructured":"Dereniowski, D., Klasing, R., Kosowski, A., Kuszner, \u0141.: Rendezvous of heterogeneous mobile agents in edge-weighted networks. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol.\u00a08576, pp. 311\u2013326. Springer, Heidelberg (2014)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theoretical Computer Science\u00a0(399), 141\u2013156 (2008)","DOI":"10.1016\/j.tcs.2008.02.010"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11780823_1","volume-title":"Structural Information and Communication Complexity","author":"H.-C. An","year":"2006","unstructured":"An, H.-C., Krizanc, D., Rajsbaum, S.: Mobile Agent Rendezvous: A Survey. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 1\u20139. Springer, Heidelberg (2006)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Lin, Z., Liu, H., Chu, X., Leung, Y.-W.: Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks. In: Proc. INFOCOM, pp. 2444\u20132452 (2011)","DOI":"10.1109\/INFCOM.2011.5935066"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Miller, A., Pelc, A.: Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks. In: Proc. PODC, pp. 282\u2013290 (2014)","DOI":"10.1145\/2611462.2611473"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Pelc, A.: Deterministic rendezvous in networks: A comprehensive survey. Networks\u00a0(59), 331\u2013347 (2012)","DOI":"10.1002\/net.21453"},{"key":"16_CR23","volume-title":"The Strategy of Conflict","author":"T. Schelling","year":"1960","unstructured":"Schelling, T.: The Strategy of Conflict. Harvard Univ. Press, Cambridge (1960)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T18:31:18Z","timestamp":1566239478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}