17 Publications

Mark all

[17]
2023 | Journal Article | LibreCat-ID: 33947
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
LibreCat | DOI | arXiv
 
[16]
2023 | Conference Paper | LibreCat-ID: 34008
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. Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) . Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15
LibreCat | DOI | arXiv
 
[15]
2021 | Conference Paper | LibreCat-ID: 23730
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. Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS. Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3
LibreCat | DOI | arXiv
 
[14]
2020 | Conference Paper | LibreCat-ID: 20185
Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4563
Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.
LibreCat | Files available
 
[11]
2018 | Conference Paper | LibreCat-ID: 4565
Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663
LibreCat | Files available | DOI
 
[10]
2018 | Dissertation | LibreCat-ID: 1209
Jung D. Local Strategies for Swarm Formations on a Grid. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-271
LibreCat | Files available | DOI
 
[9]
2017 | Preprint | LibreCat-ID: 17811
Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017.
LibreCat
 
[8]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13
LibreCat | DOI
 
[7]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016.
LibreCat | arXiv
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789
LibreCat | DOI
 
[5]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51
LibreCat | DOI
 
[4]
2015 | Preprint | LibreCat-ID: 16449
Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.
LibreCat | arXiv
 
[3]
2015 | Preprint | LibreCat-ID: 16397
Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 150104877. 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.
LibreCat | Files available
 
[1]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36
LibreCat | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

17 Publications

Mark all

[17]
2023 | Journal Article | LibreCat-ID: 33947
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
LibreCat | DOI | arXiv
 
[16]
2023 | Conference Paper | LibreCat-ID: 34008
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. Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) . Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15
LibreCat | DOI | arXiv
 
[15]
2021 | Conference Paper | LibreCat-ID: 23730
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. Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS. Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3
LibreCat | DOI | arXiv
 
[14]
2020 | Conference Paper | LibreCat-ID: 20185
Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4563
Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.
LibreCat | Files available
 
[11]
2018 | Conference Paper | LibreCat-ID: 4565
Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663
LibreCat | Files available | DOI
 
[10]
2018 | Dissertation | LibreCat-ID: 1209
Jung D. Local Strategies for Swarm Formations on a Grid. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-271
LibreCat | Files available | DOI
 
[9]
2017 | Preprint | LibreCat-ID: 17811
Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017.
LibreCat
 
[8]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13
LibreCat | DOI
 
[7]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016.
LibreCat | arXiv
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789
LibreCat | DOI
 
[5]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51
LibreCat | DOI
 
[4]
2015 | Preprint | LibreCat-ID: 16449
Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.
LibreCat | arXiv
 
[3]
2015 | Preprint | LibreCat-ID: 16397
Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 150104877. 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.
LibreCat | Files available
 
[1]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36
LibreCat | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed