Oren Weimann

activity

20062026

most citedAn O(n^3)-Time Algorithm for Tree Edit Distance

206 citations · 303 across the 29 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

A Tight Bound for Facial Distance Patterns in Planar Graphs

Viktor Fredslund-Hansen, Shay Mozes, Oren Weimann

Let $G$ be an undirected unweighted planar graph and let $S = (s_{0}, \dots, s_{k - 1})$ be the vertices of a designated face, listed in cyclic order. Consider a vector that stores the dis…

cs.DC2026

$O ~$ 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…

cs.DC2026★ 1 cited

A Simple Distributed Deterministic Planar Separator

Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann

A balanced separator of a graph $G$ is a set of vertices whose removal disconnects the graph into connected components that are a constant factor smaller than $G$ . Lipton and Tarja…

A Tight Bound for Facial Distance Patterns in Planar Graphs

O~ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs

A Simple Distributed Deterministic Planar Separator

$O ~$ ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs