| Improved approximation algorithms for prize-collecting Steiner tree and TSP A Archer, MH Bateni, MT Hajiaghayi, H Karloff SIAM journal on computing 40 (2), 309-332, 2011 | 121 | 2011 |
| Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth MH Bateni, MT Hajiaghayi, D Marx Journal of the ACM (JACM) 58 (5), 1-37, 2011 | 97 | 2011 |
| Maxmin allocation via degree lower-bounded arborescences MH Bateni, M Charikar, V Guruswami Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 87 | 2009 |
| Submodular secretary problem and extensions MH Bateni, M Hajiaghayi, M Zadimoghaddam ACM Transactions on Algorithms (TALG) 9 (4), 1-23, 2013 | 85 | 2013 |
| Submodular secretary problem and extensions MH Bateni, MT Hajiaghayi, M Zadimoghaddam Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 79 | 2010 |
| Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs S Assadi, MH Bateni, A Bernstein, V Mirrokni, C Stein Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 69 | 2019 |
| Distributed Balanced Clustering via Mapping Coresets. MH Bateni, A Bhaskara, S Lattanzi, VS Mirrokni NIPS, 2591-2599, 2014 | 62 | 2014 |
| Scheduling to minimize staleness and stretch in real-time data warehouses MH Bateni, L Golab, MT Hajiaghayi, H Karloff Theory of Computing Systems 49 (4), 757-780, 2011 | 62 | 2011 |
| Assignment problem in content distribution networks: unsplittable hard-capacitated facility location MH Bateni, MT Hajiaghayi ACM Transactions on Algorithms (TALG) 8 (3), 1-19, 2012 | 61 | 2012 |
| System and method for assigning requests in a content distribution network MT Hajiaghayi, MH Bateni US Patent 9,098,464, 2015 | 59 | 2015 |
| Affinity clustering: Hierarchical clustering at scale MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ... Proceedings of the 31st International Conference on Neural Information …, 2017 | 51 | 2017 |
| Prize-collecting Steiner problems on planar graphs M Bateni, C Chekuri, A Ene, MT Hajiaghayi, N Korula, D Marx Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 48* | 2011 |
| Network cournot competition M Abolhassani, MH Bateni, MT Hajiaghayi, H Mahini, A Sawant International Conference on Web and Internet Economics, 15-29, 2014 | 46 | 2014 |
| Distributed balanced partitioning via linear embedding K Aydin, MH Bateni, V Mirrokni Algorithms 12 (8), 162, 2019 | 44 | 2019 |
| The cooperative game theory foundations of network bargaining games MH Bateni, MT Hajiaghayi, N Immorlica, H Mahini International Colloquium on Automata, Languages, and Programming, 67-78, 2010 | 43 | 2010 |
| Revenue maximization for selling multiple correlated items MH Bateni, S Dehghani, MT Hajiaghayi, S Seddighin Algorithms-ESA 2015, 95-105, 2015 | 28 | 2015 |
| Almost optimal streaming algorithms for coverage problems MH Bateni, H Esfandiari, V Mirrokni Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017 | 24 | 2017 |
| Improved approximation algorithms for (budgeted) node-weighted steiner problems MH Bateni, MT Hajiaghayi, V Liaghat International Colloquium on Automata, Languages, and Programming, 81-92, 2013 | 24 | 2013 |
| Methods and apparatus to implement scalable routing in network communication systems M Hajiaghayi, MH Bateni, A Gerber, S Sen US Patent 8,218,454, 2012 | 24 | 2012 |
| A polynomial-time approximation scheme for planar multiway cut MH Bateni, MT Hajiaghayi, PN Klein, C Mathieu Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 24 | 2012 |
