The distributed single-source shortest paths problem is one of the most fundamental and
central problems in the message-passing distributed computing. Classical Bellman-Ford …

We devise new algorithms for the single-source shortest paths (SSSP) problem with non-
negative edge weights in the CONGEST model of distributed computing. While close-to …

We design fast deterministic algorithms for distance computation in the CONGESTED
CLIQUE model. Our key contributions include: A (2+ ε)-approximation for all-pairs shortest …

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

In the distributed all-pairs shortest paths problem (APSP), every node in the weighted
undirected distributed network (the CONGEST model) needs to know the distance from …

We present improved distributed algorithms for variants of the triangle finding problem in the
model. We show that triangle detection, counting, and enumeration can be solved in rounds …

We improve the time complexity of the single-source shortest path problem for weighted
directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of …

We present improved distributed algorithms for triangle detection and its variants in the
CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be …

We introduce a communication model for hybrid networks, where nodes have access to two
different communication modes: a local mode where (like in traditional networks) …

The HYBRID model, introduced in [Augustine et al., SODA'20], provides a theoretical
foundation for networks that allow multiple communication modes. The model follows the …