5 papers
Reconfiguration of Temporal Networks under Reachability Constraints
Othon Michail, George Skretas, Georg Tennigkeit +1
Temporal networks model dynamic systems in which edges represent interactions and labels specify when these interactions occur. Examples include transportation networks, time-sensi…
Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
Manish Kumar, Othon Michail, Andreas Padalkin +1
We study centralized reconfiguration problems for geometric amoebot structures. A set of amoebots occupy nodes on the triangular grid and can reconfigure via expansion and cont…
Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
Lutz Oettershagen, Othon Michail
Balancing resource efficiency and fairness is critical in networked systems that support modern learning applications. We introduce the Fair Minimum Labeling (FML) problem: the tas…
Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
Nada Almalki, Siddharth Gupta, Othon Michail +1
Autonomous reconfiguration of agent-based systems is a key challenge in the study of programmable matter, distributed robotics, and molecular self-assembly. While substantial prior…
Recognizing and Realizing Temporal Reachability Graphs
Thomas Erlebach, Othon Michail, Nils Morawietz
A temporal graph can be represented by an underlying graph together with a function that assigns to each edge the set of time steps dur…