research
∙
11/08/2022
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch
We provide the first deterministic data structure that given a weighted ...
share
research
∙
04/05/2022
Maintaining Expander Decompositions via Sparse Cuts
In this article, we show that the algorithm of maintaining expander deco...
research
∙
11/14/2021
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Given an n-vertex planar embedded digraph G with non-negative edge weigh...
research
∙
11/27/2020
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
In this thesis, we present new techniques to deal with fundamental algor...
research
∙
01/29/2020
