2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
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…
cs.DC2024
Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter +1
The dual of a planar graph is a planar graph that has a vertex for each face of and an edge for each pair of adjacent faces of . The profound relationship between…
cs.DC2019
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen +1
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A -approximation for all-pairs shortest pat…