3 citations · 4 across the 4 of their papers we have counts for
8 papers
Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures
Kristian Hinnenthal, David Liedtke, Christian Scheideler
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 determin…
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
Time-Optimal Construction of Overlay Networks
Thorsten Götte, Kristian Hinnenthal, Christian Scheideler +1
We show how to construct an overlay network of constant degree and diameter in time starting from an arbitrary weakly connected graph. We assume a synchrono…
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michael Feldmann, Kristian Hinnenthal, Christian Scheideler
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc conn…
Shortest Paths in a Hybrid Network Model
John Augustine, Kristian Hinnenthal, Fabian Kuhn +2
We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where communication is only possible between spec…
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Kristian Hinnenthal, Christian Scheideler, Martijn Struijs
In this paper we present various distributed algorithms for LP-type problems in the well-known gossip model. LP-type problems include many important classes of problems such as (in…
Distributed Computation in Node-Capacitated Networks
John Augustine, Mohsen Ghaffari, Robert Gmyr +4
In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlyin…
Convex Hull Formation for Programmable Matter
Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal +3
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a des…