2 citations · 4 across the 12 of their papers we have counts for
3 papers · 1 filter
ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
Persistent efforts in recent years have been devoted to devising distributed algorithms for fundamental optimization problems in planar graphs. In particular, for Single-Source Sho…
Deterministic Distance Approximation in MPC via Improved Hitting Sets
Kyungjin Cho, Michal Dory, Yannic Maus +1
In this paper, we provide the first deterministic algorithms with sublogarithmic round complexity for spanners and approximate shortest paths in various MPC models. Moreover, we si…
A Simple Distributed Deterministic Planar Separator
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
A balanced separator of a graph is a set of vertices whose removal disconnects the graph into connected components that are a constant factor smaller than . Lipton and Tarja…