@misc{62247,
  author       = {{Werner, Felix}},
  title        = {{{Monoton erreichbarer Delaunaygraph}}},
  year         = {{2025}},
}

@misc{52318,
  author       = {{Dorociak, Svitlana}},
  title        = {{{Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}}},
  year         = {{2024}},
}

@misc{53374,
  author       = {{De Groote, Carsten}},
  title        = {{{A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}}},
  year         = {{2024}},
}

@misc{53373,
  author       = {{Doddegowda, Rajesh}},
  title        = {{{Optimal Drone Strategies For Packet Delivery}}},
  year         = {{2024}},
}

@misc{53372,
  author       = {{Thakur, Heena}},
  title        = {{{Evaluating the Implications}}},
  year         = {{2024}},
}

@misc{55002,
  author       = {{Delgado Steuter, Dominik}},
  title        = {{{Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads }}},
  year         = {{2024}},
}

@misc{55003,
  author       = {{Artmann, Matthias}},
  title        = {{{On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}}},
  year         = {{2024}},
}

@misc{55092,
  author       = {{Eranki, Varun Maitreya}},
  title        = {{{Fever: Optimal Responsive View Synchronisation}}},
  year         = {{2024}},
}

@inproceedings{54807,
  abstract     = {{This paper considers the shape formation problem within the 3D hybrid model, where a single agent with a strictly limited viewing range and the computational capacity of a deterministic finite automaton manipulates passive tiles through pick-up, movement, and placement actions. The goal is to reconfigure a set of tiles into a specific shape termed an icicle. The icicle, identified as a dense, hole-free structure, is strategically chosen to function as an intermediate shape for more intricate shape formation tasks. It is designed for easy exploration by a finite state agent, enabling the identification of tiles that can be lifted without breaking connectivity. Compared to the line shape, the icicle presents distinct advantages, including a reduced diameter and the presence of multiple removable tiles. We propose an algorithm that transforms an arbitrary initially connected tile structure into an icicle in 𝒪(n³) steps, matching the runtime of the line formation algorithm from prior work. Our theoretical contribution is accompanied by an extensive experimental analysis, indicating that our algorithm decreases the diameter of tile structures on average.}},
  author       = {{Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)}},
  editor       = {{Casteigts, Arnaud and Kuhn, Fabian}},
  isbn         = {{978-3-95977-315-7}},
  issn         = {{1868-8969}},
  keywords     = {{Programmable Matter, Shape Formation, 3D Model, Finite Automaton}},
  pages        = {{15:1–15:20}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures}}},
  doi          = {{10.4230/LIPIcs.SAND.2024.15}},
  volume       = {{292}},
  year         = {{2024}},
}

@inbook{54802,
  abstract     = {{Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.}},
  author       = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{Structural Information and Communication Complexity}},
  editor       = {{Emek, Yuval}},
  isbn         = {{9783031606021}},
  issn         = {{0302-9743}},
  keywords     = {{Programmable Matter, Coating, Finite Automaton, 3D}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Universal Coating by 3D Hybrid Programmable Matter}}},
  doi          = {{10.1007/978-3-031-60603-8_21}},
  year         = {{2024}},
}

@inproceedings{64104,
  author       = {{Scheideler, Christian and Hinnenthal , Kristian  and Liedtke, David Jan}},
  title        = {{{Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20}}},
  year         = {{2024}},
}

@inproceedings{64103,
  author       = {{Scheideler, Christian and Padalkin, Andreas}},
  pages        = {{65 -- 75}},
  title        = {{{Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }}},
  year         = {{2024}},
}

@inproceedings{64106,
  author       = {{Scheideler, Christian and Kostitsyna, Irina  and Liedtke, David Jan}},
  title        = {{{Universal Coating by 3D Hybrid Programmable Matter.}}},
  year         = {{2024}},
}

@article{64100,
  author       = {{Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}},
  journal      = {{The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}},
  pages        = {{603 -- 625}},
  title        = {{{The structural power of reconfigurable circuits in the amoebot model. }}},
  year         = {{2024}},
}

@article{64101,
  author       = {{Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}},
  journal      = {{Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}},
  title        = {{{Routing schemes for hybrid communication networks. }}},
  year         = {{2024}},
}

@inproceedings{64102,
  author       = {{Scheideler, Christian and Dou, Jinfeng}},
  publisher    = {{ApPLIED@PODC 2024}},
  title        = {{{Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. }}},
  year         = {{2024}},
}

@inproceedings{64105,
  author       = {{Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }},
  title        = {{{Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. }}},
  year         = {{2024}},
}

@misc{57319,
  author       = {{Raj, Roja}},
  title        = {{{Hexagon Shape Formation in the Amoebot Model with Immobilized Particles}}},
  year         = {{2024}},
}

@article{61172,
  author       = {{Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Routing Schemes for Hybrid Communication Networks}}},
  doi          = {{10.1016/j.tcs.2023.114352}},
  volume       = {{985}},
  year         = {{2024}},
}

@misc{49494,
  author       = {{Nickel, Alexander}},
  title        = {{{Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}}},
  year         = {{2023}},
}