Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Natan Rubin
Observed names:
NATAN RUBIN,
Rubin, Natan
Institution:
Ben-Gurion University of the Negev
Observed institutions:
Ben-Gurion University of the Negev,
Tel Aviv University,
Courant Institute of Mathematical Sciences,
New York University,
Freie Universität Berlin
ORCID:
0000-0002-7463-6728
Observed ORCID:
0000-0002-7463-6728
OpenAlex ID:
A5014573012
Works
43
Awards
3
Efficient Colored Orthogonal Range Counting
2008
·
Haim Kaplan
, Natan Rubin
, et al.
·
SIAM Journal on Computing
·
57
Counting colors in boxes
2007
·
Haim Kaplan
, Natan Rubin
, et al.
·
Symposium on Discrete Algorithms
·
38
Planar point sets determine many pairwise crossing segments
2019
·
János Pach
, Natan Rubin
, et al.
·
Advances in Mathematics
·
32
Kinetic stable Delaunay graphs
2010
·
Pankaj K. Agarwal
, Jie Gao
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
30
An Improved Bound for Weak Epsilon-Nets in the Plane
2018
·
Natan Rubin
·
Annual Symposium on Foundations of Computer Science
·
19
Stronger bounds for weak epsilon-nets in higher dimensions
2021
·
Natan Rubin
·
ACM Symposium on Theory of Computing (STOC)
·
17
PDF
A kinetic triangulation scheme for moving points in the plane
2010
·
Haim Kaplan
, Natan Rubin
, et al.
·
Computational Geometry
·
16
PDF
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions
2015
·
Pankaj K. Agarwal
, Haim Kaplan
, et al.
·
Discrete & Computational Geometry
·
15
PDF
Further Consequences of the Colorful Helly Hypothesis
2019
·
Leonardo Martínez-Sandoval
, Edgardo Roldán-Pensado
, et al.
·
Discrete & Computational Geometry
·
14
PDF
An Improved Bound for Weak Epsilon-nets in the Plane
2022
·
Natan Rubin
·
Journal of the ACM
·
10
PDF
Beyond the Richter-Thomassen Conjecture
2015
·
János Pach
, Natan Rubin
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
10
Stable Delaunay Graphs
2015
·
Pankaj K. Agarwal
, Jie Gao
, et al.
·
Discrete & Computational Geometry
·
10
PDF
On Topological Changes in the Delaunay Triangulation of Moving Points
2013
·
Natan Rubin
·
Discrete & Computational Geometry
·
9
PDF
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
2008
·
Haim Kaplan
, Natan Rubin
, et al.
·
Algorithmica
·
9
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions
2013
·
Natan Rubin
·
Annual Symposium on Foundations of Computer Science
·
8
PDF
On topological changes in the delaunay triangulation of moving points
2012
·
Natan Rubin
·
Annual Symposium on Computational Geometry (SoCG)
·
8
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
2010
·
Haim Kaplan
, Natan Rubin
, et al.
·
SIAM Journal on Computing
·
8
PDF
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions
2024
·
Natan Rubin
·
Society for Industrial and Applied Mathematics eBooks
·
7
PDF
A Crossing Lemma for Jordan curves
2018
·
János Pach
, Natan Rubin
, et al.
·
Advances in Mathematics
·
7
Beyond the Richter-Thomassen conjecture
2016
·
Pach, János
, Rubin, Natan
, et al.
·
Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)
·
7
On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions
2015
·
Natan Rubin
·
Journal of the ACM
·
7
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats
2017
·
Agarwal, Pankaj K.
, Rubin, Natan
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
2025
·
Natan Rubin
·
Society for Industrial and Applied Mathematics eBooks
·
5
PDF
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
2016
·
JÁNOS PACH
, NATAN RUBIN
, et al.
·
Combinatorics Probability Computing
·
5
PDF
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves
2014
·
János Pach
, Natan Rubin
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
4
Show more works
View as search
Works count:
43
Citation count:
379
H-index:
10
I10-index:
12
Year
Topic
Type