Moran Feldman - Home Page
Moran Feldman - Home Page
I am a post-doc at EPFL, under the supervision of Prof. Ola Svensson. I received my Ph.D. in Computer Science from the Technion - Israel Institute of Technology. My Ph.D. advisor was Prof. Seffi Naor. I recieved my M.Sc. and B.A. in Computer Science from the Open University of Israel. My M.Sc. advisor was Prof. Zeev Nutov.
EPFL-IC-THL2
Station 14
1015 Lausanne
Switzerland
Office: INJ 131
Phone: +41-21-6937582
E-mail: moran.feldman@epfl.ch
236359 - Algorithms 2 (Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013)
234118 - Computer Organization and Programming (Winter 2008-2009, Winter 2009-2010, Winter 2010-2011, Spring 2011, Winter 2011-2012, Winter 2012-2013)
Deterministic Algorithms for Submodular Maximization Problems. Niv Buchbinder and Moran Feldman, submitted.
Online Contention Resolution Schemes. Moran Feldman, Ola Svensson and Rico Zenklusen, submitted.
Building a Good Team: Secretary Problems and the Supermodular Degree. Moran Feldman and Rani Izsak, submitted.
Display Advertising with Information Mediators. Moran Feldman, Moshe Tennenholtz and Omri Weinstein, submitted.
The Submodular Secretary Problem Goes Linear. Moran Feldman and Rico Zenklusen, to appear in FOCS 2015.
Maximizing Symmetric Submodular Functions. Moran Feldman, to appear in ESA 2015.
Mechanism Design with Strategic Mediators. Moshe Babaioff, Moran Feldman and Moshe Tennenholtz, 6th Innovations in Theoretical Computer Science Conference (ITCS 2015).
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. Niv Buchbinder, Moran Feldman and Roy Schwartz, 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015).
Online Submodular Maximization with Preemption. Niv Buchbinder, Moran Feldman and Roy Schwartz, 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015).
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Moran Feldman, Ola Svensson and Rico Zenklusen, 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015).
Constrained Monotone Function Maximization and the Supermodular Degree. Moran Feldman and Rani Izsak, 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2014).
Submodular Maximization with Cardinality Constraints. Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).
Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? Moran Feldman, Reshef Meir and Moshe Tennenholtz, 9th Conference on Web and Internet Economics (WINE 2013).
All-or-Nothing Generalized Assignment with Applications to Scheduling Advertising Campaigns. Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai and Tami Tamir, 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013).
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012).
Hedonic clustering Games. Moran Feldman, Liane Lewin-Eytan and Jossef (Seffi) Naor, 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012).
Interviewing Secretaries in Parallel. Moran Feldman and Moshe Tennenholtz, 13th ACM Conference on Electronic Commerce (EC 2012).
Improved Approximations for k-Exchange Systems. Moran Feldman, Joseph (Seffi) Naor, Roy Schwartz and Justin Ward, 19th Annual European Symposium on Algorithms (ESA 2011).
A Unified Continuous Greedy Algorithm for Submodular Maximization. Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011).
Improved Competitive Ratios for Submodular Secretary Problems. Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011).
Tree Based Organization for Very Large Scale Sensor Networks. Sharoni Feldman and Moran Feldman, 5th International Conference on Sensor Technologies and Applications (SENSORCOMM 2011).
Frequency Capping in Online Advertising. Niv Buchbinder, Moran Feldman, Arpita Ghosh and Jossef (Seffi) Naor, Algorithms And Data Structures Symposium (WADS 2011).
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm. Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, 38th International Colloquium on Automata, Languages and Programming (ICALP 2011).
Automatic Construction of Travel Itineraries using Social Breadcrumbs. Munmun De Choudhury, Moran Feldman, Sihem Amer-Yahia, Niv Golbandi, Ronny Lempel and Cong Yu, 21st ACM Conference on Hypertext and Hypermedia (Hypertext 2010).
Constructing Travel Itineraries from Tagged Geo-temporal Breadcrumbs. Munmun De Choudhury, Moran Feldman, Sihem Amer-Yahia, Niv Golbandi, Ronny Lempel and Cong Yu, 19th World Wide Web Conference (WWW 2010).
Non-Preemptive Buffer Management for Latency Sensitive Packets. Moran Feldman and Jossef (Seffi) Naor, 29th Conference on Computer Communications (INFOCOM 2010).
Improved Approximating Algorithms for Directed Steiner Forest. Moran Feldman, Guy Kortsarz and Zehev Nutov, ACM-SIAM Symposium on Discrete Algorithms (SODA 2009).
Dynamic Multipath Allocation in Ad Hoc Networks. Yossi Ben-Asher, Sharoni Feldman and Moran Feldman, International Conference on Advances in Mesh Networks (MESH 2008).
Coordination and Communication of Cooperative Parafoils for Humanitarian Aid. Pini Gurfil, Sharoni Feldman and Moran Feldman, Israel Annual Conference on Aerospace Sciences (IACAS 2008).
Metrical Routing Using Ad-Hoc Networks in Hierarchical Environment. Yossi Ben-Asher, Moran Feldman, Sharoni Feldman and Pini Gurfil, Information Technology: Research and Education (ITRE 2006).
Hierarchical Decision and Control for Cooperative Multi–UAV Systems Using Ad-hoc Communication. Yossi Ben-Asher, Sharoni Feldman, Pini Gurfil and Moran Feldman, Israel Annual Conference on Aerospace Sciences (IACAS 2006).
Ad-hoc Routing Using Virtual Coordinates Based on Rooted Trees. Yossi Ben-Asher, Moran Feldman and Sharoni Feldman, International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC 2006).
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. Niv Buchbinder, Moran Feldman and Roy Schwartz, submitted.
Mechanism Design with Strategic Mediators. Moshe Babaioff, Moran Feldman and Moshe Tennenholtz, submitted.
Online Submodular Maximization with Preemption. Niv Buchbinder, Moran Feldman and Roy Schwartz, submitted.
All-or-Nothing Generalized Assignment with Applications to Scheduling Advertising Campaigns. Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai and Tami Tamir, submitted.
Non-Preemptive Buffer Management for Latency Sensitive Packets. Moran Feldman and Jossef (Seffi) Naor, submitted.
Revenue and Reserve Prices in a Probabilistic Single Item Auction. Noga Alon, Moran Feldman and Moshe Tennenholtz, to appear in Algorithmica.
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor and Roy Schwartz, to appear in SIAM Journal on Computing.
Hedonic Clustering Games. Moran Feldman, Liane Lewin-Eytan and Jossef (Seffi) Naor, ACM Transactions on Parallel Computing, Volume 2, Issue 1, May 2015, pages 4:1-4:48.
Frequency Capping in Online Advertising. Niv Buchbinder, Moran Feldman, Arpita Ghosh and Jossef (Seffi) Naor, Journal of Scheduling, Volume 17, Issue 4, August 2014, pages 385-398.
Effective Management and Energy efficiency in Management of Very Large Scale Sensor Network. Moran Feldman and Sharoni Feldman, Sensors and Transducers Journal, Volume 14, Number 1, March 2012, pages 46-63.
Improved Approximation Algorithms for Directed Steiner Forest. Moran Feldman, Guy Kortsarz and Zehev Nutov, Journal of Computer and System Sciences, Volume 78, Number 1, January 2012, pages 279-292.
Dynamic multipath allocation in Ad Hoc networks. Yossi Ben-Asher, Sharoni Feldman and Moran Feldman, The Computer Journal (Oxford Journals), Volume 54, Issue 2, Feburary 2011, pages 197-212.
Coordination and Communication of Cooperative Parafoils for Humanitarian Aid. Pini Gurfil, Sharoni Feldman and Moran Feldman, IEEE Transactions on Aerospace and Electronic Systems (TAES), Volume 46, Number 4, October 2010, pages 1747-1761.
Scalability Issues in Ad Hoc Networking: Metrical Routing vs. Table-driven Routing. Yossi Ben-Asher, Sharoni Feldman, Moran Feldman and Pini Gurfil, Wireless Personal Communications (Springer) Volume 52, Issue 3, February 2010, pages 423-447.
Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks Yossi Ben-Asher, Sharoni Feldman, Pini Gurfil and Moran Feldman, Journal of Aerospace Computing, Information, and Communication (JACIC), Volume 5, Issue 8, August 2008, pages 234-250.
Distributed decision and control for cooperative UAVs using Ad-Hoc communication. Yossi Ben-Asher, Sharoni Feldman, Pini Gurfil and Moran Feldman, IEEE Transactions on Control Systems Technology, Volume 16, Issue 3, May 2008, pages 511-516.
IFAS: Interactive Flexible Ad hoc Simulator. Yossi Ben-Asher, Moran Feldman, Sharoni Feldman and Pini Gurfil, Simulation Modeling Practice and Theory, Volume 15, Issue 7, August 2007, pages 817-830.
Maximization Problems with Submodular Objective Functions. Advisor: Prof Seffi Naor.
Ph.D. Thesis. Computer Science Department, Technion - Israel Institute of Technology, Israel, July 2013.
Approximating Minimum Cost Steiner Forests. Advisor: Prof. Zeev Nutov
M.Sc. Thesis. Computer Science Department, The Open University, Israel, July 2008.