Unit Covering in Color-Spanning Set Model. - Ehsan Emamjomeh-Zadeh; Mohammad Ghodsi; Hamid Homapour; Masoud Seddighin (WALCOM, 2015)

Envy-Free Mechanisms with Minimum Number of Cuts. - Reza Alijani; Majid Farhadi; Mohammad Ghodsi; Masoud Seddighin; Ahmad S. Tajik (AAAI, 2017)

Approximate Minimum Diameter. - Mohammad Ghodsi; Hamid Homapour; Masoud Seddighin (COCOON, 2017)

Fair Allocation of Indivisible Goods: Improvement and Generalization. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (CoRR, 2017)

Rent Division Among Groups. - Mohammad Ghodsi; Mohamad Latifian; Arman Mohammadi; Sadra Moradian; Masoud Seddighin (COCOA, 2018)

Fair Allocation of Indivisible Goods: Improvements and Generalizations. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (EC, 2018)

Fair Allocation of Indivisible Items With Externalities. - Mohammad Ghodsi; Hamed Saleh; Masoud Seddighin (CoRR, 2018)

Approximating LCS in Linear Time: Beating the √n Barrier. - MohammadTaghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Xiaorui Sun (SODA, 2019)

Externalities and Fairness. - Masoud Seddighin; Hamed Saleh; Mohammad Ghodsi (WWW, 2019)

Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. - Masoud Seddighin; Majid Farhadi; Mohammad Ghodsi; Reza Alijani; Ahmad S. Tajik (Algorithmica, 2019)

Fair Allocation of Indivisible Goods to Asymmetric Agents. - Alireza Farhadi 001; Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Sébastien Lahaie; David M. Pennock; Masoud Seddighin; Saeed Seddighin; Hadi Yami (J. Artif. Intell. Res., 2019)

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. - Mahdi Boroujeni; Masoud Seddighin; Saeed Seddighin (SODA, 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)

Approximate Competitive Equilibrium with Generic Budget. - Amin Ghiasi; Masoud Seddighin (SAGT, 2021)

On the Distortion Value of Elections with Abstention. - Masoud Seddighin; Mohamad Latifian; Mohammad Ghodsi (J. Artif. Intell. Res., 2021)

Fair Allocation of Indivisible Goods: Improvement. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (Math. Oper. Res., 2021)

Maximin share guarantee for goods with positive externalities. - Masoud Seddighin; Hamed Saleh; Mohammad Ghodsi (Soc. Choice Welf., 2021)

An EF2X Allocation Protocol for Restricted Additive Valuations. - Hannaneh Akrami; Rojin Rezvan; Masoud Seddighin (IJCAI, 2022)

3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. - Masoud Seddighin; Saeed Seddighin (ITCS, 2022)

Fair allocation of indivisible goods: Beyond additive valuations. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (Artif. Intell., 2022)

Approximating Longest Common Subsequence in Linear Time: Beating the $ sqrt{{n}}$ Barrier. - MohammadTaghi Hajiaghayi; Masoud Seddighin; Saeedreza Seddighin; Xiaorui Sun (SIAM J. Comput., 2022)

Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap. - Shayan Chashm Jahan; Masoud Seddighin; Seyed Mohammad Seyed Javadi; Mohammad Sharifi (IJCAI, 2023)

Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. - Hannaneh Akrami; Kurt Mehlhorn; Masoud Seddighin; Golnoosh Shahkarami (NeurIPS, 2023)

Metric Distortion Under Public-Spirited Voting. - Amirreza Bagheridelouee; Marzie Nilipour; Masoud Seddighin; Maziar Shamsipour (AAMAS, 2024)

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations. - Alireza Kaviani; Masoud Seddighin; AmirMohammad Shahrezaei (CoRR, 2024)

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem. - Masoud Seddighin; Saeed Seddighin (Artif. Intell., 2024)

On the Distortion of Multi-Winner Elections on the Line Metric. - Negar Babashah; Hasti Karimi; Masoud Seddighin; Golnoosh Shahkarami (AAMAS, 2025)

Distortion of Multi-winner Elections on the Line Metric: The Polar Comparison Rule. - Negar Babashah; Hasti Karimi; Masoud Seddighin; Golnoosh Shahkarami (SAGT, 2025)

Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem. - Masoud Seddighin; Saeed Seddighin (EC, 2025)

Improved Approximate EFX Guarantees for Multigraphs. - Alireza Kaviani; Alireza Keshavarz; Masoud Seddighin; AmirMohammad Shahrezaei (CoRR, 2025)

Lower Bound for Online MMS Assignment of Indivisible Chores. - Masoud Seddighin; Saeed Seddighin (CoRR, 2025)

Quantum Pattern Matching with Wildcards. - Masoud Seddighin; Saeed Seddighin (CoRR, 2025)