| 2026 | ICALP | Submodular Maximization over a Matroid k-Intersection: Multiplicative Improvement over Greedy. | Moran Feldman, Justin Ward |
| 2026 | SODA | Nearly Tight Sample Complexity for Matroid Online Contention Resolution. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2025 | STOC | Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. | Niv Buchbinder, Moran Feldman |
| 2024 | AISTATS | Submodular Minimax Optimization: Finding Effective Sets. | Loay Raed Mualem, Ethan R. Elenberg, Moran Feldman, Amin Karbasi |
| 2024 | FOCS | Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. | Niv Buchbinder, Moran Feldman |
| 2024 | IJCAI | Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization. | Loay Mualem, Murad Tukan, Moran Feldman |
| 2024 | STOC | Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. | Niv Buchbinder, Moran Feldman |
| 2023 | AISTATS | Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. | Loay Mualem, Moran Feldman |
| 2022 | ESA | Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. | Kobi Bodek, Moran Feldman |
| 2022 | ESA | Submodular Maximization Subject to Matroid Intersection on the Fly. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | ICALP | Streaming Submodular Maximization Under Matroid Constraints. | Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2021 | ICML | Regularized Submodular Maximization at Scale. | Ehsan Kazemi, Shervin Minaee, Moran Feldman, Amin Karbasi |
| 2020 | ICALP | Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. | Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh |
| 2020 | ICML | Streaming Submodular Maximization under a k-Set System Constraint. | Ran Haba, Ehsan Kazemi, Moran Feldman, Amin Karbasi |
| 2020 | STOC | The one-way communication complexity of submodular maximization with applications to streaming and robustness. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2019 | ICML | Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. | Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi |
| 2019 | IPCO | Online Submodular Maximization: Beating 1/2 Made Simple. | Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg |
| 2019 | SODA | Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. | Niv Buchbinder, Moran Feldman, Mohit Garg |
| 2019 | STOC | Unconstrained submodular maximization with constant adaptive complexity. | Lin Chen, Moran Feldman, Amin Karbasi |
| 2019 | WADS | Guess Free Maximization of Submodular and Linear Sums. | Moran Feldman |
| 2018 | AISTATS | Submodularity on Hypergraphs: From Sets to Sequences. | Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi |
| 2018 | ICML | Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? | Lin Chen, Moran Feldman, Amin Karbasi |
| 2018 | SODA | A Framework for the Secretary Problem on the Intersection of Matroids. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2018 | SAGT | Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants. | Moran Feldman, Rica Gonen |
| 2017 | COLT | Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. | Moran Feldman, Christopher Harshaw, Amin Karbasi |
| 2017 | SODA | Untitled record | Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon |
| 2017 | SODA | Building a Good Team: Secretary Problems and the Supermodular Degree. | Moran Feldman, Rani Izsak |
| 2016 | ESA | Distributed Signaling Games. | Moran Feldman, Moshe Tennenholtz, Omri Weinstein |
| 2016 | SODA | Deterministic Algorithms for Submodular Maximization Problems. | Niv Buchbinder, Moran Feldman |
| 2016 | SODA | Online Contention Resolution Schemes. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2015 | ESA | Maximizing Symmetric Submodular Functions. | Moran Feldman |
| 2015 | FOCS | The Submodular Secretary Problem Goes Linear. | Moran Feldman, Rico Zenklusen |
| 2015 | SODA | Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. | Niv Buchbinder, Moran Feldman, Roy Schwartz |
| 2015 | SODA | Online Submodular Maximization with Preemption. | Niv Buchbinder, Moran Feldman, Roy Schwartz |
| 2015 | SODA | A Simple | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2014 | SODA | Submodular Maximization with Cardinality Constraints. | Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz |
| 2013 | IPCO | All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. | Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir |
| 2012 | FOCS | A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. | Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz |
| 2012 | SPAA | Hedonic clustering games. | Moran Feldman, Liane Lewin-Eytan, Joseph Naor |
| 2011 | ESA | Improved Approximations for k-Exchange Systems - (Extended Abstract). | Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward |
| 2011 | FOCS | A Unified Continuous Greedy Algorithm for Submodular Maximization. | Moran Feldman, Joseph Naor, Roy Schwartz |
| 2011 | ICALP | Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). | Moran Feldman, Joseph Naor, Roy Schwartz |
| 2011 | WADS | Frequency Capping in Online Advertising. | Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor |
| 2010 | INFOCOM | Non-Preemptive Buffer Management for Latency Sensitive Packets. | Moran Feldman, Joseph Naor |
| 2010 | WWW | Constructing travel itineraries from tagged geo-temporal breadcrumbs. | Munmun De Choudhury, Moran Feldman, Sihem Amer-Yahia, Nadav Golbandi, Ronny Lempel, Cong Yu |
| 2009 | SODA | Improved approximating algorithms for Directed Steiner Forest. | Moran Feldman, Guy Kortsarz, Zeev Nutov |