Mahsa Derakhshan

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
One-way communication complexity of minimum vertex cover in general graphs	2026-09-29	Paper
Query efficient weighted stochastic matching	2026-09-29	Paper
Stochastic weighted matching: (1- ) approximation	2025-08-12	Paper
Fully dynamic maximal independent set with polylogarithmic update time	2025-08-12	Paper
Stochastic vertex cover with few queries	2024-07-19	Paper
Beating \((1 - 1/e)\)-approximation for weighted stochastic matching	2024-05-14	Paper
Stochastic minimum vertex cover in general graphs: a 3/2-approximation	2024-05-08	Paper
Fast and Simple Solutions of Blotto Games Operations Research	2024-03-12	Paper
scientific article; zbMATH DE number 7788406 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Streaming and massively parallel algorithms for edge coloring	2022-05-11	Paper
Brief announcement: MapReduce algorithms for massive trees	2021-07-28	Paper
Massively Parallel Computation of Matching and MIS in Sparse Graphs Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing	2021-01-20	Paper
Stochastic matching with few queries: (1-ε) approximation Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
Stochastic matching on uniformly sparse graphs	2020-02-04	Paper
From battlefields to elections: winning strategies of Blotto and auditing games	2018-03-15	Paper

Research outcomes over time

This page was built for person: Mahsa Derakhshan