Skip to content

Author

Asaf Petruschka

2 papers indexed here

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
Conference Aug 2026

Fast Metric Decompositions in High Dimension

Metric decompositions are a fundamental tool in the design of algorithms involving distances. We study fast algorithms for sampling from probabilistic metric decompositions of $n$-point sets in $\ell_\infty$ and $\ell_2$ spaces of high dimension $d$. For $\ell_\infty$, we design a padded-decomposition algorithm that ru...

Robert Krauthgamer, Asaf Petruschka, Nir Petruschka · 0 citations

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