M
Mahsa Derakhshan
Researcher at University of Maryland, College Park
Publications - 39
Citations - 551
Mahsa Derakhshan is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Matching (graph theory) & Computer science. The author has an hindex of 11, co-authored 34 publications receiving 408 citations.
Papers
More filters
Proceedings Article
Affinity Clustering: Hierarchical Clustering at Scale
MohammadHossein Bateni,Soheil Behnezhad,Mahsa Derakhshan,MohammadTaghi Hajiaghayi,Raimondas Kiveris,Silvio Lattanzi,Vahab Mirrokni +6 more
TL;DR: This work proposes affinity, a novel hierarchical clustering based on Boruvka's MST algorithm, and proves certain theoretical guarantees for affinity and shows that in practice it is superior to several other state-of-the-art clustering algorithms.
Proceedings ArticleDOI
Massively Parallel Computation of Matching and MIS in Sparse Graphs
Soheil Behnezhad,Sebastian Brandt,Mahsa Derakhshan,Manuela Fischer,MohammadTaghi Hajiaghayi,Richard M. Karp,Jara Uitto +6 more
TL;DR: This work considers maximal matching and maximal independent set problems in the MPC model, and a degree reduction technique is used that reduces these problems in graphs with arboricity λ to the corresponding problems inGraphs with maximum degree poly(λ, log n) in O(log2log n) rounds, giving rise to O(√ log λ ⋅ loglog λ + log 2 log n)-round algorithms.
Proceedings ArticleDOI
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
TL;DR: The first algorithm for maintaining a maximal independent set (MIS) of a fully dynamic graph---which undergoes both edge insertions and deletions---in polylogarithmic time is presented and a simpler variant of the algorithm can be used to maintain a random-order lexicographically first maximal matching in the same update-time.
Posted Content
Brief Announcement: Semi-MapReduce Meets Congested Clique.
TL;DR: This short note shows through a set of simulation methods that semi-MPC is, perhaps surprisingly, almost equivalent to the congested clique model of distributed computing, and incorporates another practically important dimension to optimize: the number of machines.
Posted Content
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
TL;DR: A polynomial-size LP formulation of the optimal strategies for the Colonel Blotto game was proposed in this paper. But the LP formulation is not asymptotically tight in terms of the number of constraints.