Skip to content

Author

Yotam Kenneth-Mordoch

We have 3 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 Oct 2026

Deterministic Global Minimum Cut Using $\tilde{O}(n^{3/2})$ Cut Queries

A simple deterministic algorithm is given that finds a global minimum cut using $\tilde O(\min\left\{ n\delta,n^2/\delta \right\})$ cut queries, which equals $\tilde{O}(n^{3/2})$ in the worst case, where $\delta$ is the minimum degree of the graph.

Yotam Kenneth-Mordoch · 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.