
Local Algorithms for Estimating Effective Resistance
Effective resistance is an important metric that measures the similarity...
read it

Minor Sparsifiers and the Distributed Laplacian Paradigm
We study distributed algorithms built around edge contraction based vert...
read it

Faster Graph Embeddings via Coarsening
Graph embeddings are a ubiquitous tool for machine learning tasks, such ...
read it

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
We introduce a notion for hierarchical graph clustering which we call th...
read it

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
We present a general framework of designing efficient dynamic approximat...
read it

Dynamic Maintenance of LowStretch Probabilistic Tree Embeddings with Applications
We give the first nontrivial fully dynamic probabilistic tree embedding...
read it

Dynamic Maintanance of LowStretch Probabilistic Tree Embeddings with Applications
We give the first nontrivial fully dynamic probabilistic tree embedding...
read it

A Tree Structure For Dynamic Facility Location
We study the metric facility location problem with client insertions and...
read it

Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
Graphs naturally appear in several realworld contexts including social ...
read it

Fully Dynamic kCenter Clustering in Doubling Metrics
In the kcenter clustering problem, we are given a set of n points in a ...
read it

Fully Dynamic Spectral Vertex Sparsifiers and Applications
We study dynamic algorithms for maintaining spectral vertex sparsifiers ...
read it

Dynamic LowStretch Trees via Dynamic LowDiameter Decompositions
Spanning trees of low average stretch on the nontree edges, as introduc...
read it

Fully Dynamic Effective Resistances
In this paper we consider the fullydynamic AllPairs Effective Resistan...
read it

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
We consider the problem of dynamically maintaining (approximate) allpai...
read it

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
We introduce a new algorithmic framework for designing dynamic graph alg...
read it
Gramoz Goranci
is this you? claim profile