Jannik Castenow

According to our database, Jannik Castenow authored at least 21 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Local protocols for contracting and expanding robot formation problems

Jannik Castenow

PhD thesis, 2023

Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation.

Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide

Theor. Comput. Sci., 2023

Unifying Gathering Protocols for Swarms of Mobile Robots.

Jannik Castenow, Jonas Harbig, Friedhelm Meyer auf der Heide

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

A discrete and continuous study of the Max-Chain-Formation problem.

Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide

Inf. Comput., 2022

The k-Server with Preferences Problem.

Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility.

Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Distributed Data Streams.

Jannik Castenow, Björn Feldkord, Jonas Hanselle, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

The Max-Line-Formation Problem.

Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide

CoRR, 2021

The Max-Line-Formation Problem - And New Insights for Gathering and Chain-Formation.

Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Gathering a Euclidean Closed Chain of Robots in Linear Time.

Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide

Proceedings of the Algorithms for Sensor Systems, 2021

2020

Gathering Anonymous, Oblivious Robots on a Grid.

Jannik Castenow, Matthias Fischer, Jonas Harbig, Daniel Jung, Friedhelm Meyer auf der Heide

Theor. Comput. Sci., 2020

Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility.

Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide

CoRR, 2020

A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up.

Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility.

Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

The Online Multi-Commodity Facility Location Problem.

Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Local Gathering of Mobile Robots in Three Dimensions.

Michael Braun, Jannik Castenow, Friedhelm Meyer auf der Heide

Proceedings of the Structural Information and Communication Complexity, 2020

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.

Jannik Castenow, Christina Kolb, Christian Scheideler

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2018

Brief Announcement: Competitive Routing in Hybrid Communication Networks.

Daniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Competitive Routing in Hybrid Communication Networks.

Daniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier

Proceedings of the Algorithms for Sensor Systems, 2018

A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.

Markus Benter, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, Jannik Sundermeier

Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017

Monitoring of Domain-Related Problems in Distributed Data Streams.

Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier

Proceedings of the Structural Information and Communication Complexity, 2017