--- _id: '33947' article_type: original author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031 apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291. https://doi.org/10.1016/j.tcs.2022.10.031 bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }' chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science 939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.' ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291, 2023, doi: 10.1016/j.tcs.2022.10.031.' mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031. short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291. date_created: 2022-10-28T05:11:16Z date_updated: 2023-01-30T09:20:09Z department: - _id: '63' doi: 10.1016/j.tcs.2022.10.031 external_id: arxiv: - '2010.04424 ' intvolume: ' 939' keyword: - General Computer Science - Theoretical Computer Science language: - iso: eng page: 261-291 project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier BV status: public title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation type: journal_article user_id: '38705' volume: 939 year: '2023' ...