{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:18Z","timestamp":1759638858984,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910808"},{"type":"electronic","value":"9783030910815"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91081-5_19","type":"book-chapter","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T21:03:40Z","timestamp":1636405420000},"page":"289-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Max-Line-Formation Problem"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Castenow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"G\u00f6tte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer\u00a0auf\u00a0der\u00a0Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering a closed chain of robots on a grid. In: IPDPS, pp. 689\u2013699. IEEE Computer Society (2016)","DOI":"10.1109\/IPDPS.2016.51"},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Autom. 15(5), 818\u2013828 (1999)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Castenow, J., Fischer, M., Harbig, J., Jung, D., Meyer auf der Heide, F.: Gathering anonymous, oblivious robots on a grid. Theor. Comput. Sci. 815, 289\u2013309 (2020)","DOI":"10.1016\/j.tcs.2020.02.018"},{"key":"19_CR4","unstructured":"Castenow, J., G\u00f6tte, T., Jung, D., Knollmann, T., Meyer auf der Heide, F.: The Max-Line-Formation Problem. CoRR abs\/2109.11856 (2021). https:\/\/arxiv.org\/abs\/2109.11856"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., Meyer auf der Heide, F.: Gathering a euclidean closed chain of robots in linear time. In: G\u0105sieniec, L., Klasing, R., Radzik, T. (eds.) ALGOSENSORS 2021. LNCS, vol. 12961, pp. 29\u201344. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89240-1_3","DOI":"10.1007\/978-3-030-89240-1_3"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-64348-5_6","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J Castenow","year":"2020","unstructured":"Castenow, J., Kling, P., Knollmann, T., Meyer auf der Heide, F.: A discrete and continuous study of the Max-Chain-Formation problem. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 65\u201380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_6"},{"issue":"1\u20132","key":"19_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2008.02.007","volume":"399","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1\u20132), 71\u201382 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: SPAA, pp. 301\u2013312. ACM (2016)","DOI":"10.1145\/2935764.2935789"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Kling, P., Meyer auf der Heide, F.: Linear and competitive strategies for continuous robot formation problems. ACM Trans. Parallel Comput. 2(1), 2:1\u20132:18 (2015)","DOI":"10.1145\/2742341"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA, pp. 139\u2013148. ACM (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-11072-7_11","volume-title":"Distributed Computing by Mobile Entities","author":"GA Di Luna","year":"2019","unstructured":"Di Luna, G.A., Viglietta, G.: Robots with lights. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 252\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_11"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-28073-3_8","volume-title":"Distributed Computing and Internet Technology","author":"A Dutta","year":"2012","unstructured":"Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K.: Circle formation by asynchronous fat robots with limited visibility. In: Ramanujam, R., Ramaswamy, S. (eds.) ICDCIT 2012. LNCS, vol. 7154, pp. 83\u201393. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28073-3_8"},{"key":"19_CR13","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-0-387-34733-2_14","volume-title":"Biologically Inspired Cooperative Computing","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Kuty\u0142owski, J., Lorek, P., auf der Heide, F.M.: Maintaining communication between an explorer and a base station. In: Pan, Y., Rammig, F.J., Schmeck, H., Solar, M. (eds.) BICC 2006. IIFIP, vol. 216, pp. 137\u2013146. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/978-0-387-34733-2_14"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Dynia, M., Kutylowski, J., Meyer auf der Heide, F., Schrieb, J.: Local strategies for maintaining a chain of relay stations between an explorer and a base station. In: SPAA, pp. 260\u2013269. ACM (2007)","DOI":"10.1145\/1248377.1248420"},{"key":"19_CR15","series-title":"LNCS","volume-title":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing","year":"2019","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340. Springer, Cham (2019)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Kling, P., Meyer auf der Heide, F.: Convergence of local communication chain strategies via linear transformations. In: SPAA, pp. 159\u2013166. ACM (2011)","DOI":"10.1145\/1989493.1989517"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Kutylowski, J., Meyer auf der Heide, F.: Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theor. Comput. Sci. 410(36), 3391\u20133405 (2009)","DOI":"10.1016\/j.tcs.2008.04.010"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-030-36987-3_28","volume-title":"Distributed Computing and Internet Technology","author":"M Mondal","year":"2020","unstructured":"Mondal, M., Gan Chaudhuri, S.: Uniform circle formation by swarm robots under limited visibility. In: Hung, D.V., D\u2019Souza, M. (eds.) ICDCIT 2020. LNCS, vol. 11969, pp. 420\u2013428. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36987-3_28"},{"issue":"11","key":"19_CR19","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1109\/TAC.2009.2031203","volume":"54","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Olshevsky, A., Ozdaglar, A.E., Tsitsiklis, J.N.: On distributed averaging algorithms and quantization effects. IEEE Trans. Autom. Control 54(11), 2506\u20132517 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-69084-1_23","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"P Poudel","year":"2017","unstructured":"Poudel, P., Sharma, G.: Universally optimal gathering under limited visibility. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 323\u2013340. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_23"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91081-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:41:09Z","timestamp":1710258069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91081-5_19"}},"subtitle":["And New Insights for Gathering and Chain-Formation"],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910808","9783030910815"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91081-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.chalmers.se\/~elad\/SSS2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}