Author

Nima Dolatabadi

h-index 17 View on Semantic Scholar

We have 2 of 36 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Communication-Efficient $(1+\varepsilon)\Delta$-Edge Coloring and Lov\'asz Local Lemma

We study edge coloring in the two-party edge-partition model, where Alice and Bob each know part of the edge set and must jointly produce a proper coloring with little communication. Previous work gave a deterministic $(2\Delta-1)$-edge-coloring protocol using $O(n)$ bits, leaving open whether fewer colors can be obtai...

Yi-Jun Chang, Nima Dolatabadi, H. T. Nguyen · 0 citations

#edge computing Preprint Sep 2026

Introvert Clustering for Distributed Graph Algorithms

We introduce a graph decomposition primitive called introvert clustering, which strengthens standard low-diameter clustering by guaranteeing that every clustered vertex keeps at least a $\left(\frac12-\varepsilon\right)$-fraction of its relevant neighbors in its own cluster. Repeatedly applying this primitive yields a...

Yi-Jun Chang, Nima Dolatabadi · 0 citations