Mahsa Derakhshan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
10
Active years
2017–2026
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | Improved Approximation for Ranking on General Graphs. | Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu |
| 2026 | STOC | A Unified Framework for Analysis of Randomized Greedy Matching Algorithms. | Mahsa Derakhshan, Tao Yu |
| 2025 | ICALP | One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. | Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman |
| 2025 | ICALP | Query Efficient Weighted Stochastic Matching. | Mahsa Derakhshan, Mohammad Saneian |
| 2025 | SODA | New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. | Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc |
| 2023 | SODA | Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching. | Mahsa Derakhshan, Alireza Farhadi |
| 2023 | STOC | Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. | Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab |
| 2022 | SODA | Stochastic Vertex Cover with Few Queries. | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan |
| 2021 | SODA | Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. | Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins |
| 2020 | FOCS | Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation. | Soheil Behnezhad, Mahsa Derakhshan |
| 2020 | STOC | Stochastic matching with few queries: (1-ε) approximation. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi |
| 2019 | EC | Optimal Strategies of Blotto Games: Beyond Convexity. | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin |
| 2019 | EC | LP-based Approximation for Personalized Reserve Prices. | Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme |
| 2019 | ESA | Streaming and Massively Parallel Algorithms for Edge Coloring. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh |
| 2019 | FOCS | Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan |
| 2019 | PODC | 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 |
| 2019 | SAGT | Stochastic Matching on Uniformly Sparse Graphs. | Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani |
| 2018 | ICALP | Brief Announcement: MapReduce Algorithms for Massive Trees. | MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni |
| 2018 | SODA | From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark |
| 2017 | AAAI | Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. | Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin |
| 2017 | SPAA | Brief Announcement: Graph Matching in Massive Datasets. | Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami |