| Asymptotically Optimal Gathering on a Grid A Cord-Landwehr, M Fischer, D Jung, F Meyer auf der Heide 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2016 | 34 | 2016 |
| Gathering a Closed Chain of Robots on a Grid S Abshoff, A Cord-Landwehr, M Fischer, D Jung, F Meyer auf der Heide 30th IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2016 | 21 | 2016 |
| Gathering anonymous, oblivious robots on a grid J Castenow, M Fischer, J Harbig, D Jung, FM auf der Heide Theoretical Computer Science 815, 289-309, 2020 | 20 | 2020 |
| Gathering anonymous, oblivious robots on a grid M Fischer, D Jung, F Meyer auf der Heide International Symposium on Algorithms and Experiments for Sensor Systems …, 2017 | 15 | 2017 |
| Competitive routing in hybrid communication networks D Jung, C Kolb, C Scheideler, J Sundermeier Algorithms for Sensor Systems: 14th International Symposium on Algorithms …, 2019 | 12 | 2019 |
| Gathering a euclidean closed chain of robots in linear time J Castenow, J Harbig, D Jung, T Knollmann, F Meyer auf der Heide International Symposium on Algorithms and Experiments for Sensor Systems …, 2021 | 6 | 2021 |
| Multilevel network games S Abshoff, A Cord-Landwehr, D Jung, A Skopalik International Conference on Web and Internet Economics, 435-440, 2014 | 5 | 2014 |
| A unifying approach to efficient (near)-gathering of disoriented robots with limited visibility J Castenow, J Harbig, D Jung, P Kling, T Knollmann arXiv preprint arXiv:2206.07567, 2022 | 4 | 2022 |
| Brief announcement: gathering in linear time: a closed chain of disoriented and luminous robots with limited visibility J Castenow, J Harbig, D Jung, T Knollmann, F Meyer auf der Heide International Symposium on Stabilizing, Safety, and Security of Distributed …, 2020 | 3 | 2020 |
| Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation J Castenow, J Harbig, D Jung, T Knollmann, FM auf der Heide Theoretical Computer Science 939, 261-291, 2023 | 1 | 2023 |
| Brief announcement: Competitive routing in hybrid communication networks D Jung, C Kolb, C Scheideler, J Sundermeier Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 1 | 2018 |
| Local strategies for swarm formations on a grid D Jung Dissertation, Paderborn, Universität Paderborn, 2018, 2018 | 1 | 2018 |
| Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case S Abshoff, A Cord-Landwehr, D Jung arXiv preprint arXiv:1501.04877, 2015 | 1 | 2015 |
| Brief Announcement: A Model for Multilevel Network Games S Abshoff, A Cord-Landwehr, D Jung, A Skopalik Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa …, 2014 | 1 | 2014 |
| Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility FM auf der Heide Stabilization, Safety, and Security of Distributed Systems: 22nd …, 2020 | | 2020 |
| Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. J Castenow, J Harbig, D Jung, T Knollmann, FM auf der Heide CoRR, 2020 | | 2020 |
| Gathering in linear time: a closed chain of disoriented and luminous robots with limited visibility. CoRR abs/2010.04424 (2020) J Castenow, J Harbig, D Jung, T Knollmann, F Meyer auf der Heide | | 2010 |
Friedhelm Meyer auf der HeideProfessor of Computer Science, University of PaderbornVerified email at upb.de
