Metrical Routing using Ad-Hoc Networks in Hierarchical Environment. - Yosi Ben-Asher; Moran Feldman; Sharoni Feldman; Pini Gurfil (ITRE, 2006)

Ad-Hoc Routing Using Virtual Coordinates Based on Rooted Trees. - Yosi Ben-Asher; Moran Feldman; Sharoni Feldman (SUTC (1), 2006)

IFAS: Interactive flexible ad hoc simulator. - Yosi Ben-Asher; Moran Feldman; Sharoni Feldman; Pini Gurfil (Simul. Model. Pract. Theory, 2007)

Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks. - Yosi Ben-Asher; Sharoni Feldman; Pini Gurfil; Moran Feldman (J. Aerosp. Comput. Inf. Commun., 2008)

Distributed Decision and Control for Cooperative UAVs Using Ad Hoc Communication. - Yosi Ben-Asher; Sharoni Feldman; Pini Gurfil; Moran Feldman (IEEE Trans. Control. Syst. Technol., 2008)

Improved approximating algorithms for Directed Steiner Forest. - Moran Feldman; Guy Kortsarz; Zeev Nutov (SODA, 2009)

Automatic construction of travel itineraries using social breadcrumbs. - Munmun De Choudhury; Moran Feldman; Sihem Amer-Yahia; Nadav Golbandi; Ronny Lempel; Cong Yu 001 (HT, 2010)

Constructing travel itineraries from tagged geo-temporal breadcrumbs. - Munmun De Choudhury; Moran Feldman; Sihem Amer-Yahia; Nadav Golbandi; Ronny Lempel; Cong Yu 001 (WWW, 2010)

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing. - Yosi Ben-Asher; Sharoni Feldman; Moran Feldman; Pini Gurfil (Wirel. Pers. Commun., 2010)

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002 (APPROX-RANDOM, 2011)

Improved Approximations for k-Exchange Systems - (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002; Justin Ward (ESA, 2011)

A Unified Continuous Greedy Algorithm for Submodular Maximization. - Moran Feldman; Joseph Naor; Roy Schwartz 002 (FOCS, 2011)

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002 (ICALP (1), 2011)

Dynamic Multipath Allocation in Ad Hoc Networks. - Yosi Ben-Asher; Sharoni Feldman; Moran Feldman (Comput. J., 2011)

On the Impact of Random Index-Partitioning on Index Compression - Moran Feldman; Ronny Lempel; Oren Somekh; Kolman Vornovitsky (CoRR, 2011)

Interviewing secretaries in parallel. - Moran Feldman; Moshe Tennenholtz (EC, 2012)

Improved approximation algorithms for Directed Steiner Forest. - Moran Feldman; Guy Kortsarz; Zeev Nutov (J. Comput. Syst. Sci., 2012)

Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? - Moran Feldman; Reshef Meir; Moshe Tennenholtz (WINE, 2013)

Maximization problems with submodular objective functions. - Moran Feldman (2013)

Constrained Monotone Function Maximization and the Supermodular Degree. - Moran Feldman; Rani Izsak (APPROX-RANDOM, 2014)

Submodular Maximization with Cardinality Constraints. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SODA, 2014)

A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2014)

Display Advertising with Information Mediators. - Moran Feldman; Moshe Tennenholtz; Omri Weinstein (CoRR, 2014)

Frequency capping in online advertising. - Niv Buchbinder; Moran Feldman; Arpita Ghosh; Joseph Naor (J. Sched., 2014)

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (SODA, 2015)

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2015)

Hedonic Clustering Games. - Moran Feldman; Liane Lewin-Eytan; Joseph Naor (ACM Trans. Parallel Comput., 2015)

Online Contention Resolution Schemes. - Moran Feldman; Ola Svensson; Rico Zenklusen (SODA, 2016)

Constrained Submodular Maximization via a Non-symmetric Technique. - Niv Buchbinder; Moran Feldman (CoRR, 2016)

