| A tight linear time (1/2)-approximation for unconstrained submodular maximization N Buchbinder, M Feldman, J Seffi, R Schwartz SIAM Journal on Computing 44 (5), 1384-1402, 2015 | 415 | 2015 |
| Automatic construction of travel itineraries using social breadcrumbs M De Choudhury, M Feldman, S Amer-Yahia, N Golbandi, R Lempel, ... Proceedings of the 21st ACM conference on Hypertext and hypermedia, 35-44, 2010 | 360 | 2010 |
| Submodular maximization with cardinality constraints N Buchbinder, M Feldman, JS Naor, R Schwartz Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 264 | 2014 |
| A unified continuous greedy algorithm for submodular maximization M Feldman, J Naor, R Schwartz 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 570-579, 2011 | 250 | 2011 |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem M Feldman, O Svensson, R Zenklusen Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 104 | 2014 |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem M Feldman, O Svensson, R Zenklusen Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 104 | 2014 |
| Deterministic algorithms for submodular maximization problems N Buchbinder, M Feldman ACM Transactions on Algorithms (TALG) 14 (3), 32, 2018 | 98 | 2018 |
| Streaming weak submodularity: Interpreting neural networks on the fly E Elenberg, AG Dimakis, M Feldman, A Karbasi Advances in Neural Information Processing Systems 30, 2017 | 90 | 2017 |
| Online contention resolution schemes M Feldman, O Svensson, R Zenklusen Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 90 | 2016 |
| Improved approximation algorithms for directed steiner forest M Feldman, G Kortsarz, Z Nutov Journal of Computer and System Sciences 78 (1), 279-292, 2012 | 81 | 2012 |
| Distributed decision and control for cooperative UAVs using ad hoc communication Y Ben-Asher, S Feldman, P Gurfil, M Feldman IEEE Transactions on control systems technology 16 (3), 511-516, 2008 | 76 | 2008 |
| Greed is good: Near-optimal submodular maximization via greedy optimization M Feldman, C Harshaw, A Karbasi Conference on Learning Theory, 758-784, 2017 | 73 | 2017 |
| Online submodular maximization with preemption N Buchbinder, M Feldman, R Schwartz Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 72 | 2014 |
| Constructing travel itineraries from tagged geo-temporal breadcrumbs M De Choudhury, M Feldman, S Amer-Yahia, N Golbandi, R Lempel, ... Proceedings of the 19th international conference on World wide web, 1083-1084, 2010 | 62 | 2010 |
| Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications C Harshaw, M Feldman, J Ward, A Karbasi International Conference on Machine Learning, 2634-2643, 2019 | 58 | 2019 |
| Do less, get more: Streaming submodular maximization with subsampling M Feldman, A Karbasi, E Kazemi Advances in Neural Information Processing Systems, 732-742, 2018 | 58 | 2018 |
| Constrained submodular maximization via a nonsymmetric technique N Buchbinder, M Feldman Mathematics of Operations Research 44 (3), 988-1005, 2019 | 56 | 2019 |
| Nonmonotone submodular maximization via a structural continuous greedy algorithm M Feldman, JS Naor, R Schwartz International Colloquium on Automata, Languages, and Programming, 342-353, 2011 | 56 | 2011 |
| Hedonic clustering games M Feldman, L Lewin-Eytan, J Naor ACM Transactions on Parallel Computing (TOPC) 2 (1), 1-48, 2015 | 52 | 2015 |
| Improved competitive ratios for submodular secretary problems M Feldman, JS Naor, R Schwartz Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011 | 51 | 2011 |
Joseph Seffi NaorTechnionVerified email at cs.technion.ac.il
