Winning Fast in Sparse Graph Construction Games. - Ohad N. Feldheim; Michael Krivelevich (Comb. Probab. Comput., 2008)

The Brunn–Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. - Noga Alon; Ohad N. Feldheim (SIAM J. Discret. Math., 2010)

3/2 firefighters are not enough. - Ohad N. Feldheim; Rani Hod (Discret. Appl. Math., 2013)

Drawing outerplanar graphs using three edge lengths. - Noga Alon; Ohad N. Feldheim (Comput. Geom., 2015)

The Power of One-Retry in Reducing Discrepancy. - Ohad N. Feldheim; Ori Gurel-Gurevich (CoRR, 2016)

Monotonicity of Avoidance Coupling on KN. - Ohad N. Feldheim (Comb. Probab. Comput., 2017)

The power of thinning in balanced allocation. - Ohad N. Feldheim; Ori Gurel-Gurevich (CoRR, 2018)

The Growth Constant of Odd Cutsets in High Dimensions. - Ohad N. Feldheim; Yinon Spinka (Comb. Probab. Comput., 2018)

Well-Balanced Allocation on General Graphs. - Nikhil Bansal 001; Ohad N. Feldheim (CoRR, 2021)

Long-term balanced allocation via thinning. - Ohad N. Feldheim; Ori Gurel-Gurevich; Jiange Li (CoRR, 2021)

The power of two choices in graphical allocation. - Nikhil Bansal 001; Ohad N. Feldheim (STOC, 2022)

Multi-layered planar firefighting. - Arye Deutsch; Ohad Noy Feldheim; Rani Hod (Discret. Math., 2022)

Min-Cost-Flow Preserving Bijection Between Subgraphs and Orientations. - Izhak Elmaleh; Ohad N. Feldheim (Electron. J. Comb., 2023)

Drawing outerplanar graphs using thirteen edge lengths. - Ziv Bakhajian; Ohad Noy Feldheim (Comput. Geom., 2023)