Markets with Strategic Multi-minded Mediators. - Moran Feldman; Rica Gonen (CoRR, 2016)

Online Truthful Mechanisms for Multi-sided Markets. - Moran Feldman; Rica Gonen (CoRR, 2016)

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. - Ron Adany; Moran Feldman; Elad Haramaty; Rohit Khandekar; Baruch Schieber; Roy Schwartz 002; Hadas Shachnai; Tami Tamir (ACM Trans. Algorithms, 2016)

Mechanism Design with Strategic Mediators. - Moshe Babaioff; Moran Feldman; Moshe Tennenholtz (ACM Trans. Economics and Comput., 2016)

Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. - Moran Feldman; Christopher Harshaw; Amin Karbasi (COLT, 2017)

Streaming Weak Submodularity: Interpreting Neural Networks on the Fly. - Ethan R. Elenberg; Alexandros G. Dimakis; Moran Feldman; Amin Karbasi (NIPS, 2017)

O(depth)-Competitive Algorithm for Online Multi-level Aggregation. - Niv Buchbinder; Moran Feldman; Joseph (Seffi) Naor; Ohad Talmon (SODA, 2017)

Building a Good Team: Secretary Problems and the Supermodular Degree. - Moran Feldman; Rani Izsak (SODA, 2017)

Revenue and Reserve Prices in a Probabilistic Single Item Auction. - Noga Alon; Moran Feldman; Moshe Tennenholtz (Algorithmica, 2017)

O(depth)-Competitive Algorithm for Online Multi-level Aggregation. - Niv Buchbinder; Moran Feldman; Joseph Naor; Ohad Talmon (CoRR, 2017)

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (Math. Oper. Res., 2017)

Non-preemptive buffer management for latency sensitive packets. - Moran Feldman; Joseph (Seffi) Naor (J. Sched., 2017)

Maximizing Symmetric Submodular Functions. - Moran Feldman (ACM Trans. Algorithms, 2017)

Submodular Functions Maximization Problems. - Niv Buchbinder; Moran Feldman (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Submodularity on Hypergraphs: From Sets to Sequences. - Marko Mitrovic; Moran Feldman; Andreas Krause 001; Amin Karbasi (AISTATS, 2018)

Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations. - Moran Feldman; Gonen Frim; Rica Gonen (GameSec, 2018)

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? - Lin Chen 003; Moran Feldman; Amin Karbasi (ICML, 2018)

Do Less, Get More: Streaming Submodular Maximization with Subsampling. - Moran Feldman; Amin Karbasi; Ehsan Kazemi 001 (NeurIPS, 2018)

Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants. - Moran Feldman; Rica Gonen (SAGT, 2018)

Online Submodular Maximization: Beating 1/2 Made Simple. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (CoRR, 2018)

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (Math. Oper. Res., 2018)

The Submodular Secretary Problem Goes Linear. - Moran Feldman; Rico Zenklusen (SIAM J. Comput., 2018)

Deterministic Algorithms for Submodular Maximization Problems. - Niv Buchbinder; Moran Feldman (ACM Trans. Algorithms, 2018)

Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. - Chris Harshaw; Moran Feldman; Justin Ward; Amin Karbasi (ICML, 2019)

Adaptive Sequence Submodularity. - Marko Mitrovic; Ehsan Kazemi 001; Moran Feldman; Andreas Krause 001; Amin Karbasi (NeurIPS, 2019)

Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (SODA, 2019)

Unconstrained submodular maximization with constant adaptive complexity. - Lin Chen 003; Moran Feldman; Amin Karbasi (STOC, 2019)

Almost Optimal Semi-streaming Maximization for k-Extendible Systems. - Moran Feldman; Ran Haba (CoRR, 2019)

Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint. - Naor Alaluf; Moran Feldman (CoRR, 2019)

Constrained Submodular Maximization via a Nonsymmetric Technique. - Niv Buchbinder; Moran Feldman (Math. Oper. Res., 2019)

Online Submodular Maximization with Preemption. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (ACM Trans. Algorithms, 2019)

Algorithms for Big Data - Moran Feldman (WorldScientific, 2020)

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. - Naor Alaluf; Alina Ene; Moran Feldman; Huy L. Nguyen; Andrew Suh (ICALP, 2020)

Streaming Submodular Maximization under a k-Set System Constraint. - Ran Haba; Ehsan Kazemi 001; Moran Feldman; Amin Karbasi (ICML, 2020)

Continuous Submodular Maximization: Beyond DR-Submodularity. - Moran Feldman; Amin Karbasi (NeurIPS, 2020)

Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization. - Moran Feldman; Christopher Harshaw; Amin Karbasi (CoRR, 2020)

Online submodular maximization: beating 1/2 made simple. - Niv Buchbinder; Moran Feldman; Yuval Filmus; Mohit Garg 003 (Math. Program., 2020)

Distributed Signaling Games. - Moran Feldman; Moshe Tennenholtz; Omri Weinstein (ACM Trans. Economics and Comput., 2020)

Regularized Submodular Maximization at Scale. - Ehsan Kazemi 001; Shervin Minaee; Moran Feldman; Amin Karbasi (ICML, 2021)

Submodular + Concave. - Siddharth Mitra; Moran Feldman; Amin Karbasi (NeurIPS, 2021)

Guess Free Maximization of Submodular and Linear Sums. - Moran Feldman (Algorithmica, 2021)

Streaming Submodular Maximization with Matroid and Matching Constraints. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (CoRR, 2021)

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2021)

Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. - Kobi Bodek; Moran Feldman (ESA, 2022)

