In this paper we give the first efficient algorithms for the k-center
pr...
Designing approximate all-pairs distance oracles in the fully dynamic se...
Oblivious routing is a well-studied distributed paradigm that uses stati...
Given a simple n-vertex, m-edge graph G undergoing edge insertions and
d...
We show an (1+ϵ)-approximation algorithm for maintaining maximum
s-t flo...
We present a nearly-linear time algorithm for finding a minimum-cost flo...
We provide universally-optimal distributed graph algorithms for
(1+ε)-ap...
Effective resistance is an important metric that measures the similarity...
We study distributed algorithms built around edge contraction based vert...
Graph embeddings are a ubiquitous tool for machine learning tasks, such ...
We introduce a notion for hierarchical graph clustering which we call th...
We present a general framework of designing efficient dynamic approximat...
We give the first non-trivial fully dynamic probabilistic tree embedding...
We give the first non-trivial fully dynamic probabilistic tree embedding...
We study the metric facility location problem with client insertions and...
Graphs naturally appear in several real-world contexts including social
...
In the k-center clustering problem, we are given a set of n points in a
...
We study dynamic algorithms for maintaining spectral vertex
sparsifiers ...
Spanning trees of low average stretch on the non-tree edges, as introduc...
In this paper we consider the fully-dynamic All-Pairs Effective
Resistan...
We consider the problem of dynamically maintaining (approximate) all-pai...
We introduce a new algorithmic framework for designing dynamic graph
alg...