Skip to content

Author

Yotam Kenneth-Mordoch

We have 2 of 10 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 Sep 2026

An Optimal Structure for All-Pairs Nearest Mincuts and Sensitivity Oracles for Edge Insertions

Given an undirected weighted graph $G=(V,E)$ on $n$ vertices, the classical Gomory-Hu tree of $G$ is a structure that encodes an arbitrary minimum $s,t$-cut for every $s,t\in V$ using just $O(n)$ space. In this work, we ask whether the same compactness is achievable for the natural and structured family of all-pairs \t...

Koustav Bhanja, Yotam Kenneth-Mordoch, Asaf Petruschka · 0 citations
Preprint Jul 2026

Fully Dynamic Edge Connectivity in $\tilde{O}(n^{12/13})$ Time

This work designs a randomized algorithm for maintaining edge connectivity in dynamic simple graphs using worst-case update and query time $\tilde{O}(n^{12/13})$ for all values of $\lambda_G$.

Yotam Kenneth-Mordoch, Robert Krauthgamer · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.