Jannik Castenow

Algorithmen und Komplexität / Heinz Nixdorf Institut
jannik.castenow@uni-paderborn.de
ID
38705

22 Publications

Mark all

[22]
2023 | Journal Article | LibreCat-ID: 33947
Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.
LibreCat | DOI | arXiv
 
[21]
2023 | Conference Paper | LibreCat-ID: 34008
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility
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.
LibreCat | DOI | arXiv
 
[20]
2023 | Book Chapter | LibreCat-ID: 44769
Unifying Gathering Protocols for Swarms of Mobile Robots
J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.
LibreCat | DOI
 
[19]
2023 | Dissertation | LibreCat-ID: 45580
Local Protocols for Contracting and Expanding Robot Formation Problems
J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.
LibreCat | DOI
 
[18]
2022 | Journal Article | LibreCat-ID: 29843
A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat | DOI
 
[17]
2022 | Conference Paper | LibreCat-ID: 31847
The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.
LibreCat | DOI | arXiv
 
[16]
2021 | Conference Paper | LibreCat-ID: 23730
Gathering a Euclidean Closed Chain of Robots in Linear Time
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.
LibreCat | DOI | arXiv
 
[15]
2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
 
[14]
2020 | Conference Paper | LibreCat-ID: 19899
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, 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. 65–80.
LibreCat | DOI | arXiv
 
[13]
2020 | Conference Paper | LibreCat-ID: 20185
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
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.
LibreCat | DOI | arXiv
 
[12]
2020 | Conference Paper | LibreCat-ID: 17370
The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[11]
2020 | Conference Paper | LibreCat-ID: 17371
Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[10]
2020 | Conference Paper | LibreCat-ID: 16968
Local Gathering of Mobile Robots in Three Dimensions
M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.
LibreCat | Files available | DOI | arXiv
 
[9]
2020 | Conference Paper | LibreCat-ID: 15169
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.
LibreCat
 
[8]
2020 | Journal Article | LibreCat-ID: 16299
Gathering Anonymous, Oblivious Robots on a Grid
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.
LibreCat | DOI
 
[7]
2019 | Conference Paper | LibreCat-ID: 14539
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.
LibreCat | DOI
 
[6]
2018 | Conference Paper | LibreCat-ID: 4563
Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat | Files available
 
[5]
2018 | Conference Paper | LibreCat-ID: 4565
Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.
LibreCat | Files available | DOI
 
[4]
2018 | Conference Paper | LibreCat-ID: 4375
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat | Files available | DOI
 
[3]
2017 | Mastersthesis | LibreCat-ID: 699
Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions
J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
LibreCat
 
[2]
2017 | Book Chapter | LibreCat-ID: 16461
Monitoring of Domain-Related Problems in Distributed Data Streams
P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.
LibreCat | DOI | arXiv
 
[1]
2015 | Bachelorsthesis | LibreCat-ID: 18006
Implementierung eines selbststabilisierenden verteilten Stacks
J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks, Universität Paderborn, 2015.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed

22 Publications

Mark all

[22]
2023 | Journal Article | LibreCat-ID: 33947
Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.
LibreCat | DOI | arXiv
 
[21]
2023 | Conference Paper | LibreCat-ID: 34008
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility
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.
LibreCat | DOI | arXiv
 
[20]
2023 | Book Chapter | LibreCat-ID: 44769
Unifying Gathering Protocols for Swarms of Mobile Robots
J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.
LibreCat | DOI
 
[19]
2023 | Dissertation | LibreCat-ID: 45580
Local Protocols for Contracting and Expanding Robot Formation Problems
J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.
LibreCat | DOI
 
[18]
2022 | Journal Article | LibreCat-ID: 29843
A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat | DOI
 
[17]
2022 | Conference Paper | LibreCat-ID: 31847
The k-Server with Preferences Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.
LibreCat | DOI | arXiv
 
[16]
2021 | Conference Paper | LibreCat-ID: 23730
Gathering a Euclidean Closed Chain of Robots in Linear Time
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.
LibreCat | DOI | arXiv
 
[15]
2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
 
[14]
2020 | Conference Paper | LibreCat-ID: 19899
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, 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. 65–80.
LibreCat | DOI | arXiv
 
[13]
2020 | Conference Paper | LibreCat-ID: 20185
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
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.
LibreCat | DOI | arXiv
 
[12]
2020 | Conference Paper | LibreCat-ID: 17370
The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[11]
2020 | Conference Paper | LibreCat-ID: 17371
Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 
[10]
2020 | Conference Paper | LibreCat-ID: 16968
Local Gathering of Mobile Robots in Three Dimensions
M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.
LibreCat | Files available | DOI | arXiv
 
[9]
2020 | Conference Paper | LibreCat-ID: 15169
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.
LibreCat
 
[8]
2020 | Journal Article | LibreCat-ID: 16299
Gathering Anonymous, Oblivious Robots on a Grid
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.
LibreCat | DOI
 
[7]
2019 | Conference Paper | LibreCat-ID: 14539
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.
LibreCat | DOI
 
[6]
2018 | Conference Paper | LibreCat-ID: 4563
Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat | Files available
 
[5]
2018 | Conference Paper | LibreCat-ID: 4565
Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.
LibreCat | Files available | DOI
 
[4]
2018 | Conference Paper | LibreCat-ID: 4375
A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat | Files available | DOI
 
[3]
2017 | Mastersthesis | LibreCat-ID: 699
Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions
J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
LibreCat
 
[2]
2017 | Book Chapter | LibreCat-ID: 16461
Monitoring of Domain-Related Problems in Distributed Data Streams
P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.
LibreCat | DOI | arXiv
 
[1]
2015 | Bachelorsthesis | LibreCat-ID: 18006
Implementierung eines selbststabilisierenden verteilten Stacks
J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks, Universität Paderborn, 2015.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed