Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (AAAI, 2017)

Affinity Clustering: Hierarchical Clustering at Scale. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Raimondas Kiveris; Silvio Lattanzi; Vahab S. Mirrokni (NIPS, 2017)

A Polynomial Time Algorithm for Spatio-Temporal Security Games. - Soheil Behnezhad; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Aleksandrs Slivkins (EC, 2017)

Brief Announcement: Graph Matching in Massive Datasets. - Soheil Behnezhad; Mahsa Derakhshan; Hossein Esfandiari; Elif Tan; Hadi Yami (SPAA, 2017)

Brief Announcement: MapReduce Algorithms for Massive Trees. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Vahab S. Mirrokni (ICALP, 2018)

Spatio-Temporal Games Beyond One Dimension. - Soheil Behnezhad; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Saeed Seddighin (EC, 2018)

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 (SODA, 2018)

Brief Announcement: Semi-MapReduce Meets Congested Clique. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi (CoRR, 2018)

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Richard M. Karp (CoRR, 2018)

Massively Parallel Dynamic Programming on Trees. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Vahab S. Mirrokni (CoRR, 2018)

Optimal Strategies of Blotto Games: Beyond Convexity. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Christos H. Papadimitriou; Saeed Seddighin (EC, 2019)

LP-based Approximation for Personalized Reserve Prices. - Mahsa Derakhshan; Negin Golrezaei; Renato Paes Leme (EC, 2019)

Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (ESA, 2019)

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Cliff Stein 001; Madhu Sudan 001 (FOCS, 2019)

Massively Parallel Computation of Matching and MIS in Sparse Graphs. - Soheil Behnezhad; Sebastian Brandt 002; Mahsa Derakhshan; Manuela Fischer; MohammadTaghi Hajiaghayi; Richard M. Karp; Jara Uitto (PODC, 2019)

Stochastic Matching on Uniformly Sparse Graphs. - Soheil Behnezhad; Mahsa Derakhshan; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Nima Reyhani (SAGT, 2019)

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (DISC, 2019)

Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation - varepsilon$) Approximation. - Soheil Behnezhad; Mahsa Derakhshan (FOCS, 2020)

Stochastic matching with few queries: (1-ε) approximation. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi (STOC, 2020)

Stochastic Weighted Matching: $(1-ε)$ Approximation. - Soheil Behnezhad; Mahsa Derakhshan (CoRR, 2020)

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. - Mahsa Derakhshan; David M. Pennock; Aleksandrs Slivkins (SODA, 2021)

Algorithms for Markets: Matching and Pricing. - Mahsa Derakhshan (2021)

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. - Mark Braverman; Mahsa Derakhshan; Antonio Molina Lovett (EC, 2022)

Stochastic Vertex Cover with Few Queries. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan (SODA, 2022)

Linear Program-Based Approximation for Personalized Reserve Prices. - Mahsa Derakhshan; Negin Golrezaei; Renato Paes Leme (Manag. Sci., 2022)

Product Ranking on Online Platforms. - Mahsa Derakhshan; Negin Golrezaei; Vahideh H. Manshadi; Vahab Mirrokni (Manag. Sci., 2022)

Learning and Collusion in Multi-unit Auctions. - Simina Brânzei; Mahsa Derakhshan; Negin Golrezaei; Yanjun Han (NeurIPS, 2023)

Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching. - Mahsa Derakhshan; Alireza Farhadi 001 (SODA, 2023)

Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. - Mahsa Derakhshan; Naveen Durvasula; Nika Haghtalab (STOC, 2023)

Online Learning in Multi-unit Auctions. - Simina Brânzei; Mahsa Derakhshan; Negin Golrezaei; Yanjun Han (CoRR, 2023)

Fast and Simple Solutions of Blotto Games. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (Oper. Res., 2023)

Settling the Competition Complexity of Additive Buyers over Independent Items. - Mahsa Derakhshan; Emily Ryu; S. Matthew Weinberg; Eric Xue 001 (EC, 2024)

One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. - Mahsa Derakhshan; Andisheh Ghasemi; Rajmohan Rajaraman (ICALP, 2025)

Query Efficient Weighted Stochastic Matching. - Mahsa Derakhshan; Mohammad Saneian (ICALP, 2025)

Query Complexity of Stochastic Minimum Vertex Cover. - Mahsa Derakhshan; Mohammad Saneian; Zhiyang Xun (ITCS, 2025)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. - Mark Braverman; Mahsa Derakhshan; Tristan Pollner; Amin Saberi; David Wajc (SODA, 2025)