Skip to content

Author

Adam Karczmarz

We have 3 of 41 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

Breaking Two Barriers for Dynamic Planar Reachability

The first algorithm that breaks the square-root barrier for dynamic planar reachability in the offline setting is presented, obtaining time ${O}(n^{0.49})$ per query/update, which is the first improvement upon the exponent $2/3$ in over three decades.

A. Karczmarz, Michał Włodarczyk · 0 citations
Preprint Oct 2026

Dynamic Distances Without Matrix Inverse

We study the fully dynamic exact distance problem in unweighted directed graphs, where the graph undergoes edge insertions and deletions, and the distance between two query vertices must be reported. Under the combinatorial Boolean matrix multiplication conjecture, any subquadratic-time algorithm for this problem must...

J. W. van den Brand, Adam Karczmarz, Aryan Patel · 0 citations
Conference Aug 2026

Strongly Polynomial Parallel Maximum Flow Revisited

This work shows that a randomized parallel implementation of a variant of the strongly polynomial max-flow algorithm of Dadush, Orlin, Sidford, and V\'egh [SODA 2026] runs in $\tilde{O}(mn)$ work and $\tilde{O}(m)$ depth, which improves upon the previously described tradeoffs between work and depth.

Adam Karczmarz, P. Pilarski · 0 citations

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