| Fair allocation of indivisible goods: Improvements and generalizations M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami Proceedings of the 2018 ACM Conference on Economics and Computation, 539-556, 2018 | 130 | 2018 |
| Fair allocation of indivisible goods to asymmetric agents A Farhadi, M Ghodsi, MT Hajiaghayi, S Lahaie, D Pennock, M Seddighin, ... Journal of Artificial Intelligence Research 64, 1-20, 2019 | 56 | 2019 |
| Approximating lcs in linear time: Beating the barrier MT Hajiaghayi, M Seddighin, S Seddighin, X Sun Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 31 | 2019 |
| Envy-free Mechanisms with Minimum Number of Cuts R Alijani, M Farhadi, M Ghodsi, M Seddighin, AS Tajik Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017 | 28 | 2017 |
| Improved algorithms for edit distance and LCS: beyond worst case M Boroujeni, M Seddighin, S Seddighin Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 12 | 2020 |
| Externalities and fairness M Seddighin, H Saleh, M Ghodsi The World Wide Web Conference, 538-548, 2019 | 11* | 2019 |
| On the distortion value of the elections with abstention M Ghodsi, M Latifian, M Seddighin Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1981-1988, 2019 | 7 | 2019 |
| Expand the shares together: envy-free mechanisms with a small number of cuts M Seddighin, M Farhadi, M Ghodsi, R Alijani, AS Tajik Algorithmica 81 (4), 1728-1755, 2019 | 7 | 2019 |
| Rent division among groups M Ghodsi, M Latifian, A Mohammadi, S Moradian, M Seddighin International Conference on Combinatorial Optimization and Applications, 577-591, 2018 | 7 | 2018 |
| Approximate minimum diameter M Ghodsi, H Homapour, M Seddighin International Computing and Combinatorics Conference, 237-249, 2017 | 5 | 2017 |
| Fair allocation of indivisible goods: Improvement M Ghodsi, MT Hajiaghayi, M Seddighin, S Seddighin, H Yami Mathematics of Operations Research 46 (3), 1038-1053, 2021 | 4 | 2021 |
| Almost envy-freeness, envy-rank, and nash social welfare matchings A Farhadi, MT Hajiaghayi, M Latifian, M Seddighin, H Yami Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5355-5362, 2021 | 4 | 2021 |
| Fair allocation of indivisible goods: Beyond additive valuations M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami Artificial Intelligence 303, 103633, 2022 | 2 | 2022 |
| On the Distortion Value of Elections with Abstention M Seddighin, M Latifian, M Ghodsi Journal of Artificial Intelligence Research 70, 567-595, 2021 | 2 | 2021 |
| Unit covering in color-spanning set model E Emamjomeh-Zadeh, M Ghodsi, H Homapour, M Seddighin International Workshop on Algorithms and Computation, 44-52, 2015 | 2 | 2015 |
| An EF2X Allocation Protocol for Restricted Additive Valuations H Akrami, R Rezvan, M Seddighin arXiv preprint arXiv:2202.13676, 2022 | | 2022 |
| Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem M Seddighin, S Seddighin | | 2022 |
| 3+ ε Approximation of Tree Edit Distance in Truly Subquadratic Time M Seddighin, S Seddighin 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022 | | 2022 |
| Approximate Competitive Equilibrium with Generic Budget A Ghiasi, M Seddighin International Symposium on Algorithmic Game Theory, 236-250, 2021 | | 2021 |
| Externalities and Fairness M Ghodsi, H Saleh, M Seddighin | | 2019 |
Mohammad GhodsiProfessor of Computer Science, Sharif University of TechnologyVerified email at sharif.edu
