Fair Allocation of Indivisible Goods to Asymmetric Agents. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Mohammad Ghodsi; Sébastien Lahaie; David M. Pennock; Masoud Seddighin; Saeed Seddighin; Hadi Yami (AAMAS, 2017)

On the Complexity of Chore Division. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi (IJCAI, 2018)

Envy-free Chore Division for An Arbitrary Number of Agents. - Sina Dehghani; Alireza Farhadi 001; Mohammad Taghi Hajiaghayi; Hadi Yami (SODA, 2018)

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

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. - MohammadHossein Bateni; Alireza Farhadi 001; MohammadTaghi Hajiaghayi (SODA, 2019)

Stochastic Matching with Few Queries: New Algorithms and Tools. - Soheil Behnezhad; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Nima Reyhani (SODA, 2019)

Lower bounds for external memory integer sorting via network coding. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Kasper Green Larsen; Elaine Shi (STOC, 2019)

Approximate Maximum Matching in Random Streams. - Alireza Farhadi 001; Mohammad Taghi Hajiaghayi; Tung Mai; Anup Rao 002; Ryan A. Rossi (SODA, 2020)

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Aviad Rubinstein; Saeed Seddighin (CoRR, 2020)

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. - Alireza Farhadi 001; Mohammad Taghi Hajiaghayi; Mohamad Latifian; Masoud Seddighin; Hadi Yami (AAAI, 2021)

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. - Kuan Cheng; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Zhengzhong Jin; Xin Li 006; Aviad Rubinstein; Saeed Seddighin; Yu Zheng 014 (ICALP, 2021)

Generalized Stochastic Matching. - Alireza Farhadi 001; Jacob Gilbert; MohammadTaghi Hajiaghayi (AAAI, 2022)

Differentially Private Densest Subgraph. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Elaine Shi (AISTATS, 2022)

Online Bipartite Matching with Reusable Resources. - Steven Delong; Alireza Farhadi 001; Rad Niazadeh; Balasubramanian Sivan (EC, 2022)

Memory-Restricted and Secure Algorithms For Large Datasets. - Alireza Farhadi 001 (2022)

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

Connected Components in Linear Work and Near-Optimal Time. - Alireza Farhadi 001; Sixue Cliff Liu; Elaine Shi (SPAA, 2024)

Online Bipartite Matching with Reusable Resources. - Steven Delong; Alireza Farhadi 001; Rad Niazadeh; Balasubramanian Sivan; Rajan Udwani (Math. Oper. Res., 2024)