
Deterministic Decremental SSSP and Approximate MinCost Flow in AlmostLinear Time
In the decremental singlesource shortest paths problem, the goal is to ...
read it

NearOptimal Algorithms for Reachability, StronglyConnected Components and Shortest Paths in Partially Dynamic Digraphs
In this thesis, we present new techniques to deal with fundamental algor...
read it

New Techniques and FineGrained Hardness for Dynamic NearAdditive Spanners
Maintaining and updating shortest paths information in a graph is a fund...
read it

Decremental APSP in Directed Graphs Versus an Adaptive Adversary
Given a directed graph G = (V,E), undergoing an online sequence of edge ...
read it

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
Let G = (V,E,w) be a weighted, digraph subject to a sequence of adversar...
read it

FullyDynamic Graph Sparsifiers Against an Adaptive Adversary
Designing dynamic graph algorithms against an adaptive adversary is a ma...
read it

NearOptimal Decremental SSSP in Dense Weighted Digraphs
In the decremental SingleSource Shortest Path problem (SSSP), we are gi...
read it

Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary
Given a dynamic digraph G = (V,E) undergoing edge deletions and given s∈...
read it

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
In the decremental (1+ϵ)approximate SingleSource Shortest Path (SSSP) ...
read it

FullyDynamic AllPairs Shortest Paths: Improved WorstCase Time and Space Bounds
Given a directed weighted graph G=(V,E) undergoing vertex insertions and...
read it

New Algorithms and Hardness for Incremental SingleSource Shortest Paths in Directed Graphs
In the dynamic SingleSource Shortest Paths (SSSP) problem, we are given...
read it
Maximilian Probst Gutenberg
is this you? claim profile