default search action
Jannik Castenow
Person information
- affiliation: Paderborn University, Heinz Nixdorf Institute and Computer Science Department, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b1]Jannik Castenow:
Local protocols for contracting and expanding robot formation problems. Paderborn University, Germany, 2023 - [j3]Jannik Castenow
, Jonas Harbig
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. Theor. Comput. Sci. 939: 261-291 (2023) - [c16]Jannik Castenow
Unifying Gathering Protocols for Swarms of Mobile Robots. CIAC 2023: 5-16 - 2022
- [j2]Jannik Castenow
A discrete and continuous study of the Max-Chain-Formation problem. Inf. Comput. 285(Part): 104877 (2022) - [c15]Jannik Castenow, Jonas Harbig
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. OPODIS 2022: 15:1-15:25 - [c14]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The k-Server with Preferences Problem. SPAA 2022: 345-356 - [p1]Jannik Castenow, Björn Feldkord, Jonas Hanselle, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Distributed Data Streams. Algorithms for Big Data 2022: 179-195 - [i10]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The k-Server with Preferences Problem. CoRR abs/2205.11102 (2022) - [i9]Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. CoRR abs/2206.07567 (2022) - 2021
- [c13]Jannik Castenow, Jonas Harbig
Gathering a Euclidean Closed Chain of Robots in Linear Time. ALGOSENSORS 2021: 29-44 - [c12]Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide:
The Max-Line-Formation Problem - And New Insights for Gathering and Chain-Formation. SSS 2021: 289-304 - [i8]Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide:
The Max-Line-Formation Problem. CoRR abs/2109.11856 (2021) - 2020
- [j1]Jannik Castenow, Matthias Fischer, Jonas Harbig
Gathering Anonymous, Oblivious Robots on a Grid. Theor. Comput. Sci. 815: 289-309 (2020) - [c11]Jannik Castenow, Christina Kolb, Christian Scheideler:
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. ICDCN 2020: 14:1-14:10 - [c10]Michael Braun, Jannik Castenow
Local Gathering of Mobile Robots in Three Dimensions. SIROCCO 2020: 63-79 - [c9]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The Online Multi-Commodity Facility Location Problem. SPAA 2020: 129-139 - [c8]Jannik Castenow, Peter Kling
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. SPAA 2020: 515-517 - [c7]Jannik Castenow, Jonas Harbig
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility. SSS 2020: 60-64 - [c6]Jannik Castenow, Peter Kling
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up. SSS 2020: 65-80 - [i7]Michael Braun, Jannik Castenow, Friedhelm Meyer auf der Heide:
Local Gathering of Mobile Robots in Three Dimensions. CoRR abs/2005.07495 (2020) - [i6]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The Online Multi-Commodity Facility Location Problem. CoRR abs/2005.08391 (2020) - [i5]Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem. CoRR abs/2010.02043 (2020) - [i4]Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. CoRR abs/2010.04424 (2020)
2010 – 2019
- 2019
- [c5]Jannik Castenow, Christina Kolb, Christian Scheideler:
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. SIROCCO 2019: 345-348 - 2018
- [c4]Markus Benter, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, Jannik Sundermeier:
A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension. ALGOCLOUD 2018: 46-58 - [c3]Daniel Jung
Competitive Routing in Hybrid Communication Networks. ALGOSENSORS 2018: 15-31 - [c2]Daniel Jung
Brief Announcement: Competitive Routing in Hybrid Communication Networks. SPAA 2018: 231-233 - [i3]Christina Kolb, Christian Scheideler, Jannik Sundermeier:
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. CoRR abs/1810.05453 (2018) - 2017
- [c1]Pascal Bemmann, Felix Biermeier, Jan Bürmann
Monitoring of Domain-Related Problems in Distributed Data Streams. SIROCCO 2017: 212-226 - [i2]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:
Monitoring of Domain-Related Problems in Distributed Data Streams. CoRR abs/1706.03568 (2017) - [i1]Daniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier:
Competitive Routing in Hybrid Communication Networks. CoRR abs/1710.09280 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: