| 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 | 67 | 2018 |
| Approximating edit distance in truly subquadratic time: Quantum and mapreduce M Boroujeni, S Ehsani, M Ghodsi, MT HajiAghayi, S Seddighin Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 44 | 2018 |
| From Duels to Battlefields: Computing Equilibria of Blotto and Other Games AM Ahmadinejad, S Dehghani, MT Hajiaghay, B Lucier, H Mahini, ... Thirtieth AAAI Conference on Artificial Intelligence, 2016 | 44 | 2016 |
| Fair allocation of indivisible goods to Asymmertic Agents M Ghodsi, MT HajiAghayi, M Seddighin, S Seddighin, H Yami Proceedings of the 2018 ACM Conference on Economics and Computation, 539-556, 2018 | 31* | 2018 |
| Faster and simpler algorithm for optimal strategies of Blotto game S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin arXiv preprint arXiv:1612.04029, 2016 | 28 | 2016 |
| Revenue Maximization for Selling Multiple Correlated Items. arxiv report, 2015 M Bateni, S Dehghani, M Hajiaghayi, S Seddighin | 25* | |
| Stochastic k-Server: How Should Uber Work? S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin arXiv preprint arXiv:1705.05755, 2017 | 24* | 2017 |
| Massively parallel approximation algorithms for edit distance and longest common subsequence MT Hajiaghayi, S Seddighin, X Sun Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 17 | 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 | 16 | 2019 |
| Approximation algorithms for LCS and LIS with truly improved running times A Rubinstein, S Seddighin, Z Song, X Sun 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 13 | 2019 |
| A tight algorithm for strongly connected Steiner subgraph on two terminals with demands RH Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ... International Symposium on Parameterized and Exact Computation, 159-171, 2014 | 11 | 2014 |
| From battlefields to elections: Winning strategies of blotto and auditing games S Behnezhad, A Blum, M Derakhshan, MT HajiAghayi, M Mahdian, ... Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 10 | 2018 |
| Fast algorithms for knapsack via convolution and prediction MH Bateni, MT Hajiaghayi, S Seddighin, C Stein Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 9 | 2018 |
| Optimal strategies of blotto games: Beyond convexity S Behnezhad, A Blum, M Derakhshan, MT Hajiaghayi, CH Papadimitriou, ... Proceedings of the 2019 ACM Conference on Economics and Computation, 597-616, 2019 | 8 | 2019 |
| Covering Orthogonal Polygons with Sliding k-Transmitters. SS Mahdavi, S Seddighin, M Ghodsi CCCG, 2014 | 8* | 2014 |
| Online weighted degree-bounded Steiner networks via novel online mixed packing/covering S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, H Racke, S Seddighin arXiv preprint arXiv:1704.05811, 2017 | 7 | 2017 |
| Improved mpc algorithms for edit distance and ulam distance M Boroujeni, S Seddighin The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 31-40, 2019 | 6 | 2019 |
| Spatio-temporal games beyond one dimension S Behnezhad, M Derakhshan, M Hajiaghayi, S Seddighin Proceedings of the 2018 ACM Conference on Economics and Computation, 411-428, 2018 | 6 | 2018 |
| How effectively can we form opinions? AM Ahmadinejad, S Dehghani, MT Hajiaghayi, H Mahini, S Seddighin, ... Proceedings of the 23rd International Conference on World Wide Web, 213-214, 2014 | 5 | 2014 |
| Dynamic algorithms for LIS and distance to monotonicity M Mitzenmacher, S Seddighin Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 4 | 2020 |
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
