research
∙
02/12/2023
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Given a simple n-vertex, m-edge graph G undergoing edge insertions and d...
share
research
∙
02/23/2022
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
We study fine-grained error bounds for differentially private algorithms...
research
∙
06/29/2021
Fully Dynamic Four-Vertex Subgraph Counting
This paper presents a comprehensive study of algorithms for maintaining ...
research
∙
01/13/2021
Practical Fully Dynamic Minimum Cut Algorithms
We present a practically efficient algorithm for maintaining a global mi...
research
∙
04/30/2020
Fully-Dynamic Coresets
With input sizes becoming massive, coresets—small yet representative sum...
research
∙
02/06/2019
