Adam Karczmarz

activity

20152026

most citedOptimal Dynamic Strings

8 citations · 14 across the 18 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Max $s, t$ -Flow Oracles and Negative Cycle Detection in Planar Digraphs

Adam Karczmarz

We study the maximum $s, t$ -flow oracle problem on planar directed graphs where the goal is to design a data structure answering max $s, t$ -flow value (or equivalently, min $s, t$ -cut…

cs.DS2023

Deterministic Fully Dynamic SSSP and More

Jan van den Brand, Adam Karczmarz

We present the first non-trivial fully dynamic algorithm maintaining exact single-source distances in unweighted graphs. This resolves an open problem stated by Sankowski [COCOON 2…

cs.DS2023

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form

Adam Karczmarz, Piotr Sankowski

Algebraic techniques have had an important impact on graph algorithms so far. Porting them, e.g., the matrix inverse, into the dynamic regime improved best-known bounds for various…

Max s,t-Flow Oracles and Negative Cycle Detection in Planar Digraphs

Deterministic Fully Dynamic SSSP and More

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form

Max $s, t$ -Flow Oracles and Negative Cycle Detection in Planar Digraphs