Ohad N. Feldheim

14 papers A* 1Journal 13
YearRankTypeTitle / Venue / Authors
2023 J jnl
Min-Cost-Flow Preserving Bijection Between Subgraphs and Orientations.
Electron. J. Comb.
Izhak Elmaleh, Ohad N. Feldheim
2022 A* conf
The power of two choices in graphical allocation.
STOC
Nikhil Bansal, Ohad N. Feldheim
2021 J jnl
Long-term balanced allocation via thinning.
CoRR
Ohad N. Feldheim, Ori Gurel-Gurevich, Jiange Li
2021 J jnl
Min-cost-flow preserving bijection between subgraphs and orientations.
CoRR
Izhak Elmaleh, Ohad N. Feldheim
2021 J jnl
Well-Balanced Allocation on General Graphs.
CoRR
Nikhil Bansal, Ohad N. Feldheim
2018 J jnl
The Growth Constant of Odd Cutsets in High Dimensions.
Comb. Probab. Comput.
Ohad N. Feldheim, Yinon Spinka
2018 J jnl
The power of thinning in balanced allocation.
CoRR
Ohad N. Feldheim, Ori Gurel-Gurevich
2017 J jnl
Monotonicity of Avoidance Coupling on KN.
Comb. Probab. Comput.
Ohad N. Feldheim
2016 J jnl
The Power of One-Retry in Reducing Discrepancy.
CoRR
Ohad N. Feldheim, Ori Gurel-Gurevich
2015 J jnl
Drawing outerplanar graphs using three edge lengths.
Comput. Geom.
Noga Alon, Ohad N. Feldheim
2013 J jnl
3/2 firefighters are not enough.
Discret. Appl. Math.
Ohad N. Feldheim, Rani Hod
2010 J jnl
3/2 Firefighters are not enough
CoRR
Ohad N. Feldheim, Rani Hod
2010 J jnl
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus.
SIAM J. Discret. Math.
Noga Alon, Ohad N. Feldheim
2008 J jnl
Winning Fast in Sparse Graph Construction Games.
Comb. Probab. Comput.
Ohad N. Feldheim, Michael Krivelevich