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