Submodular Maximization Subject to Matroid Intersection on the Fly. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ESA, 2022)

Streaming Submodular Maximization Under Matroid Constraints. - Moran Feldman; Paul Liu 001; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ICALP, 2022)

Submodular Maximization in Clean Linear Time. - Wenxin Li; Moran Feldman; Ehsan Kazemi 001; Amin Karbasi (NeurIPS, 2022)

Using Partial Monotonicity in Submodular Maximization. - Loay Mualem; Moran Feldman (NeurIPS, 2022)

Correction to: Guess Free Maximization of Submodular and Linear Sums. - Moran Feldman (Algorithmica, 2022)

The Power of Subsampling in Submodular Maximization. - Christopher Harshaw; Ehsan Kazemi 001; Moran Feldman; Amin Karbasi (Math. Oper. Res., 2022)

A Framework for the Secretary Problem on the Intersection of Matroids. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2022)

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint. - Naor Alaluf; Alina Ene; Moran Feldman; Huy L. Nguyen; Andrew Suh (Math. Oper. Res., 2022)

Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. - Loay Mualem; Moran Feldman (AISTATS, 2023)

How Do You Want Your Greedy: Simultaneous or Repeated? - Moran Feldman; Christopher Harshaw; Amin Karbasi (J. Mach. Learn. Res., 2023)

Practical Budgeted Submodular Maximization. - Moran Feldman; Zeev Nutov; Elad Shoham (Algorithmica, 2023)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (J. ACM, 2023)

Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (SIAM J. Comput., 2023)

Submodular Minimax Optimization: Finding Effective Sets. - Loay Raed Mualem; Ethan R. Elenberg; Moran Feldman; Amin Karbasi (AISTATS, 2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. - Niv Buchbinder; Moran Feldman (FOCS, 2024)

Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization. - Loay Mualem; Murad Tukan; Moran Feldman (IJCAI, 2024)

Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint. - Murad Tukan; Loay Mualem; Moran Feldman (NeurIPS, 2024)

Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. - Niv Buchbinder; Moran Feldman (STOC, 2024)

Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. - Moran Feldman; Ariel Szarf (Algorithmica, 2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. - Niv Buchbinder; Moran Feldman (STOC, 2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2025)

Bicriteria Submodular Maximization. - Moran Feldman; Alan Kuhnle (CoRR, 2025)