Bio


I am a Postdoctoral fellow at the Computer Science Department of Carnegie Mellon University, hosted by Elaine Shi.
Prior to coming to CMU, I was a PhD candidate at the Computer Science Department of the University of Maryland, where I had the fortune of being advised by Mohammad Hajiaghayi. I finished my undergraduate studies at Sharif University of Technology.
I'm interested in Combinatorial Optimization, Algorithmic Game Theory, and Algorithmic Graph Theory.
You can find my resume here for more information.

Publications


Beating (1−1/e)-Approximation for Weighted Stochastic Matching [SODA 2023]
Mahsa Derakhshan and Alireza Farhadi
arXiv

Online Bipartite Matching with Reusable Resources [EC 2022]
Steven Delong, Alireza Farhadi, Rad Niazadeh and Balasubramanian Sivan
arXiv

Differentially Private Densest Subgraph [AISTATS 2022]
Alireza Farhadi, MohammadTaghi Hajiaghayi and Elaine Shi
arXiv

Generalized Stochastic Matching [AAAI 2022]
Alireza Farhadi, Jacob Gilbert and MohammadTaghi Hajiaghayi
arXiv

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence [ICALP 2021]
Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin and Yu Zheng
arXiv

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings [AAAI 2021]
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Latifian , Masoud Seddighin and Hadi Yami
arXiv

Approximate Maximum Matching in Random Streams [SODA 2020]
Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai, Anup Rao and Ryan Rossi
arXiv

Stochastic Matching on Uniformly Sparse Graphs [SAGT 2019]
Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi and Nima Reyhani

Lower Bounds for External Memory Integer Sorting via Network Coding [STOC 2019]
Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen and Elaine Shi
arXiv

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs [SODA 2019]
Mohammad Hossein Bateni, Alireza Farhadi and MohammadTaghi Hajiaghayi
arXiv

Stochastic Matching with Few Queries: New Algorithms and Tools [SODA 2019]
Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi and Nima Reyhani
arXiv

On the Complexity of Chore Division [IJCAI 2018]
Alireza Farhadi and MohammadTaghi Hajiaghayi
arXiv

Envy-free Chore Division for An Arbitrary Number of Agents [SODA 2018]
Sina Dehghani, Alireza Farhadi, MohammadTaghi Hajiaghayi and Hadi Yami
PDF, Media Coverage

Fair Allocation of Indivisible Goods to Asymmetric Agents [AAMAS 2017]
Journal version appeared in Journal of Artifial Intelligence Research (JAIR)
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sebastien Lahaie, David Pennock, Masoud Seddighin, Saeed Seddighin and Hadi Yami
arXiv, Journal

Visits/Internships


Research Intern at Google Research, New York - Summer 2020
Hosts: Steven Delong, Rad Niazadeh and Balasubramanian Sivan

Research Intern at Adobe Research, San Jose - Summer 2019
Hosts: Ryan Rossi, Tung Mai and Anup Rao

Research Visitor at Simons Institute, UC Berkeley - Fall 2018
Program: Foundations of Data Science

Research Visitor at Simons Institute, UC Berkeley - Spring 2018
Program: The Brain and Computation