Counting colors in boxes. - Haim Kaplan; Natan Rubin; Micha Sharir; Elad Verbin (SODA, 2007)

Efficient Colored Orthogonal Range Counting. - Haim Kaplan; Natan Rubin; Micha Sharir; Elad Verbin (SIAM J. Comput., 2008)

Line transversals of convex polyhedra in R3. - Haim Kaplan; Natan Rubin; Micha Sharir (SODA, 2009)

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. - Haim Kaplan; Natan Rubin; Micha Sharir (Algorithmica, 2009)

Kinetic stable Delaunay graphs. - Pankaj K. Agarwal; Jie Gao 001; Leonidas J. Guibas; Haim Kaplan; Vladlen Koltun; Natan Rubin; Micha Sharir (SCG, 2010)

Line Transversals of Convex Polyhedra in R3. - Haim Kaplan; Natan Rubin; Micha Sharir (SIAM J. Comput., 2010)

A kinetic triangulation scheme for moving points in the plane. - Haim Kaplan; Natan Rubin; Micha Sharir (Comput. Geom., 2011)

Lines in higher dimensions - Natan Rubin (2011)

Lines Avoiding Balls in Three Dimensions Revisited. - Natan Rubin (Discret. Comput. Geom., 2012)

Improved Bounds for Geometric Permutations. - Natan Rubin; Haim Kaplan; Micha Sharir (SIAM J. Comput., 2012)

On Topological Changes in the Delaunay Triangulation of Moving Points. - Natan Rubin (Discret. Comput. Geom., 2013)

Stable Delaunay Graphs. - Pankaj K. Agarwal; Jie Gao 001; Leonidas J. Guibas; Haim Kaplan; Natan Rubin; Micha Sharir (Discret. Comput. Geom., 2015)

Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. - Pankaj K. Agarwal; Haim Kaplan; Natan Rubin; Micha Sharir (Discret. Comput. Geom., 2015)

On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. - Natan Rubin (J. ACM, 2015)

Beyond the Richter-Thomassen Conjecture. - János Pach; Natan Rubin; Gábor Tardos (SODA, 2016)

On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. - János Pach; Natan Rubin; Gábor Tardos (Comb. Probab. Comput., 2016)

Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. - Pankaj K. Agarwal; Natan Rubin; Micha Sharir (ESA, 2017)

A Crossing Lemma for Jordan Curves. - János Pach; Natan Rubin; Gábor Tardos (CoRR, 2017)

Planar point sets determine many pairwise crossing segments. - János Pach; Natan Rubin; Gábor Tardos (STOC, 2019)

Further Consequences of the Colorful Helly Hypothesis. - Leonardo Martínez-Sandoval; Edgardo Roldán-Pensado; Natan Rubin (Discret. Comput. Geom., 2020)

Stronger bounds for weak epsilon-nets in higher dimensions. - Natan Rubin (STOC, 2021)

An Improved Bound for Weak Epsilon-nets in the Plane. - Natan Rubin (J. ACM, 2022)

Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. - Natan Rubin (SODA, 2024)

An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. - Natan Rubin (SODA, 2025)