Ohad N. Feldheim

According to our database, Ohad N. Feldheim authored at least 14 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Drawing outerplanar graphs using thirteen edge lengths.

Ziv Bakhajian, Ohad Noy Feldheim

Comput. Geom., 2023

Min-Cost-Flow Preserving Bijection Between Subgraphs and Orientations.

Izhak Elmaleh, Ohad N. Feldheim

Electron. J. Comb., 2023

2022

Multi-layered planar firefighting.

Arye Deutsch, Ohad Noy Feldheim, Rani Hod

Discret. Math., 2022

The power of two choices in graphical allocation.

Nikhil Bansal, Ohad N. Feldheim

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Long-term balanced allocation via thinning.

Ohad N. Feldheim, Ori Gurel-Gurevich, Jiange Li

CoRR, 2021

Well-Balanced Allocation on General Graphs.

Nikhil Bansal, Ohad N. Feldheim

CoRR, 2021

2018

The Growth Constant of Odd Cutsets in High Dimensions.

Ohad N. Feldheim, Yinon Spinka

Comb. Probab. Comput., 2018

The power of thinning in balanced allocation.

Ohad N. Feldheim, Ori Gurel-Gurevich

CoRR, 2018

2017

Monotonicity of Avoidance Coupling on KN.

Ohad N. Feldheim

Comb. Probab. Comput., 2017

2016

The Power of One-Retry in Reducing Discrepancy.

Ohad N. Feldheim, Ori Gurel-Gurevich

CoRR, 2016

2015

Drawing outerplanar graphs using three edge lengths.

Noga Alon, Ohad N. Feldheim

Comput. Geom., 2015

2013

3/2 firefighters are not enough.

Ohad N. Feldheim, Rani Hod

Discret. Appl. Math., 2013

2010

The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus.

Noga Alon, Ohad N. Feldheim

SIAM J. Discret. Math., 2010

2008

Winning Fast in Sparse Graph Construction Games.

Ohad N. Feldheim, Michael Krivelevich

Comb. Probab. Comput., 2008