6 citations · 9 across the 16 of their papers we have counts for
3 papers · 2 filters
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
Nick Fischer, Bernhard Haeupler, Rustam Latypov +2
We give the first parallel algorithm with optimal work for the classical problem of computing Single-Source Shortest Paths in general graphs with negative-weight edg…
Low-Step Multi-Commodity Flow Emulators
Bernhard Haeupler, D Ellis Hershkowitz, Jason Li +2
We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flow…
Dynamic Deterministic Constant-Approximate Distance Oracles with Worst-Case Update Time
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
We present a new distance oracle in the fully dynamic setting: given a weighted undirected graph with vertices undergoing both edge insertions and deletions, and an a…