Follow
Oren Ben-Zwi
Oren Ben-Zwi
Computer Science, Tel-Hai College
Verified email at cs.haifa.ac.il - Homepage
Title
Cited by
Cited by
Year
Combinatorial model and bounds for target set selection
E Ackerman, O Ben-Zwi, G Wolfovitz
Theoretical Computer Science 411 (44-46), 4017-4022, 2010
1822010
Treewidth governs the complexity of target set selection
O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman
Discrete Optimization 8 (1), 87-96, 2011
1342011
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
462009
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
232010
Ascending auctions and Walrasian equilibrium
O Ben-Zwi, R Lavi, I Newman
arXiv preprint arXiv:1301.1153, 2013
182013
Local and global price of anarchy of graphical games
O Ben-Zwi, A Ronen
Theoretical Computer Science, 2011
152011
On sets of points that determine only acute angles
E Ackerman, O Ben-Zwi
European Journal of Combinatorics 30 (4), 908-910, 2009
112009
Walrasian's characterization and a universal ascending auction
O Ben-Zwi
Games and Economic Behavior 104, 456-467, 2017
82017
Ad Exchange: Envy-free Auctions with Mediators⋆
O Ben-Zwi, M Henzinger, V Loitzenbauer
82016
Hats, auctions and derandomization
O Ben‐Zwi, I Newman, G Wolfovitz
Random Structures & Algorithms 46 (3), 478-493, 2015
82015
A new derandomization of auctions
O Ben-Zwi, I Newman, G Wolfovitz
International Symposium on Algorithmic Game Theory, 233-237, 2009
62009
Lower bounds for testing Euclidean minimum spanning trees
O Ben-Zwi, O Lachish, I Newman
Information processing letters 102 (6), 219-225, 2007
62007
Treewidth governs the complexity of target set selection. Discrete Optim. 8 (1), 87–96 (2011)
O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman
Parameterized Complexity of Discrete Optimization, 0
5
A hat trick
O Ben-Zwi, G Wolfovitz
International Conference on Fun with Algorithms, 37-40, 2010
32010
Handling sensed data in hostile environments
O Ben-Zwi, SS Pinter
International Conference on Mobile Ad-Hoc and Sensor Networks, 433-442, 2005
32005
Optimal Bi-Valued Auctions
O Ben-Zwi, I Newman
Arxiv preprint arXiv:1106.4677, 2011
22011
Algorithmic game theory and graphs
O Ben-Zwi
University of Haifa, Faculty of Social Sciences, Department of Computer Science, 2011
12011
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
The system can't perform the operation now. Try again later.
Articles 1–20