[{"type":"conference","editor":[{"first_name":"Silvia","full_name":"Bonomi, Silvia","last_name":"Bonomi"},{"full_name":"Galletta, Letterio","last_name":"Galletta","first_name":"Letterio"},{"last_name":"Rivière","full_name":"Rivière,  Etienne","first_name":" Etienne"},{"full_name":"Schiavoni,  Valerio","last_name":"Schiavoni","first_name":" Valerio"}],"status":"public","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106","grant_number":"453112019"}],"_id":"56298","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"97359","department":[{"_id":"101"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-360-7"],"issn":["1868-8969"]},"citation":{"apa":"Gerlach, R., von der Gracht, S., Hahn, C., Harbig, J., &#38; Kling, P. (2025). Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility. In S. Bonomi, L. Galletta,  Etienne Rivière, &#38;  Valerio Schiavoni (Eds.), <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i> (Vol. 324). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">https://doi.org/10.4230/LIPIcs.OPODIS.2024.13</a>","short":"R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, P. Kling, in: S. Bonomi, L. Galletta,  Etienne Rivière,  Valerio Schiavoni (Eds.), 28th International Conference on Principles of Distributed Systems (OPODIS 2024), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025.","mla":"Gerlach, Raphael, et al. “Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility.” <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i>, edited by Silvia Bonomi et al., vol. 324, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">10.4230/LIPIcs.OPODIS.2024.13</a>.","bibtex":"@inproceedings{Gerlach_von der Gracht_Hahn_Harbig_Kling_2025, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility}, volume={324}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">10.4230/LIPIcs.OPODIS.2024.13</a>}, booktitle={28th International Conference on Principles of Distributed Systems (OPODIS 2024)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Gerlach, Raphael and von der Gracht, Sören and Hahn, Christopher and Harbig, Jonas and Kling, Peter}, editor={Bonomi, Silvia and Galletta, Letterio and Rivière,  Etienne and Schiavoni,  Valerio}, year={2025}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Gerlach R, von der Gracht S, Hahn C, Harbig J, Kling P. Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility. In: Bonomi S, Galletta L, Rivière  Etienne, Schiavoni  Valerio, eds. <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i>. Vol 324. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">10.4230/LIPIcs.OPODIS.2024.13</a>","ieee":"R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, and P. Kling, “Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility,” in <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i>, Lucca, Italy, 2025, vol. 324, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">10.4230/LIPIcs.OPODIS.2024.13</a>.","chicago":"Gerlach, Raphael, Sören von der Gracht, Christopher Hahn, Jonas Harbig, and Peter Kling. “Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility.” In <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i>, edited by Silvia Bonomi, Letterio Galletta,  Etienne Rivière, and  Valerio Schiavoni, Vol. 324. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2024.13\">https://doi.org/10.4230/LIPIcs.OPODIS.2024.13</a>."},"intvolume":"       324","date_updated":"2025-01-09T11:39:19Z","oa":"1","author":[{"first_name":"Raphael","full_name":"Gerlach, Raphael","id":"32655","last_name":"Gerlach","orcid":"0009-0002-4750-2051"},{"orcid":"0000-0002-8054-2058","last_name":"von der Gracht","full_name":"von der Gracht, Sören","id":"97359","first_name":"Sören"},{"first_name":"Christopher","last_name":"Hahn","full_name":"Hahn, Christopher"},{"first_name":"Jonas","last_name":"Harbig","id":"47213","full_name":"Harbig, Jonas"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"}],"volume":324,"main_file_link":[{"url":"https://arxiv.org/abs/2409.19277","open_access":"1"}],"conference":{"end_date":"2024-12-13","location":"Lucca, Italy","name":"28th International Conference on Principles of Distributed Systems (OPODIS 2024)","start_date":"2024-12-11"},"doi":"10.4230/LIPIcs.OPODIS.2024.13","publication":"28th International Conference on Principles of Distributed Systems (OPODIS 2024)","abstract":[{"text":"In the general pattern formation (GPF) problem, a swarm of simple autonomous,\r\ndisoriented robots must form a given pattern. The robots' simplicity imply a\r\nstrong limitation: When the initial configuration is rotationally symmetric,\r\nonly patterns with a similar symmetry can be formed [Yamashita, Suzyuki; TCS\r\n2010]. The only known algorithm to form large patterns with limited visibility\r\nand without memory requires the robots to start in a near-gathering (a swarm of\r\nconstant diameter) [Hahn et al.; SAND 2024]. However, not only do we not know\r\nany near-gathering algorithm guaranteed to preserve symmetry but most natural\r\ngathering strategies trivially increase symmetries [Castenow et al.; OPODIS\r\n2022].\r\n  Thus, we study near-gathering without changing the swarm's rotational\r\nsymmetry for disoriented, oblivious robots with limited visibility (the\r\nOBLOT-model, see [Flocchini et al.; 2019]). We introduce a technique based on\r\nthe theory of dynamical systems to analyze how a given algorithm affects\r\nsymmetry and provide sufficient conditions for symmetry preservation. Until\r\nnow, it was unknown whether the considered OBLOT-model allows for any\r\nnon-trivial algorithm that always preserves symmetry. Our first result shows\r\nthat a variant of Go-to-the-Average always preserves symmetry but may sometimes\r\nlead to multiple, unconnected near-gathering clusters. Our second result is a\r\nsymmetry-preserving near-gathering algorithm that works on swarms with a convex\r\nboundary (the outer boundary of the unit disc graph) and without holes (circles\r\nof diameter 1 inside the boundary without any robots).","lang":"eng"}],"external_id":{"arxiv":["2409.19277"]},"keyword":["Swarm Algorithm","Swarm Robots","Distributed Algorithm","Pattern Formation","Limited Visibility","Oblivious"],"language":[{"iso":"eng"}],"year":"2025","publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik","date_created":"2024-10-01T13:29:43Z","title":"Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility"},{"year":"2023","date_created":"2022-10-28T05:11:16Z","publisher":"Elsevier BV","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","publication":"Theoretical Computer Science","external_id":{"arxiv":["2010.04424 "]},"language":[{"iso":"eng"}],"keyword":["General Computer Science","Theoretical Computer Science"],"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"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. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>","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.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>.","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,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>","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={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, 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} }","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>."},"intvolume":"       939","page":"261-291","author":[{"full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow","first_name":"Jannik"},{"last_name":"Harbig","id":"47213","full_name":"Harbig, Jonas","first_name":"Jonas"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","id":"39241","full_name":"Knollmann, Till"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"volume":939,"date_updated":"2023-01-30T09:20:09Z","doi":"10.1016/j.tcs.2022.10.031","type":"journal_article","status":"public","user_id":"38705","department":[{"_id":"63"}],"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"_id":"33947","article_type":"original"},{"date_created":"2022-11-04T09:41:30Z","publisher":"Schloss Dagstuhl – Leibniz Zentrum für Informatik","title":"A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ","year":"2023","external_id":{"arxiv":["2206.07567 "]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ","author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"last_name":"Harbig","id":"47213","full_name":"Harbig, Jonas","first_name":"Jonas"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"volume":253,"date_updated":"2023-02-15T14:53:12Z","conference":{"location":"Brussels","end_date":"2022-12-15","start_date":"2022-12-13","name":"26th International Conference on Principles of Distributed Systems (OPODIS)"},"doi":"10.4230/LIPIcs.OPODIS.2022.15","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-265-5"]},"citation":{"ama":"Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>. Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>","ieee":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, Brussels, 2023, vol. 253, p. 15:1–15:25, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>.","mla":"Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.","apa":"Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &#38; E. Riviére (Eds.), <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i> (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>"},"page":"15:1–15:25","intvolume":"       253","place":"Brussels","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"38705","department":[{"_id":"63"}],"project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"_id":"34008","type":"conference","status":"public","editor":[{"first_name":"Eshcar","full_name":"Hillel, Eshcar","last_name":"Hillel"},{"first_name":"Roberto","last_name":"Palmieri","full_name":"Palmieri, Roberto"},{"first_name":"Etienne","full_name":"Riviére, Etienne","last_name":"Riviére"}]},{"date_created":"2023-05-11T13:13:45Z","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow"},{"first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"publisher":"Springer International Publishing","date_updated":"2023-05-11T13:14:43Z","doi":"10.1007/978-3-031-30448-4_1","title":"Unifying Gathering Protocols for Swarms of Mobile Robots","publication_identifier":{"isbn":["9783031304477","9783031304484"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ama":"Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>","chicago":"Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">https://doi.org/10.1007/978-3-031-30448-4_1</a>.","ieee":"J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2023.","bibtex":"@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }","short":"J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.","mla":"Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">10.1007/978-3-031-30448-4_1</a>.","apa":"Castenow, J., Harbig, J., &#38; Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-30448-4_1\">https://doi.org/10.1007/978-3-031-30448-4_1</a>"},"year":"2023","place":"Cham","department":[{"_id":"63"}],"user_id":"38705","_id":"44769","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public"},{"external_id":{"arxiv":["2010.04424"]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","publisher":"Springer","date_created":"2021-09-03T09:01:25Z","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time","year":"2021","_id":"23730","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"38705","type":"conference","editor":[{"first_name":"Leszek","full_name":"Gasieniec, Leszek","last_name":"Gasieniec"},{"first_name":"Ralf","full_name":"Klasing, Ralf","last_name":"Klasing"},{"first_name":"Tomasz","last_name":"Radzik","full_name":"Radzik, Tomasz"}],"status":"public","date_updated":"2022-01-06T06:55:58Z","volume":12961,"author":[{"first_name":"Jannik","id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow"},{"last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213","first_name":"Jonas"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"doi":"10.1007/978-3-030-89240-1_3","conference":{"name":"17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) 2021","start_date":"2021-09-09","end_date":"2021-09-10","location":"Lissabon"},"publication_status":"published","page":"29 - 44","intvolume":"     12961","citation":{"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,” in <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, Lissabon, 2021, vol. 12961, pp. 29–44, doi: <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>.","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.” In <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">https://doi.org/10.1007/978-3-030-89240-1_3</a>.","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R, Radzik T, eds. <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Vol 12961. LNCS. Springer; 2021:29-44. doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, &#38; T. Radzik (Eds.), <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i> (Vol. 12961, pp. 29–44). Springer. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">https://doi.org/10.1007/978-3-030-89240-1_3</a>","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021, series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time}, volume={12961}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>}, booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz}, year={2021}, pages={29–44}, collection={LNCS} }","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>."}},{"status":"public","editor":[{"last_name":"Devismes","full_name":"Devismes, Stéphane ","first_name":"Stéphane "},{"full_name":" Mittal, Neeraj","last_name":" Mittal","first_name":"Neeraj"}],"type":"conference","user_id":"38705","series_title":"Lecture Notes in Computer Science (LNCS)","department":[{"_id":"63"}],"_id":"20185","citation":{"bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility }, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.","mla":"Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In S. Devismes &#38; N.  Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i> (Vol. 12514, pp. 60–64). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility ,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, 2020, vol. 12514, pp. 60–64.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>.","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In: Devismes S,  Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>"},"intvolume":"     12514","page":"60-64","publication_status":"published","publication_identifier":{"isbn":["978-3-030-64347-8"]},"doi":"10.1007/978-3-030-64348-5_5","author":[{"first_name":"Jannik","id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow"},{"first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"volume":12514,"date_updated":"2022-01-06T06:54:21Z","publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.04424 "]},"year":"2020","title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","date_created":"2020-10-23T08:50:28Z","publisher":"Springer"}]