Volume
LIPIcs, Volume 373
5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)
-
Part of:
Series:
Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Algorithmic Foundations of Dynamic Networks (SAND)
Event
Editors
Publication Details
- published at: 2026-06-24
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-427-7
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Complete Volume
LIPIcs, Volume 373, SAND 2026, Complete Volume
Abstract
LIPIcs, Volume 373, SAND 2026, Complete Volume
Cite as
5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 1-380, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Proceedings{mertzios_et_al:LIPIcs.SAND.2026,
title = {{LIPIcs, Volume 373, SAND 2026, Complete Volume}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {1--380},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026},
URN = {urn:nbn:de:0030-drops-267659},
doi = {10.4230/LIPIcs.SAND.2026},
annote = {Keywords: LIPIcs, Volume 373, SAND 2026, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{mertzios_et_al:LIPIcs.SAND.2026.0,
author = {Mertzios, George B. and Richa, Andr\'{e}a W.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.0},
URN = {urn:nbn:de:0030-drops-267589},
doi = {10.4230/LIPIcs.SAND.2026.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Invited Talk
Pattern Formation, Dancing, and Sequential Schedulers (Invited Talk)
Abstract
In theoretical computer science, the study of swarms of autonomous mobile robots has concentrated on computational entities operating in Look–Compute–Move cycles in Euclidean spaces. The computational issues arising in such settings are viewed as due to the interplay between the robots' capabilities and the adversarial power of a scheduler controlling the timing of their activations and the duration of their operations. The focus of research has been on determining the minimal capabilities that allow the robots to solve a given problem under a given adversarial scheduler. Of particular interest is the class of Pattern Formation problems, and its more complex extension - called Dancing - of forming sequences of patterns. We discuss the computational power of the robots operating under Sequential schedulers in relation to Pattern Formation and Dancing, showing that this power is stronger than the obvious capacity of symmetry breaking, and thus of leader election. Recent results are reported.
Cite as
Paola Flocchini. Pattern Formation, Dancing, and Sequential Schedulers (Invited Talk). In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 1:1-1:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{flocchini:LIPIcs.SAND.2026.1,
author = {Flocchini, Paola},
title = {{Pattern Formation, Dancing, and Sequential Schedulers}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {1:1--1:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.1},
URN = {urn:nbn:de:0030-drops-262351},
doi = {10.4230/LIPIcs.SAND.2026.1},
annote = {Keywords: Autonomous mobile robots, Look-Compute-Move, Sequential schedulers, Pattern formation, Sequence of patterns, Computational power}
}
Document
Invited Talk
Supervised Distributed Computing (Invited Talk)
Abstract
I will introduce a new framework for distributed computing called supervised distributed computing that extends and refines the standard master-worker approach of scheduling multi-threaded computations. In this framework, there are different roles: a supervisor, a source, a target, and a collection of workers. Initially, the source stores some instance I of a computational problem, and at the end, the target is supposed to store a correct solution S(I) for that instance. We assume that the computation required for S(I) can be modeled as a directed acyclic graph G = (V,E), where V is a set of tasks and (v,w) ∈ E if and only if task w needs information from task v in order to be executed. Given G, the role of the supervisor is to schedule the execution of the tasks in G by assigning them to the workers. If all workers are honest, the workers have access to the source and target, and information can be exchanged directly between the workers, the supervisor only needs to know G to successfully schedule the computations. I.e., the supervisor does not have to handle any data itself like in standard master-worker approaches, which has the tremendous benefit that tasks can be run massively in parallel in large distributed environments without the supervisor becoming a bottleneck. But what if some of the workers are adversarial? Interestingly, I will show that under certain assumptions a data-agnostic scheduling approach would even work in an adversarial setting where the majority of workers is adversarial while keeping the work overhead for the honest workers close to the case that all workers are honest. The details of our results can be found in [John Augustine et al., 2026; John Augustine et al., 2025]
Cite as
Christian Scheideler. Supervised Distributed Computing (Invited Talk). In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{scheideler:LIPIcs.SAND.2026.2,
author = {Scheideler, Christian},
title = {{Supervised Distributed Computing}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.2},
URN = {urn:nbn:de:0030-drops-262363},
doi = {10.4230/LIPIcs.SAND.2026.2},
annote = {Keywords: Distributed algorithms, task scheduling, client-server model}
}
Document
Invited Talk
More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems (Invited Talk)
Abstract
Extracting maximum performance from a limited pool of parallel compute resources remains a central challenge. In this paper, we show an optimization technique that allows certain distributed systems to attain faster-than-linear (superlinear) performance improvement with only a linear scaling of the worker pool. Our insight is that (1) dispatching jobs to parallel workers so that the locality of reference in the workers' input increases and (2) implementing the workers with a self-adjusting algorithm to take advantage of the higher locality can yield superlinear scaling in many practical applications. First, we demonstrate our technique in simulations: by scaling textbook self-adjusting algorithms, we obtain 100-3,300x speedup using only 48 CPU cores - up to 70x beyond linear scaling. After that, we re-engineer the default Linux packet classifier to attain a 5-25x raw performance improvement as compared to the vanilla kernel. We demonstrate 800x speedup on synthetic traces and 220x speedup on real firewall traces with 32 CPU cores. Given these insights, we develop a formal model and a set of design guidelines to help understand the applicability of our optimization strategy for particular distributed system workloads.
Cite as
Jonas Köppeler, Maciej Pacut, Tamás Lévai, Vamsi Addanki, Stefan Schmid, and Gábor Rétvári. More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems (Invited Talk). In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 3:1-3:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{koppeler_et_al:LIPIcs.SAND.2026.3,
author = {K\"{o}ppeler, Jonas and Pacut, Maciej and L\'{e}vai, Tam\'{a}s and Addanki, Vamsi and Schmid, Stefan and R\'{e}tv\'{a}ri, G\'{a}bor},
title = {{More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {3:1--3:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.3},
URN = {urn:nbn:de:0030-drops-262377},
doi = {10.4230/LIPIcs.SAND.2026.3},
annote = {Keywords: self-adjusting systems, superlinear scaling, packet classification}
}
Document
Families of Tractable Problems with Respect to Vertex-Interval-Membership Width and Its Generalisations
Abstract
Temporal graphs are graphs whose edges are labelled with times at which they are active. Their time-sensitivity provides a useful model of real networks, but renders many problems studied on temporal graphs more computationally complex than their static counterparts. To contend with this, there has been recent work devising parameters for which temporal problems become tractable. One such parameter is vertex-interval-membership (VIM) width. Broadly, this gives a bound on the number of vertices we need to keep track of at any given time to solve many problems. Our contributions are two-fold. Firstly, we introduce a new parameter, tree-interval-membership (TIM) width, that generalises both VIM width and several existing generalisations. Secondly, we provide meta-algorithms for both VIM and TIM width which can be used to prove fixed-parameter-tractability for large families of problems, bypassing the need to give involved dynamic programming arguments for every problem. In doing this, we provide a characterisation of problems in FPT with respect to both parameters. We apply these algorithms to temporal versions of Hamiltonian path, dominating set, matching, and edge deletion to limit maximum reachability.
Cite as
Jessica Enright, Samuel D. Hand, Laura Larios-Jones, and Kitty Meeks. Families of Tractable Problems with Respect to Vertex-Interval-Membership Width and Its Generalisations. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{enright_et_al:LIPIcs.SAND.2026.4,
author = {Enright, Jessica and Hand, Samuel D. and Larios-Jones, Laura and Meeks, Kitty},
title = {{Families of Tractable Problems with Respect to Vertex-Interval-Membership Width and Its Generalisations}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.4},
URN = {urn:nbn:de:0030-drops-262386},
doi = {10.4230/LIPIcs.SAND.2026.4},
annote = {Keywords: Graph algorithms, Parameterized Algorithms, Temporal Graphs}
}
Document
Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems
Abstract
Temporal graphs arise when modeling interactions that evolve over time. They usually come in several flavors, depending on the number of parameters used to describe the temporal aspects of the interactions: time of appearance, duration, delay of transmission. In the point model, edges appear at specific points in time, whereas in the more general interval model, edges can be present over specific time intervals. In both models, the delay for traversing an edge can change with each edge appearance. When time is discrete, the two models are equivalent in the sense that the presence of an edge during an interval is equivalent to a sequence of point-in-time occurrences of the edge. However, this transformation can drastically change the size of the input and has implications for complexity. Indeed, we show a gap between the two models with respect to the complexity of the classical problem of computing a fastest temporal path from a source vertex to a target vertex, i.e., a path where edges can be traversed one after another in time and such that the total duration from source to target is minimized. It can be solved in near-linear time in the point model, while we show that the interval model requires quadratic time under classical assumptions of fine-grained complexity. With respect to linear time, our lower bound implies a factor of the number of vertices, while the best known algorithm has a factor of the number of underlying edges. We also show a similar complexity gap for computing a shortest temporal path, i.e., a temporal path with a minimum number of edges. Here our lower bound matches known upper bounds up to a logarithmic factor. Interestingly, we show that near-linear time for fastest temporal path computation is possible in the interval model when it is restricted to uniform delay zero, i.e., when traversing an edge is instantaneous. However, this special case is not exempt from our lower bound for shortest temporal path computation. These two results should be contrasted with the computation of a foremost temporal path, i.e., a temporal path that arrives as early as possible. It is well known that this computation can be solved in near-linear time in both models. We also show that there is no gap in testing the all-to-all temporal connectivity of a temporal graph. We demonstrate a quadratic lower bound that applies to both the interval and point models and aligns with the existing upper bounds.
Cite as
Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, and Laurent Viennot. Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 5:1-5:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{aubian_et_al:LIPIcs.SAND.2026.5,
author = {Aubian, Guillaume and Brunelli, Filippo and Dragan, Feodor F. and Ducoffe, Guillaume and Habib, Michel and Ibiapina, Allen and Viennot, Laurent},
title = {{Complexity Gaps Between Point and Interval Temporal Graphs for Some Reachability Problems}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {5:1--5:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.5},
URN = {urn:nbn:de:0030-drops-262395},
doi = {10.4230/LIPIcs.SAND.2026.5},
annote = {Keywords: Temporal graphs, Dynamic networks, Time-dependent networks, Temporal connectivity, Foremost, Fastest or Shortest temporal path, Fine-grained complexity}
}
Document
Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results
Abstract
The broadcast problem is the task of disseminating a message from a single source node to all other nodes in a distributed system, ensuring that every node eventually receives the message despite possible network constraints such as delays, failures, or limited topology knowledge. In this work, we consider the broadcast problem in anonymous, synchronous, dynamic networks. A dynamic network is a network, whose topology changes over time, meaning that communication links can unpredictably appear and disappear. We present a randomized algorithm requiring O(log log n) bits of storage per node and terminating in O(m log n) rounds with high probability. It solves broadcast with stabilizing termination for anonymous, synchronous, 1-interval-connected networks using messages of size O(1). The algorithm is a non-idle-start algorithm. The best known idle-start algorithm for this problem requires O(log n) space, also a lower memory bound of ω(1) space is known. Our contribution affirmatively answers a question of Parzych and Daymude (DISC 2024). We also extend this result to dynamic networks with bounded connectivity time. Furthermore, we prove that for two variants of the broadcast problem in this setting no randomized algorithms exist.
Cite as
Volker Turau. Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{turau:LIPIcs.SAND.2026.6,
author = {Turau, Volker},
title = {{Broadcasts in Anonymous, Dynamic Networks: A New Algorithm and Impossibility Results}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.6},
URN = {urn:nbn:de:0030-drops-262408},
doi = {10.4230/LIPIcs.SAND.2026.6},
annote = {Keywords: Distributed algorithms, dynamic networks, randomized algorithms, impossibility results}
}
Document
Extending Ghouila-Houri’s Characterization of Comparability Graphs to Temporal Graphs
Abstract
An orientation of a static graph is called transitive if for any three vertices a,b,c, the presence of arcs (a,b) and (b,c) forces the presence of arc (a,c). If only the presence of an arc between a and c is required, but its orientation is unconstrained, the orientation is called quasi-transitive. A fundamental result due to Ghouila-Houri [Ghouila-Houri, 1962] states that any static graph admitting a quasi-transitive orientation also admits a transitive orientation. In a seminal work [Mertzios et al., 2025], Mertzios et al. introduced the notion of temporal transitivity in order to model information flows in simple temporal networks. We revisit the model introduced by Mertzios et al. and propose an analogous to Ghouila-Houri’s characterization for the temporal scenario. We present a structural theorem that will allow us to express by a 2-SAT formula all the constraints imposed on a temporal graph for it to admit a temporal transitive orientation. The latter produces an efficient recognition algorithm for graphs admitting such orientations, that we will call comparability temporal graphs. Inspired by the lexicographic strategy presented by Hell and Huang in [Hell and Huang, 1995] to transitively orient static graphs, we then propose an algorithm for constructing a temporal transitive orientation of a YES instance. This algorithm is straightforward and has a running-time complexity of O(nm + min{kn,m²}), with n, m and k being respectively the number of vertices, edges and monolabel triangles, i.e., triangles having the same unique time-label on their edges, in the temporal graph. This represents an improvement compared to the algorithm presented in [Mertzios et al., 2025]. Additionally, we extend the temporal transitivity model to temporal graphs having multiple time-labels associated to their edges and claim that the previous results hold in the multilabel setting. Finally, we propose a characterization of comparability temporal graphs by forbidden temporal ordered patterns.
Cite as
Pierre Charbit, Michel Habib, and Amalia Sorondo. Extending Ghouila-Houri’s Characterization of Comparability Graphs to Temporal Graphs. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{charbit_et_al:LIPIcs.SAND.2026.7,
author = {Charbit, Pierre and Habib, Michel and Sorondo, Amalia},
title = {{Extending Ghouila-Houri’s Characterization of Comparability Graphs to Temporal Graphs}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.7},
URN = {urn:nbn:de:0030-drops-262416},
doi = {10.4230/LIPIcs.SAND.2026.7},
annote = {Keywords: Temporal graphs, Transitive orientations, Graph algorithms}
}
Document
Asynchronous Rendezvous of Anonymous Deterministic Mobile Automata in the Plane
Abstract
Two mobile agents, modeled as points moving in the plane, have to meet at some point. Computationally, agents are identical deterministic finite automata. Each agent has a compass showing the cardinal directions. Agents start at two different points, chosen by the adversary. Each agent makes a series of moves. Before each move it takes a snapshot, which is the disc of radius 1 centered at the current position of the agent. This snapshot is an input that causes the automaton to possibly change state and make the next move in a chosen direction at a chosen distance. Moves of the agents are asynchronous: the adversary controls the possibly variable speed of an agent during each move. Without the possibility of leaving marks, meeting is often impossible, e.g. if agents start simultaneously at a distance larger than 1 and move at the same speed. Hence we allow the agents to use movable pebbles. All pebbles used by an agent are identical and they differ between the agents. A pebble of an agent can be dropped by it, and later possibly picked up again.
Our main result shows that, using a constant number of pebbles, deterministic rendezvous is always possible, regardless of the actions of the asynchronous adversary. The cost of a rendezvous algorithm executed by the agents is the worst-case length of the trajectory of both agents, over all adversary’s decisions. We show that our rendezvous algorithm has cost O(D²), if the initial positions of the agents are at a distance at most D. This complexity is optimal.
As a by-product, we obtain the solution of the leader election problem between two anonymous agents modeled as automata asynchronously navigating in the plane.
Cite as
Mohamed Anouar Baaziz and Andrzej Pelc. Asynchronous Rendezvous of Anonymous Deterministic Mobile Automata in the Plane. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{baaziz_et_al:LIPIcs.SAND.2026.8,
author = {Baaziz, Mohamed Anouar and Pelc, Andrzej},
title = {{Asynchronous Rendezvous of Anonymous Deterministic Mobile Automata in the Plane}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.8},
URN = {urn:nbn:de:0030-drops-262422},
doi = {10.4230/LIPIcs.SAND.2026.8},
annote = {Keywords: Asynchronous, rendezvous, deterministic finite automaton, pebble, plane, mobile agent}
}
Document
FO and MSO Model Checking on Temporal Graphs
Abstract
Algorithmic meta-theorems provide an important tool for showing tractability of graph problems on graph classes defined by structural restrictions. While such results are well established for static graphs, corresponding frameworks for temporal graphs are comparatively limited.
In this work, we revisit past applications of logical meta-theorems to temporal graphs and develop an extended unifying logical framework. Our first contribution is the introduction of logical encodings for the parameters vertex-interval-membership width (vim) and tree-interval-membership width (tim), parameters that capture the signature of vertex and component activity over time. Building on this, we extend existing monadic second-order (MSO) meta-theorems for bounded lifetime and temporal total degree to the parameters vim and tim, and establish novel first-order (FO) meta-theorems for all four parameters.
Finally, we signpost a modular lexicon of reusable FO and MSO formulas for a broad range of temporal graph problems, and give an example. This lexicon allows new problems to be expressed compositionally and directly yields fixed-parameter tractability results across the four parameters we consider.
Cite as
Michelle Döring, Jessica Enright, Laura Larios-Jones, and George Skretas. FO and MSO Model Checking on Temporal Graphs. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{doring_et_al:LIPIcs.SAND.2026.9,
author = {D\"{o}ring, Michelle and Enright, Jessica and Larios-Jones, Laura and Skretas, George},
title = {{FO and MSO Model Checking on Temporal Graphs}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.9},
URN = {urn:nbn:de:0030-drops-262430},
doi = {10.4230/LIPIcs.SAND.2026.9},
annote = {Keywords: temporal graphs, dynamic graphs, time-varying graphs, parameterized complexity, logic, meta-theorems, monadic second-order logic, first-order logic, treewidth, planar, nowhere dense, lifetime, temporal total degree, vertex-interval membership width, tree-interval membership width}
}
Document
Asymptotic Subspace Consensus in Dynamic Networks
Abstract
We introduce the problem of asymptotic subspace consensus, which requires the outputs of processes to converge onto a common subspace while remaining inside the convex hull of initial vectors. This is a relaxation of asymptotic consensus in which outputs have to converge to a single point, i.e., a zero-dimensional affine subspace.
We give a complete characterization of the solvability of asymptotic subspace consensus in oblivious message adversaries. In particular, we show that a large class of algorithms used for asymptotic consensus gracefully degrades to asymptotic subspace consensus in distributed systems with weaker assumptions on the communication network. We also present bounds on the rate by which a lower-than-initial dimension is reached.
Cite as
Matthias Függer and Thomas Nowak. Asymptotic Subspace Consensus in Dynamic Networks. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{fugger_et_al:LIPIcs.SAND.2026.10,
author = {F\"{u}gger, Matthias and Nowak, Thomas},
title = {{Asymptotic Subspace Consensus in Dynamic Networks}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.10},
URN = {urn:nbn:de:0030-drops-262443},
doi = {10.4230/LIPIcs.SAND.2026.10},
annote = {Keywords: Averaging, dynamic networks, consensus, higher dimensional}
}
Document
Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
Abstract
We study centralized reconfiguration problems for geometric amoebot structures. A set of n amoebots occupy nodes on the triangular grid and can reconfigure via expansion and contraction operations. We focus on the joint movement extension, where amoebots may expand and contract in parallel, enabling coordinated motion of larger substructures. Prior work introduced this extension and analyzed reconfiguration under additional assumptions such as metamodules, i.e., collections of modules that act as a single unit.
In contrast, we investigate the intrinsic dynamics of reconfiguration without such assumptions by restricting attention to centralized algorithms, leaving distributed solutions for future work. We study the reconfiguration problem between two classes of amoebot structures A and B: For every structure S ∈ A, the goal is to compute a schedule that reconfigures S into some structure S' ∈ B. Our focus is on sublinear-time algorithms.
We affirmatively answer the open problem by Padalkin et al. (Auton. Robots, 2025) whether a within-the-model sublinear-time universal reconfiguration algorithm is possible, by proving that any structure can be reconfigured into a canonical line-segment structure in O(√nlog n) rounds. Additionally, we give a constant-time algorithm for reconfiguring any spiral structure into a line segment. These results are enabled by new constant-time primitives that facilitate efficient parallel movement. Our findings demonstrate that the joint movement model supports sublinear reconfiguration without auxiliary assumptions. A central open question is whether universal reconfiguration within this model can be achieved in polylogarithmic or even constant time.
Cite as
Manish Kumar, Othon Michail, Andreas Padalkin, and Christian Scheideler. Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{kumar_et_al:LIPIcs.SAND.2026.11,
author = {Kumar, Manish and Michail, Othon and Padalkin, Andreas and Scheideler, Christian},
title = {{Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.11},
URN = {urn:nbn:de:0030-drops-262458},
doi = {10.4230/LIPIcs.SAND.2026.11},
annote = {Keywords: amoebot model, programmable matter, modular robot system, reconfiguration}
}
Document
Nanobot Algorithms for Treatment of Diffuse Cancer
Abstract
We consider the problem of a swarm of nanobots detecting and treating human cancer that is diffuse, that is, dispersed in a region with multiple separate cancer sites in need of treatment. We present a mathematical model of nanobots and their colloidal environment that is inspired by actual chemotactic nanoparticles, involving agents noisily following chemical gradients (both attractively and repellently, depending on the chemical). We present three incrementally sophisticated algorithms that describe additional chemical payloads that agents carry onboard, beyond the cancer-treating drug K, as well as the rules for when agents drop their payloads: Algorithm KM, in which agents simply ascend naturally existing chemical M signals that surround cancer sites; Algorithm KMA, in which agents themselves amplify these natural signals by dropping chemical A payloads upon reaching a site; and Algorithm KMAR, in which agents choose to either amplify the signal by dropping chemical A or counteract/reduce the signal by dropping chemical R, according to the current unsatisfied demand of the site. We present simulation results for all of the algorithms, across a set of distinct cancer arrangements, that track both the achieved treatment success as well as the time/duration of the treatment. KM has generally successful treatment unless the natural M-signals are weak, in which case the treatment progresses too slowly. KMA demonstrates a significant speedup in treatment time (over KM), but also a drop in success except for the most concentrated cancer patterns. KMAR has relatively optimal performance across all types of cancer patterns, demonstrating robustness and adaptability in its mechanisms for nanobot coordination.
Cite as
Noble C. Harasha and Nancy Lynch. Nanobot Algorithms for Treatment of Diffuse Cancer. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{harasha_et_al:LIPIcs.SAND.2026.12,
author = {Harasha, Noble C. and Lynch, Nancy},
title = {{Nanobot Algorithms for Treatment of Diffuse Cancer}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.12},
URN = {urn:nbn:de:0030-drops-262469},
doi = {10.4230/LIPIcs.SAND.2026.12},
annote = {Keywords: Nanobots, biological modeling, distributed algorithms, agent-based models, random walks, cancer detection, cancer treatment}
}
Document
Online Algorithms for Set Packing with Renewable Capacities
Abstract
We propose and study a new extension of the classical set packing problem, which we call the online D-set packing with renewable capacities (D-SPaRC) problem. In the D-SPaRC setting, there is a collection of resources with associated capacities. Requests arrive one by one, and for each request, a decision has to be made to accept it or not before seeing future requests. Each request is associated with a collection of subsets of resources, with each subset having cardinality at most D. When accepting a request, exactly one of these subsets must be chosen, which consumes one unit of capacity on each of the involved resources. Over time, the available resource capacities may be renewed, allowing additional requests to be accepted. Many online problems, including packing, routing, and scheduling, can be formulated as a D-SPaRC problem, thus underlining its usefulness.
We first present a simple greedy algorithm that is O(ĉ_min ⋅ (D^{1/ĉ_min}-1))-competitive for D ≥ 2 and 3-competitive if D = 1, where ĉ_min is the minimum capacity of the resources. We then show that, for ĉ_min = Ω(log D), the greedy algorithm can be extended to an online algorithm with predictions whose competitive ratio is never worse than that of the original greedy approach and can, in fact, be reduced to a constant when the predictions are optimal. Finally, we generalize the D-SPaRC problem in two meaningful ways, namely by addressing non-uniform request priorities and by handling requests with non-uniform weights.
Cite as
Anya Chaturvedi, William K. Moses Jr., Christian Scheideler, and Prudence W. H. Wong. Online Algorithms for Set Packing with Renewable Capacities. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{chaturvedi_et_al:LIPIcs.SAND.2026.13,
author = {Chaturvedi, Anya and Moses Jr., William K. and Scheideler, Christian and Wong, Prudence W. H.},
title = {{Online Algorithms for Set Packing with Renewable Capacities}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.13},
URN = {urn:nbn:de:0030-drops-262472},
doi = {10.4230/LIPIcs.SAND.2026.13},
annote = {Keywords: Set packing, online algorithms, learning-augmented algorithms}
}
Document
Robust Temporal Cut
Abstract
In this paper we introduce the Robust Temporal Cut problem (RTC) defined as follows: For a given temporal graph with designated source node s and destination node z, and parameters δ and k, remove a minimum number of time edges so that, even if an adversary can adjust the time labels of up to k of the remaining time edges by adding or subtracting values bounded by δ, no temporal s-z path exists. We study the classical and parameterized complexity of RTC. In particular, we show for both strict and non-strict temporal paths that RTC is NP-complete for any combination of k ≥ 1 and δ ≥ 1 and W[1]-hard for parameter solution size or vertex interval membership width plus pathwidth of the underlying graph. Furthermore, we give approximation algorithms and FPT algorithms for parameters including temporal neighborhood diversity plus solution size, timed vertex cover size, and vertex cover size of the underlying graph plus solution size.
Cite as
Jessica Enright, Thomas Erlebach, Kitty Meeks, and Nils Morawietz. Robust Temporal Cut. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{enright_et_al:LIPIcs.SAND.2026.14,
author = {Enright, Jessica and Erlebach, Thomas and Meeks, Kitty and Morawietz, Nils},
title = {{Robust Temporal Cut}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.14},
URN = {urn:nbn:de:0030-drops-262480},
doi = {10.4230/LIPIcs.SAND.2026.14},
annote = {Keywords: temporal graphs, minimum cut, parameterized complexity, FPT algorithms}
}
Document
Designing Sparse Temporal Graphs Satisfying Connectivity Requirements
Abstract
Connectivity of temporal graphs has been widely studied both as graph theory and as gossip theory. In particular, it is well known that in order to connect every vertex to every other, a temporal graph needs to have at least 2n-4 edges where n is the number of vertices. This paper investigates the optimal number of edges required to satisfy partial connectivity requirements. We introduce the problem of Connectivity Request Satisfaction where we are given a directed graph that we call the request graph, where an arc from u to v means that we need to be able to go from u to v. Our goal is to build a temporal graph on the same vertex set with as few temporal edges as possible that would satisfy all the requests. When the graph we build is directed, we prove that the number of temporal arcs required is n-cc+dfvs where cc is the number of connected component of the request graph and dfvs is the size of its smallest directed feedback vertex set. It follows that the problem is NP-complete but inherits fixed parameter tractability properties of Directed Feedback Vertex Set. When the graph we build is undirected, we establish a characterization of strongly connected request graphs that admit a solution with n-1 edges: it is possible if and only if any set of pairwise non-vertex-disjoint closed walks all share a common vertex. We prove that this criteria can be tested in polynomial time.
Cite as
Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier, and Raphaëlle Maistre-Matus. Designing Sparse Temporal Graphs Satisfying Connectivity Requirements. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{bellitto_et_al:LIPIcs.SAND.2026.15,
author = {Bellitto, Thomas and Popper, Jules Bouton and Cauvi, Justine and Escoffier, Bruno and Maistre-Matus, Rapha\"{e}lle},
title = {{Designing Sparse Temporal Graphs Satisfying Connectivity Requirements}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.15},
URN = {urn:nbn:de:0030-drops-262499},
doi = {10.4230/LIPIcs.SAND.2026.15},
annote = {Keywords: Temporal Graphs, Connectivity, Gossiping, Network Design}
}
Document
On Sufficient Conditions for Short Journeys in Temporal Graphs
Abstract
A temporal graph is defined as a sequence (G₁, G₂, …, G_L) of static graphs on a common set of n vertices. A strict journey in a temporal graph is the temporal analogue of a path in a static graph, in which at most one edge may be traversed at each time step.
There exists a notable connection between the existence of paths in static graphs and the existence of strict journeys in specific temporal graphs. A well-known folklore result, commonly referred to as the Reachability Lemma, states that for two vertices u and v, if there are at least n-1 time steps during which a path connects u and v, then a strict journey from u to v exists.
Our main theorem extends this lemma. Under the same assumptions as those of the Reachability Lemma, we prove that a strict journey from u to v exists and the number of edges traversed by such a journey admits a non-trivial upper bound. Furthermore, this bound converges toward the average length of the paths connecting u and v as the number of such paths increases. A corresponding lower bound is also established.
In the second part of this work, we investigate the setting in which every path connecting vertices u and v has length at most a given integer k. For an integer b ≥ k, we characterize the sufficient number of time steps containing such a path that guarantees the existence of a journey from u to v traversing at most b edges. We derive an upper bound of ⌊(n-k-1)/(b-k+1) ⋅ (b-1)⌋ + k, and a lower bound of ⌊(n-k-1)/(b -k+1)⌋ ⋅ (b-1) + r + k-1, where r = (n-k-1 mod (b-k+1)). Finally, we present several applications of the first theorem, with particular emphasis on always connected temporal graphs, that is, temporal graphs where at each time step the graph is connected.
Cite as
David Ilcinkas, Nils Morawietz, and Antoine Toullalan. On Sufficient Conditions for Short Journeys in Temporal Graphs. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{ilcinkas_et_al:LIPIcs.SAND.2026.16,
author = {Ilcinkas, David and Morawietz, Nils and Toullalan, Antoine},
title = {{On Sufficient Conditions for Short Journeys in Temporal Graphs}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.16},
URN = {urn:nbn:de:0030-drops-262502},
doi = {10.4230/LIPIcs.SAND.2026.16},
annote = {Keywords: Graph Theory, Temporal Graph, Temporal Graph Exploration}
}
Document
Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
Abstract
Given a directed, discrete-time temporal graph G = (V,R), a start node s ∈ V, and p ≥ 1 objectives, the single-source multiobjective temporal shortest path problem asks, for each v ∈ V, for the set of nondominated images of temporal s-v-paths together with a corresponding efficient path for each image. A recent general label setting algorithm for this problem relies on two properties of the objectives-monotonicity and isotonicity. Monotonicity generalizes the nonnegativity assumption required by label setting methods for the classical additive single-objective shortest path problem on static graphs, while isotonicity ensures that the order of the objective values of two paths is preserved when both are extended by the same arc.
In this paper, we study the problem without assuming monotonicity and/or isotonicity. A key difficulty in this setting is that zero-duration temporal cycles may need to be traversed an arbitrary finite number of times to generate all nondominated images. This motivates the study of a restricted problem variant in which a maximum admissible path length K is imposed, and only paths containing at most K arcs are considered. We develop general label correcting algorithms for this setting and establish several sufficient conditions under which such a bound is not required, implying that the algorithms compute all nondominated images.
Cite as
Edina Marica, Clemens Thielen, and Alina Wittmann. Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{marica_et_al:LIPIcs.SAND.2026.17,
author = {Marica, Edina and Thielen, Clemens and Wittmann, Alina},
title = {{Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.17},
URN = {urn:nbn:de:0030-drops-262518},
doi = {10.4230/LIPIcs.SAND.2026.17},
annote = {Keywords: temporal graphs, multiobjective optimization, shortest paths, label correcting algorithm}
}
Document
Searching for an Eventually-Emerging Black Hole in Rings
Abstract
We study a novel variant of the Black Hole Search (BHS) problem where the black hole, a node that silently destroys visiting agents, can appear at any time during execution, rather than being present initially, as is assumed in all previous work. Our focus is on ring networks, and we examine this variant of the BHS problem under various assumptions, including whether the ring size is known and whether agents can use pebbles for marking nodes.
For synchronous agents, we provide four solutions: (1) a 4-agent algorithm for rings without additional assumptions, (2) a 3-agent algorithm assuming known ring size, (3) a 3-agent algorithm using pebbles, and (4) a 3-agent solution without additional assumptions but having a quadratic time complexity. For asynchronous agents, we develop two algorithms: one using n agents without additional assumptions, and another using only 4 agents with pebbles.
Cite as
François Bonnet, Quentin Bramas, and Anissa Lamani. Searching for an Eventually-Emerging Black Hole in Rings. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{bonnet_et_al:LIPIcs.SAND.2026.18,
author = {Bonnet, Fran\c{c}ois and Bramas, Quentin and Lamani, Anissa},
title = {{Searching for an Eventually-Emerging Black Hole in Rings}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.18},
URN = {urn:nbn:de:0030-drops-262527},
doi = {10.4230/LIPIcs.SAND.2026.18},
annote = {Keywords: Black hole search, mobile agent, distributed computing}
}
Document
Minimize the Sum of Waiting Times in Periodic Temporal Trees
Abstract
We introduce and analyze the problem of finding a Δ-labeling λ for an undirected tree G = (V,E), such that the sum of overall waiting times of fastest paths between all vertex pairs is minimized in the Δ-periodic temporal graph (G,λ). That is, we aim to minimize ∑_{(u,v) ∈ V×V} (dur(u,v)-dist(u,v)), where dur(u,v) is the duration of a fastest temporal path from u to v and dist(u,v) is the length of the shortest path between u and v in G. We show that this objective function essentially boils down to a known problem about partitioning a set of natural numbers that has applications in scheduling. From that problem we lift and adapt several upper and lower bounds for our problem. For example, we show that the problem admits an EPTAS, that is, an algorithm that can compute a (1+ε)-approximation to our problem in time f(1/ε) ⋅ n^𝒪(1) for each ε > 0. To the best of our knowledge, this is the first example of an efficient approximation algorithm for a temporal graph realization problem.
Cite as
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann, and Klaus Reinhardt. Minimize the Sum of Waiting Times in Periodic Temporal Trees. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{meusel_et_al:LIPIcs.SAND.2026.19,
author = {Meusel, Julia and Morawietz, Nils and M\"{u}ller-Hannemann, Matthias and Reinhardt, Klaus},
title = {{Minimize the Sum of Waiting Times in Periodic Temporal Trees}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.19},
URN = {urn:nbn:de:0030-drops-262531},
doi = {10.4230/LIPIcs.SAND.2026.19},
annote = {Keywords: graph realization, fastest temporal path, periodic temporal graphs}
}
Document
Brief Announcement
Brief Announcement: Exploration of Always S-Connected Temporal Graphs
Abstract
Temporal graphs are a generalisation of (static) graphs, defined by a sequence of snapshots, each a static graph defined over a common set of vertices. Exploration problems are one of the most fundamental and most heavily studied problems on temporal graphs, asking if a set of m agents can visit every vertex in the graph, with each agent only allowed to traverse a single edge per snapshot. In this paper, we introduce and study always S-connected temporal graphs, a generalisation of always-connected temporal graphs where, rather than forming a single connected component in each snapshot, we have at most |S| components, each defined by the connection to at least one vertex in the set S. We use the model of always S-connected temporal graphs to study subgraphs of always-connected temporal graphs, with motivation coming from networks with a small number of "choke-points", such as rail networks, where all external traffic into a subnetwork comes from a limited number of external connections. We show that an always S-connected temporal graph with m = |S| and an average degree of Δ can be explored by m agents in O(n^{3/2} m³ Δ^{3/2} log^{3/2}(n)) snapshots, and, using this result as a subroutine, we show that any always-connected temporal graph with treewidth at most k can be explored by a single agent in O(n^{4/3} k^{11/2} log^{5/2}(n)) snapshots.
Cite as
Duncan Adamson and Paul G Spirakis. Brief Announcement: Exploration of Always S-Connected Temporal Graphs. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 20:1-20:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{adamson_et_al:LIPIcs.SAND.2026.20,
author = {Adamson, Duncan and Spirakis, Paul G},
title = {{Brief Announcement: Exploration of Always S-Connected Temporal Graphs}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {20:1--20:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.20},
URN = {urn:nbn:de:0030-drops-262542},
doi = {10.4230/LIPIcs.SAND.2026.20},
annote = {Keywords: Temporal Graphs, Graph Exploration, Treewidth}
}
Document
Brief Announcement
Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch
Abstract
In this work, we revisit Stretched Periodic Temporal Graph Realization (STGR) which was recently introduced by Mertzios et al. [MFCS 2025]. Here, the input consists of an undirected graph G = (V,E), a period Δ, and a rational number α ≥ 1, and the question is, whether there is a labeling λ: E → [0,Δ-1], such that the stretch is at most α in the Δ-periodic temporal graph (G,λ), that is, the temporal graph, where for each c ∈ ℕ and each edge e, e appears at time c⋅ Δ + i if and only if λ(e) = i. The stretch of (G,λ) is the maximum stretch between any vertex pair (u,v) in (G,λ), where the stretch of a vertex pair (u,v) is defined as the duration of a fastest temporal path from u to v in (G,λ) divided by the distance between these vertices in the underlying graph. We complete the complexity picture for STGR with respect to Δ by investigating the open case of Δ = 2. It turns out that STGR is NP-hard for each Δ > 1. Moreover, we also answer the open question by Mertzios et al. on whether there are graphs for which the smallest possible stretch is larger than (Δ+1)/2. We show not only that such graphs exist, but also that it remains NP-hard to decide whether the optimal stretch is at most (Δ+1)/2. Our hardness results for Δ = 2 also imply hardness for Δ = 2 for the Fastest Periodic Temporal Graph Realization problem that was introduced by Klobas et al. [TCS 2025]. Finally, we show the existence of classes of graphs with small and large stretch.
Cite as
Julia Meusel, Nils Morawietz, Matthias Müller-Hannemann, and Klaus Reinhardt. Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 21:1-21:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{meusel_et_al:LIPIcs.SAND.2026.21,
author = {Meusel, Julia and Morawietz, Nils and M\"{u}ller-Hannemann, Matthias and Reinhardt, Klaus},
title = {{Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {21:1--21:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.21},
URN = {urn:nbn:de:0030-drops-262556},
doi = {10.4230/LIPIcs.SAND.2026.21},
annote = {Keywords: fastest temporal path, periodic temporal graphs, graph realization}
}
Document
Brief Announcement
Brief Announcement: Time-Travel Planning with Tenet Turnstiles
Abstract
We study routing in dynamic graphs when an agent may use backward time travel (BTT) devices. Minimizing delay (arrival time minus departure time) is the primary objective; the number of time inversions is the secondary cost. Building on the framework of Bramas et al., we introduce two space-time online settings - ST-online-easy and ST-online-hard - and analyze the Tenet model, where BTT is performed by entering a turnstile that reverses the direction of time flow. We obtain a polynomial-time offline algorithm, tight competitive ratios for the T-online and S-online settings, a tight quadratic competitive ratio for ST-online-easy, and we prove that no finite competitive ratio exists for ST-online-hard.
Cite as
Thibaut Blanc, Quentin Bramas, Jean-Romain Luttringer, and Sébastien Tixeuil. Brief Announcement: Time-Travel Planning with Tenet Turnstiles. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 22:1-22:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{blanc_et_al:LIPIcs.SAND.2026.22,
author = {Blanc, Thibaut and Bramas, Quentin and Luttringer, Jean-Romain and Tixeuil, S\'{e}bastien},
title = {{Brief Announcement: Time-Travel Planning with Tenet Turnstiles}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {22:1--22:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.22},
URN = {urn:nbn:de:0030-drops-262566},
doi = {10.4230/LIPIcs.SAND.2026.22},
annote = {Keywords: dynamic graphs, time travel, online algorithms}
}
Document
Brief Announcement
Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes
Abstract
We consider the problem of finding the value of a maximum flow over time in a network with uniform edge lengths where the edge capacities change over time. We assume that the capacity of every edge in the network is a piecewise constant function and parameterize the running time of our algorithm by the total number of pieces in the capacity functions across all edges, denoted μ. The key technical component in our approach is a condensed version of a Time Expanded Network (that we call a cTEN) whose classical max flow value is the same as the max flow over time on the original network. We show that a graph with n nodes, m edges, and μ capacity changes, admits a cTEN with O(n²μ) nodes and O(μ mn) edges. This implies that the problem can be solved in O(μ²n³m) time using the combinatorial max flow algorithm of Orlin [Orlin, 2013], or in O(μ^(1+o(1)) (nm)^(1+o(1)) log (nUT)) time using the algorithm of Chen et al. [Chen et al., 2022], where U is the maximum capacity of any edge and T is the time horizon. When μ >> m,n, this is faster than previously known algorithms for this problem.
Cite as
Shuchi Chawla and Kristin Sheridan. Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 23:1-23:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{chawla_et_al:LIPIcs.SAND.2026.23,
author = {Chawla, Shuchi and Sheridan, Kristin},
title = {{Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {23:1--23:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.23},
URN = {urn:nbn:de:0030-drops-262578},
doi = {10.4230/LIPIcs.SAND.2026.23},
annote = {Keywords: maximum flow, dynamic flows, flows over time}
}
Document
Brief Announcement
Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads & Greedy Routing
Abstract
Workloads of networked and distributed systems are often far from random, but exhibit certain structure: they are skewed and bursty. Networked systems which can adapt to and exploit such spatial and temporal structure, in a demand-aware manner, bear the potential to be more efficient than their demand-oblivious alternatives. This paper studies demand-awareness in the context of consistent hashing, a fundamental component in many modern distributed systems. We present a novel demand-aware consistent hashing method to improve access time and storage utilization in distributed hash tables. In particular, the resulting system supports local (greedy) routing, ensures bounded server loads, and applies to various network topologies. We formally prove that our algorithms achieve a constant approximation ratio in the offline scenario.
Cite as
Arash Pourdamghani, Chen Avin, and Stefan Schmid. Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads & Greedy Routing. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 24:1-24:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{pourdamghani_et_al:LIPIcs.SAND.2026.24,
author = {Pourdamghani, Arash and Avin, Chen and Schmid, Stefan},
title = {{Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads \& Greedy Routing}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {24:1--24:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.24},
URN = {urn:nbn:de:0030-drops-262585},
doi = {10.4230/LIPIcs.SAND.2026.24},
annote = {Keywords: Consistent hashing, peer-to-peer networks, greedy routing}
}
Document
Brief Announcement
Brief Announcement: Fault-Tolerant 3D Leader Election in the Amoebot Model
Abstract
We study leader election for programmable matter in the amoebot model when particles operate on a lattice graph and may experience crash-recovery failures. We propose a lattice-group view that captures both the classical 2D triangular grid and the 3D face-centered cubic (FCC) grid, including configurations with holes and the full lattice symmetry group. To the best of our knowledge, this is the first leader-election framework for 3D amoebot systems that simultaneously handles holes, the full lattice symmetry group including reflections, and crash-recovery faults. We outline (i) a randomized fault-tolerant leader election algorithm based on Borůvka-style merging of candidate-rooted trees combined with a coordinate-based solitude-verification, and (ii) a deterministic approach for assorted local orientations that simulates a virtual instance for each possible orientation in the symmetry group and breaks residual symmetries via a centroid-guided movement phase. Logarithmic-size coordinates are streamed or stored distributively, preserving constant local memory, while crashes are handled by rerooting so failures partition trees without destroying the global competition structure.
Cite as
Daniel Warner and Christian Scheideler. Brief Announcement: Fault-Tolerant 3D Leader Election in the Amoebot Model. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 25:1-25:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{warner_et_al:LIPIcs.SAND.2026.25,
author = {Warner, Daniel and Scheideler, Christian},
title = {{Brief Announcement: Fault-Tolerant 3D Leader Election in the Amoebot Model}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {25:1--25:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.25},
URN = {urn:nbn:de:0030-drops-262593},
doi = {10.4230/LIPIcs.SAND.2026.25},
annote = {Keywords: Programmable matter, amoebot model, leader election, fault tolerance, 3D lattices, symmetry groups}
}
Document
Brief Announcement
Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model
Abstract
Reconfigurable circuits substantially accelerate coordination tasks in the geometric Amoebot model, but existing circuit-based leader election assumes perfectly reliable circuit beeps and provides only Monte Carlo guarantees. We introduce a natural fault model in which circuit beeps are noisy: whenever at least one amoebot beeps on a circuit in a round, each amoebot hears that beep in the next round independently with probability 1-ε, while direct neighbor-to-neighbor (pin-to-pin) communication remains reliable. In this noisy-circuit model we give a Las Vegas leader election algorithm that terminates in O(√{log n} log n) rounds w.h.p. Moreover, once a leader is elected, we show how to simulate any stationary algorithm that is correct in the noiseless circuit model with only an O(√{log n}) multiplicative overhead in running time. Our techniques combine robust flooding/acknowledgment primitives with a tree-based competition framework (Euler-tour representation, randomized attrition, and deterministic solitude verification).
Cite as
Daniel Warner and Christian Scheideler. Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 26:1-26:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{warner_et_al:LIPIcs.SAND.2026.26,
author = {Warner, Daniel and Scheideler, Christian},
title = {{Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {26:1--26:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.26},
URN = {urn:nbn:de:0030-drops-262606},
doi = {10.4230/LIPIcs.SAND.2026.26},
annote = {Keywords: Programmable matter, amoebot model, leader election, reconfigurable circuits, noisy beeps, Las Vegas algorithms}
}
Document
Brief Announcement
Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks
Abstract
We introduce the problem of adaptive self-organization in which the nodes of an anonymous, synchronous dynamic network must distributively change the collective distribution of their responses (or "colors") as a function of time-varying environmental signals, even when these signals are only perceived locally and the network topology changes adversarially. Specifically, a signal adversary may change the type of signal and which node(s) witness that signal arbitrarily between rounds. If a signal (or lack thereof) s persists in the system for sufficiently long, the dynamic network must stabilize such that nodes' colors reach and remain in a distribution closely approximating r(s), a goal distribution defined by the problem instance. We first prove that if nodes are deterministic, the only solvable instances of adaptive self-organization are those with homogeneous goal distributions, i.e., those where all nodes must stabilize with the same color. We then present a linear-time, logarithmic-memory, deterministic algorithm for this subclass of instances that works even when the multiplicity and location of signal witnesses change arbitrarily. When nodes know n, the number of nodes in the network, a small adaptation of this algorithm achieves a stronger convergence property in which adversarial edge and signal dynamics are entirely unable to disturb stabilized configurations. Finally, we present a randomized extension of these algorithms that solves arbitrary (i.e., not necessarily homogeneous) instances of adaptive self-organization with high probability when nodes know the goal distributions.
Cite as
Garrett Parzych and Joshua J. Daymude. Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks. In 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 373, pp. 27:1-27:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{parzych_et_al:LIPIcs.SAND.2026.27,
author = {Parzych, Garrett and Daymude, Joshua J.},
title = {{Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks}},
booktitle = {5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026)},
pages = {27:1--27:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-427-7},
ISSN = {1868-8969},
year = {2026},
volume = {373},
editor = {Mertzios, George B. and Richa, Andr\'{e}a W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.27},
URN = {urn:nbn:de:0030-drops-262610},
doi = {10.4230/LIPIcs.SAND.2026.27},
annote = {Keywords: Dynamic networks, anonymous nodes, broadcast, self-organization, biological distributed algorithms}
}