Given an n-vertex undirected graph G=(V,E,w), and a parameter k≥1, a
pat...
This paper presents efficient distributed algorithms for a number of
fun...
This paper presents new deterministic and distributed low-diameter
decom...
Computing approximate shortest paths in the dynamic streaming setting is...
Near-additive (aka (1+ϵ,β)-) emulators and spanners are a
fundamental gr...
Graph spanners and emulators are sparse structures that approximately
pr...
Consider an undirected weighted graph G = (V,E,w). We study the problem ...
Given an unweighted undirected graph G = (V,E), and a pair of
parameter...
Let G=(V,E) be a weighted undirected graph with n vertices and m edges,
...
In the distributed setting, the only existing constructions of sparse
sk...
Given metric spaces (X,d) and (Y,ρ) and an ordering
x_1,x_2,...,x_n of (...
A t- spanner H of a weighted graph G=(V,E,w) is a subgraph that
approxim...
Given parameters α≥ 1,β≥ 0, a subgraph G'=(V,H) of an
n-vertex unweighte...
Given a metric space (X,d), a set of terminals K⊆ X, and a
parameter t> ...
We consider graph coloring and related problems in the distributed
messa...