| 2013 | ||
|---|---|---|
| i2 | Oren Ben-Zwi, Ron Lavi, Ilan Newman: Ascending auctions and Walrasian equilibrium. CoRR abs/1301.1153 (2013) | |
| 2011 | ||
| j6 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: Treewidth governs the complexity of target set selection. Discrete Optimization 8(1): 87-96 (2011) | |
| j5 | Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-Zwi: Applying Property Testing to an Image Partitioning Problem. IEEE Trans. Pattern Anal. Mach. Intell. 33(2): 256-265 (2011) | |
| j4 | Oren Ben-Zwi, Amir Ronen: Local and global price of anarchy of graphical games. Theor. Comput. Sci. 412(12-14): 1196-1207 (2011) | |
| i1 | ||
| 2010 | ||
| j3 | Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz: Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411(44-46): 4017-4022 (2010) | |
| c5 | ||
| 2009 | ||
| j2 | Eyal Ackerman, Oren Ben-Zwi: On sets of points that determine only acute angles. Eur. J. Comb. 30(4): 908-910 (2009) | |
| c4 | ||
| c3 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman: An exact almost optimal algorithm for target set selection in social networks. ACM Conference on Electronic Commerce 2009: 355-362 | |
| 2008 | ||
| c2 | Oren Ben-Zwi, Amir Ronen: The Local and Global Price of Anarchy of Graphical Games. SAGT 2008: 255-266 | |
| 2007 | ||
| j1 | Oren Ben-Zwi, Oded Lachish, Ilan Newman: Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007) | |
| 2005 | ||
| c1 | ||
| 1 | Eyal Ackerman | |
| 2 | Danny Hermelin | |
| 3 | Daniel Keren | |
| 4 | Igor Kleiner | |
| 5 | Oded Lachish | |
| 6 | Ron Lavi | |
| 7 | Daniel Lokshtanov | |
| 8 | Ilan Newman | |
| 9 | Shlomit S. Pinter | |
| 10 | Amir Ronen | |
| 11 | Guy Wolfovitz |
Data released under the ODC-BY 1.0 license — See also our legal information page