14 Publications

Mark all

[14]
2020 | Conference Paper | LibreCat-ID: 20185
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 & Luminous Robots with Limited Visibility .” In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_5.
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4565
Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “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. https://doi.org/10.1145/3210377.3210663.
LibreCat | Files available | DOI
 
[11]
2018 | Conference Paper | LibreCat-ID: 4563
Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “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
 
[10]
2018 | Dissertation | LibreCat-ID: 1209
Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
LibreCat | Files available | DOI
 
[9]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[8]
2017 | Preprint | LibreCat-ID: 17811
Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat
 
[7]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.
LibreCat | DOI
 
[5]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[4]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” ArXiv: 1501.04877, 2015.
LibreCat | arXiv
 
[3]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

14 Publications

Mark all

[14]
2020 | Conference Paper | LibreCat-ID: 20185
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 & Luminous Robots with Limited Visibility .” In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_5.
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4565
Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “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. https://doi.org/10.1145/3210377.3210663.
LibreCat | Files available | DOI
 
[11]
2018 | Conference Paper | LibreCat-ID: 4563
Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “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
 
[10]
2018 | Dissertation | LibreCat-ID: 1209
Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
LibreCat | Files available | DOI
 
[9]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[8]
2017 | Preprint | LibreCat-ID: 17811
Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat
 
[7]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.
LibreCat | DOI
 
[5]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[4]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” ArXiv: 1501.04877, 2015.
LibreCat | arXiv
 
[3]
2015 | Preprint | LibreCat-ID: 16449
Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed