Author

Oren Weimann

h-index 26 View on Semantic Scholar

We have 2 of 92 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

A Tight Bound for Facial Distance Patterns in Planar Graphs

There is currently a gap between the time for computing the diameter between weighted and unweighted planar graphs, and a (centralized) $\tilde{O}(n^{8/5})$-time algorithm for computing the diameter is presented, improving over the $\tilde{O}(n^{5/3})$ algorithm of [SODA'18] which works for weighted directed planar gra...

Viktor Fredslund-Hansen, S. Mozes, Oren Weimann · 0 citations

Preprint Aug 2026

$\tilde{\text{O}}$ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs

This paper presents the first distributed near-optimal $\tilde O(D)$-rounds $(1-o(1))$-approximation algorithm for Maximum $st$-Flow in general undirected planar graphs.

Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann · 0 citations