| The price of anarchy in network creation games ED Demaine, MT Hajiaghayi, H Mahini, M Zadimoghaddam ACM Transactions on Algorithms (TALG) 8 (2), 1-13, 2012 | 138 | 2012 |
| Minimizing movement ED Demaine, MT Hajiaghayi, H Mahini, AS Sayedi-Roshkhar, ... ACM Transactions on Algorithms (TALG) 5 (3), 1-30, 2009 | 107 | 2009 |
| Randomized composable core-sets for distributed submodular maximization V Mirrokni, M Zadimoghaddam Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 103 | 2015 |
| Online stochastic weighted matching: Improved approximation algorithms B Haeupler, VS Mirrokni, M Zadimoghaddam International workshop on internet and network economics, 170-181, 2011 | 99 | 2011 |
| Minimizing the diameter of a network using shortcut edges ED Demaine, M Zadimoghaddam Scandinavian Workshop on Algorithm Theory, 420-431, 2010 | 85 | 2010 |
| Submodular secretary problem and extensions MH Bateni, M Hajiaghayi, M Zadimoghaddam ACM Transactions on Algorithms (TALG) 9 (4), 1-23, 2013 | 82 | 2013 |
| Submodular secretary problem and extensions MH Bateni, MT Hajiaghayi, M Zadimoghaddam Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 79 | 2010 |
| Simultaneous approximations for adversarial and stochastic online budgeted allocation VS Mirrokni, SO Gharan, M Zadimoghaddam Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 76 | 2012 |
| Optimal coalition structure generation in cooperative graph games Y Bachrach, P Kohli, V Kolmogorov, M Zadimoghaddam Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 2013 | 72* | 2013 |
| Online submodular welfare maximization: Greedy beats 1/2 in random order N Korula, V Mirrokni, M Zadimoghaddam SIAM Journal on Computing 47 (3), 1056-1086, 2018 | 66 | 2018 |
| How to influence people with partial incentives ED Demaine, MT Hajiaghayi, H Mahini, DL Malec, S Raghavan, A Sawant, ... Proceedings of the 23rd international conference on World wide web, 937-948, 2014 | 47 | 2014 |
| Scalable deletion-robust submodular maximization: Data summarization with privacy and fairness constraints E Kazemi, M Zadimoghaddam, A Karbasi International conference on machine learning, 2544-2553, 2018 | 44* | 2018 |
| Greedy column subset selection: New bounds and distributed algorithms J Altschuler, A Bhaskara, G Fu, V Mirrokni, A Rostamizadeh, ... International conference on machine learning, 2539-2548, 2016 | 44* | 2016 |
| Fast Distributed Submodular Cover: Public-Private Data Summarization. B Mirzasoleiman, M Zadimoghaddam, A Karbasi NIPS, 3594-3602, 2016 | 41 | 2016 |
| Efficiently learning from revealed preference M Zadimoghaddam, A Roth International Workshop on Internet and Network Economics, 114-127, 2012 | 40 | 2012 |
| The price of anarchy in cooperative network creation games ED Demaine, MT Hajiaghayi, H Mahini, M Zadimoghaddam ACM SIGecom Exchanges 8 (2), 1-20, 2009 | 40 | 2009 |
| Submodular maximization with nearly optimal approximation, adaptivity and query complexity M Fahrbach, V Mirrokni, M Zadimoghaddam Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 39 | 2019 |
| Optimal-time adaptive strong renaming, with applications to counting D Alistarh, J Aspnes, K Censor-Hillel, S Gilbert, M Zadimoghaddam Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 38 | 2011 |
| Submodular optimization over sliding windows A Epasto, S Lattanzi, S Vassilvitskii, M Zadimoghaddam Proceedings of the 26th International Conference on World Wide Web, 421-430, 2017 | 37 | 2017 |
| Online stochastic matching with unequal probabilities A Mehta, B Waggoner, M Zadimoghaddam Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 37 | 2014 |
Vahab MirrokniDistinguished Scientist, Google Research, New YorkVerified email at google.com
