14 Publications

Mark all

[14]
2020 | Conference Paper | LibreCat-ID: 20185
Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” 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, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4565
Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” 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
 
[11]
2018 | Conference Paper | LibreCat-ID: 4563
Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” 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, doi:10.17619/UNIPB/1-271.
LibreCat | Files available | DOI
 
[9]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[8]
2017 | Preprint | LibreCat-ID: 17811
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat
 
[7]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
LibreCat | DOI
 
[5]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[4]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, et al. “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, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

14 Publications

Mark all

[14]
2020 | Conference Paper | LibreCat-ID: 20185
Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” 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, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.
LibreCat | DOI | arXiv
 
[13]
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat | DOI
 
[12]
2018 | Conference Paper | LibreCat-ID: 4565
Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” 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
 
[11]
2018 | Conference Paper | LibreCat-ID: 4563
Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” 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, doi:10.17619/UNIPB/1-271.
LibreCat | Files available | DOI
 
[9]
2017 | Conference Paper | LibreCat-ID: 16347
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
LibreCat | DOI
 
[8]
2017 | Preprint | LibreCat-ID: 17811
Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat
 
[7]
2016 | Conference Paper | LibreCat-ID: 16360
Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
LibreCat | DOI
 
[6]
2016 | Conference Paper | LibreCat-ID: 16359
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
LibreCat | DOI
 
[5]
2016 | Preprint | LibreCat-ID: 16450
Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat | arXiv
 
[4]
2015 | Preprint | LibreCat-ID: 16397
Abshoff, Sebastian, et al. “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, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.
LibreCat | arXiv
 
[2]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed