| Combinatorial model and bounds for target set selection E Ackerman, O Ben-Zwi, G Wolfovitz Theoretical Computer Science 411 (44-46), 4017-4022, 2010 | 187 | 2010 |
| Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011 | 135 | 2011 |
| An exact almost optimal algorithm for target set selection in social networks O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Proceedings of the 10th ACM conference on Electronic commerce, 355-362, 2009 | 46 | 2009 |
| Applying property testing to an image partitioning problem I Kleiner, D Keren, I Newman, O Ben-Zwi IEEE transactions on pattern analysis and machine intelligence 33 (2), 256-265, 2010 | 23 | 2010 |
| Ascending auctions and Walrasian equilibrium O Ben-Zwi, R Lavi, I Newman arXiv preprint arXiv:1301.1153, 2013 | 18 | 2013 |
| Local and global price of anarchy of graphical games O Ben-Zwi, A Ronen Theoretical Computer Science, 2011 | 15 | 2011 |
| On sets of points that determine only acute angles E Ackerman, O Ben-Zwi European Journal of Combinatorics 30 (4), 908-910, 2009 | 11 | 2009 |
| Walrasian's characterization and a universal ascending auction O Ben-Zwi Games and Economic Behavior 104, 456-467, 2017 | 8 | 2017 |
| Ad Exchange: Envy-free Auctions with Mediators⋆ O Ben-Zwi, M Henzinger, V Loitzenbauer | 8 | 2016 |
| Hats, auctions and derandomization O Ben‐Zwi, I Newman, G Wolfovitz Random Structures & Algorithms 46 (3), 478-493, 2015 | 8 | 2015 |
| A new derandomization of auctions O Ben-Zwi, I Newman, G Wolfovitz International Symposium on Algorithmic Game Theory, 233-237, 2009 | 6 | 2009 |
| Lower bounds for testing Euclidean minimum spanning trees O Ben-Zwi, O Lachish, I Newman Information processing letters 102 (6), 219-225, 2007 | 6 | 2007 |
| Treewidth governs the complexity of target set selection. Discret. Optim. 8 (1), 87–96 (2011) O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Parameterized Complexity of Discrete Optimization, 0 | 6 | |
| A hat trick O Ben-Zwi, G Wolfovitz International Conference on Fun with Algorithms, 37-40, 2010 | 3 | 2010 |
| Handling sensed data in hostile environments O Ben-Zwi, SS Pinter International Conference on Mobile Ad-Hoc and Sensor Networks, 433-442, 2005 | 3 | 2005 |
| Optimal Bi-Valued Auctions O Ben-Zwi, I Newman Arxiv preprint arXiv:1106.4677, 2011 | 2 | 2011 |
| Algorithmic game theory and graphs O Ben-Zwi University of Haifa, Faculty of Social Sciences, Department of Computer Science, 2011 | 1 | 2011 |
| No Ascending Auction can find Equilibrium for SubModular valuations O Ben-Zwi, I Newman arXiv preprint arXiv:2312.00522, 2023 | | 2023 |
| Algorithmic Game Theory and Graphs/תורת המשחקים האלגוריתמית וגרפים O Ben-Zwi University of Haifa (Israel), 2011 | | 2011 |
| A New Derandomization of Auctions O Ben-Zwi, I Newman, G Wolfovitz | | |
Ilan NewmanProfessor of Computer Science, University of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
