12 citations · 36 across the 12 of their papers we have counts for
4 papers · 1 filter
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
Jan van den Brand, Danupon Nanongkai
Consider the following distance query for an -node graph undergoing edge insertions and deletions: given two sets of nodes and , return the distances between every pa…
A Deterministic Linear Program Solver in Current Matrix Multiplication Time
Jan van den Brand
Interior point algorithms for solving linear programs have been studied extensively for a long time [e.g. Karmarkar 1984; Lee, Sidford FOCS'14; Cohen, Lee, Song STOC'19]. For linea…
Sensitive Distance and Reachability Oracles for Large Batch Updates
Jan van den Brand, Thatchaphol Saranurak
In the sensitive distance oracle problem, there are three phases. We first preprocess a given directed graph with nodes and integer weights from . Second, given a s…
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynam…