This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …

In the decremental single-source shortest paths problem, the goal is to maintain distances
from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In …

This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

Satellite routers in emerging space-terrestrial integrated networks (STINs) are operated in a
failure-prone, intermittent and resource-constrained space environment, making it very …

Many distributed optimization algorithms achieve existentially-optimal running times,
meaning that there exists some pathological worst-case topology on which no algorithm can …

We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest
path problems including shortest-path-tree and transshipment. The universal optimality of …

Expander decompositions form the basis of one of the most flexible paradigms for close-to-
linear-time graph algorithms. Length-constrained expander de-compositions generalize this …

This paper presents new deterministic and distributed low-diameter decomposition
algorithms for weighted graphs. In particular, we show that if one can efficiently compute …

Reconfigurable networks have traditionally suffered from long reconfiguration times due to
hardware limitations. With the emergence of new technologies that can reconfigure on the …

In network design problems, such as compact routing, the goal is to route packets between
nodes using the (approximated) shortest paths. A desirable property of these routes is a …