{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:02Z","timestamp":1759637822708},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_7","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"79-90","source":"Crossref","is-referenced-by-count":6,"title":["Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Kranakis","sequence":"first","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Felipe","family":"Ram\u00edrez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","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: FOCS, pp. 218\u2013223. IEEE (1979)","DOI":"10.1109\/SFCS.1979.34"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33(3), 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"7_CR3","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.50.5.772.363","volume":"50","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772\u2013795 (2002)","journal-title":"Oper. Res."},{"key":"7_CR4","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, New York (2002). International Series in Operations Research and Management Science"},{"issue":"50","key":"7_CR5","doi-asserted-by":"crossref","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. TCS 412(50), 6926\u20136937 (2011)","journal-title":"TCS"},{"issue":"2","key":"7_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25(2), 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"issue":"2","key":"7_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00224-011-9379-7","volume":"52","author":"J Czyzowicz","year":"2013","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theor. Comput. Syst. 52(2), 179\u2013199 (2013)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"7_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G Marco","year":"2006","unstructured":"Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoret. Comput. Sci. 355(3), 315\u2013326 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 92\u201399 (2013)","DOI":"10.1145\/2484239.2484245"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-45249-9_1"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-19662-6_14","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"E Huus","year":"2015","unstructured":"Huus, E., Kranakis, E.: Rendezvous of many agents with different speeds in a cycle. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 195\u2013209. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-19662-6_14"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M Koucky","year":"2002","unstructured":"Koucky, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., MacQuarrie, F., Shende, S.: Randomized rendezvous on a ring for agents with different speeds. In: Proceedings of the 15th International Conference on Distributed Computing and Networking (ICDCN) (2015)","DOI":"10.1145\/2684464.2684468"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring: an introduction. Synthesis Lectures on Distributed Computing Theory Series. Morgan and Claypool Publishers, San Rafael (2010)","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"issue":"4","key":"7_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)","journal-title":"J. ACM"},{"key":"7_CR18","unstructured":"Sawchuk, C.: Mobile Agent Rendezvous in the Ring. Ph.D. thesis, Carleton University (2004)"},{"issue":"3","key":"7_CR19","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2601068","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610\u2013621. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61440-0_163"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T06:02:55Z","timestamp":1568700175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}