Rubin, Natan

1. An Improved Bound for Weak Epsilon-Nets in the Plane
   2018/08/08 by Natan Rubin, Rubin, Natan · 1 citation
   Computer Science · Mathematics · #52A10 #52A35 #52A37 #52C15 #52C30 #52C45 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #Point processes and geometric inequalities
2. Planar Point Sets Determine Many Pairwise Crossing Segments
   2019/04/18 by Pach, János, Rubin, Natan, Tardos, Gábor · 1 citation
   #05C10 #05C35 #05D10 #05D40 #06C15 #52C10 #52C30 #52C45 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
3. An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
   2024/07/22 by Rubin, Natan · 1 citation
   #05C65 #05D10 #52A35 #52C35 #52C45 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2