Moran Feldman
Impact in
-
- Complexity and Algorithms in Graphs
- Transportation top 5%
- Human Mobility and Location-Based Analysis
Papers in
-
- Complexity and Algorithms in Graphs 37
- Advanced Graph Theory Research 10
- Co-authors
- M. J. MacCullochRoy SchwartzNiv BuchbinderJoseph NaorBernard CohenRonny LempelMunmun De ChoudhuryNadav Golbandi
- Journals
- SIAM Journal on Computing (5 papers)Mathematics of Operations Research (5 papers)Algorithmica (4 papers)Behaviour Research and Therapy (4 papers)ACM Transactions on Algorithms (4 papers)
- Partner nations
- IsraelUnited StatesUnited Kingdom
In The Last Decade
Moran Feldman
94 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 129
- Computational Theory and Mathematics 376
- Transportation 145
- General Psychology 25
- Clinical Psychology 397
- Computer Networks and Communications 400
Countries citing papers authored by Moran Feldman
This map shows the geographic impact of Moran Feldman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Moran Feldman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moran Feldman more than expected).
Fields of papers citing papers by Moran Feldman
This network shows the impact of papers produced by Moran Feldman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Moran Feldman. The network helps show where Moran Feldman may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Moran Feldman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 5 | |
| 2 | 2022 | 0 | |
| 3 | 2020 | 4 | |
| 4 | Adaptive Sequence Submodularity | 2019 | 2 |
| 5 | Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications | 2019 | 1 |
| 6 | Do Less, Get More: Streaming Submodular Maximization with Subsampling | 2018 | 1 |
| 7 | 2017 | 4 | |
| 8 | 2015 | 5 | |
| 9 | 2015 | 4 | |
| 10 | A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem | 2014 | 0 |
| 11 | 2013 | 64 | |
| 12 | Improved Approximations for k-Exchange Systems (Extended Abstract) | 2012 | 3 |
| 13 | Tree-Based Organization for Very Large Scale Sensor Networks | 2011 | 2 |
| 14 | Improved competitive ratios for submodular secretary problems | 2011 | 13 |
| 15 | Nonmonotone submodular maximization via a structural continuous greedy algorithm (Extended Abstract) | 2011 | 4 |
| 16 | 2006 | 8 | |
| 17 | Don't look back to anger: Inhibited to return to emotion | 2002 | 3 |
| 18 | The Prevention and control of offending | 1982 | 3 |
| 19 | 1968 | 65 | |
| 20 | 1967 | 9 |
About Moran Feldman
Moran Feldman is a scholar working on Computational Theory and Mathematics, General Psychology, Computer Networks and Communications, Management Science and Operations Research and Computer Graphics and Computer-Aided Design, having authored 100 papers that have together received 1.9k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (37 papers), Optimization and Search Problems (30 papers), Cryptography and Data Security (19 papers), Auction Theory and Applications (11 papers), Advanced Graph Theory Research (10 papers), Child and Adolescent Psychosocial and Emotional Development (6 papers), Behavioral and Psychological Studies (6 papers) and Psychotherapy Techniques and Applications (6 papers). The work is most often cited by research in Computational Theory and Mathematics (376 citations), Transportation (145 citations), General Psychology (25 citations), Clinical Psychology (397 citations) and Computer Networks and Communications (400 citations). Moran Feldman has collaborated with scholars based in Israel, United States and United Kingdom. Frequent co-authors include M. J. MacCulloch, Roy Schwartz, Niv Buchbinder, Joseph Naor, Bernard Cohen, Ronny Lempel, Munmun De Choudhury, Nadav Golbandi, Sihem Amer-Yahia and Cong Yu. Their work appears in journals such as SIAM Journal on Computing, Mathematics of Operations Research, Algorithmica, Behaviour Research and Therapy and ACM Transactions on Algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.