| 2026 | SODA | Helly-Type Theorems for Splitting Point Sets. | Lidor Portal, Natan Rubin |
| 2026 | SODA | On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions. | Natan Rubin |
| 2025 | SODA | An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. | Natan Rubin |
| 2024 | SODA | Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. | Natan Rubin |
| 2021 | STOC | Stronger bounds for weak epsilon-nets in higher dimensions. | Natan Rubin |
| 2019 | STOC | Planar point sets determine many pairwise crossing segments. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2018 | FOCS | An Improved Bound for Weak Epsilon-Nets in the Plane. | Natan Rubin |
| 2017 | ESA | Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. | Pankaj K. Agarwal, Natan Rubin, Micha Sharir |
| 2016 | SODA | Beyond the Richter-Thomassen Conjecture. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2015 | SODA | On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. | Jnos Pach, Natan Rubin, Gbor Tardos |
| 2013 | FOCS | On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. | Natan Rubin |
| 2010 | FOCS | Improved Bounds for Geometric Permutations. | Natan Rubin, Haim Kaplan, Micha Sharir |
| 2009 | SODA | Line transversals of convex polyhedra in | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2007 | ESA | Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2007 | SODA | Counting colors in boxes. | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |