default search action
Natan Rubin
Person information
- affiliation: Ben-Gurion University of The Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Natan Rubin:
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. SODA 2024: 4464-4501 - [i17]Natan Rubin:
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. CoRR abs/2403.00412 (2024) - [i16]Natan Rubin:
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. CoRR abs/2407.15518 (2024) - 2022
- [j13]Natan Rubin
:
An Improved Bound for Weak Epsilon-nets in the Plane. J. ACM 69(5): 32:1-32:35 (2022) - 2021
- [c16]Natan Rubin
Stronger bounds for weak epsilon-nets in higher dimensions. STOC 2021: 989-1002 - [i15]Natan Rubin:
Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions. CoRR abs/2104.12654 (2021) - 2020
- [j12]Leonardo Martínez-Sandoval
Further Consequences of the Colorful Helly Hypothesis. Discret. Comput. Geom. 63(4): 848-866 (2020)
2010 – 2019
- 2019
- [c15]János Pach, Natan Rubin
Planar point sets determine many pairwise crossing segments. STOC 2019: 1158-1166 - [i14]János Pach, Natan Rubin, Gábor Tardos:
Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR abs/1904.08845 (2019) - 2018
- [c14]Leonardo Martínez-Sandoval
Further Consequences of the Colorful Helly Hypothesis. SoCG 2018: 59:1-59:14 - [c13]Natan Rubin
An Improved Bound for Weak Epsilon-Nets in the Plane. FOCS 2018: 224-235 - [i13]Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin:
Further Consequences of the Colorful Helly Hypothesis. CoRR abs/1803.06229 (2018) - [i12]Natan Rubin:
An Improved Bound for Weak Epsilon-Nets in the Plane. CoRR abs/1808.02686 (2018) - 2017
- [c12]Pankaj K. Agarwal, Natan Rubin
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA 2017: 4:1-4:13 - [i11]János Pach, Natan Rubin, Gábor Tardos:
A Crossing Lemma for Jordan Curves. CoRR abs/1708.02077 (2017) - 2016
- [j11]János Pach, Natan Rubin
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. 25(6): 941-958 (2016) - [c11]János Pach, Natan Rubin, Gábor Tardos:
Beyond the Richter-Thomassen Conjecture. SODA 2016: 957-968 - 2015
- [j10]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. 54(4): 871-904 (2015) - [j9]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin
Stable Delaunay Graphs. Discret. Comput. Geom. 54(4): 905-929 (2015) - [j8]Natan Rubin
On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. J. ACM 62(3): 25:1-25:85 (2015) - [c10]János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA 2015: 1506-1516 - [i10]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. CoRR abs/1504.06851 (2015) - [i9]János Pach, Natan Rubin, Gábor Tardos:
Beyond the Richter-Thomassen Conjecture. CoRR abs/1504.08250 (2015) - 2014
- [i8]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR abs/1404.4851 (2014) - [i7]János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR abs/1412.6676 (2014) - 2013
- [j7]Natan Rubin
On Topological Changes in the Delaunay Triangulation of Moving Points. Discret. Comput. Geom. 49(4): 710-746 (2013) - [c9]Natan Rubin
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. FOCS 2013: 519-528 - [i6]Natan Rubin:
On topological changes in the Delaunay triangulation of moving points. CoRR abs/1304.3671 (2013) - [i5]Natan Rubin:
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. CoRR abs/1312.2194 (2013) - 2012
- [j6]Natan Rubin
Lines Avoiding Balls in Three Dimensions Revisited. Discret. Comput. Geom. 48(1): 65-93 (2012) - [j5]Natan Rubin
Improved Bounds for Geometric Permutations. SIAM J. Comput. 41(2): 367-390 (2012) - [c8]Natan Rubin
On topological changes in the delaunay triangulation of moving points. SCG 2012: 1-10 - 2011
- [b1]Natan Rubin:
Lines in higher dimensions. Tel Aviv University, Israel, 2011 - [j4]Haim Kaplan, Natan Rubin
A kinetic triangulation scheme for moving points in the plane. Comput. Geom. 44(4): 191-205 (2011) - [i4]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir:
Kinetic Stable Delaunay Graphs. CoRR abs/1104.0622 (2011) - 2010
- [j3]Haim Kaplan, Natan Rubin
Line Transversals of Convex Polyhedra in R3. SIAM J. Comput. 39(7): 3283-3310 (2010) - [c7]Natan Rubin
Lines avoiding balls in three dimensions revisited. SCG 2010: 58-67 - [c6]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin
Kinetic stable Delaunay graphs. SCG 2010: 127-136 - [c5]Haim Kaplan, Natan Rubin
A kinetic triangulation scheme for moving points in the plane. SCG 2010: 137-146 - [c4]Natan Rubin
Improved Bounds for Geometric Permutations. FOCS 2010: 355-364 - [i3]Haim Kaplan, Natan Rubin, Micha Sharir:
A Kinetic Triangulation Scheme for Moving Points in The Plane. CoRR abs/1005.0912 (2010) - [i2]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. CoRR abs/1007.3244 (2010)
2000 – 2009
- 2009
- [j2]Haim Kaplan, Natan Rubin
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55(2): 283-310 (2009) - [c3]Haim Kaplan, Natan Rubin, Micha Sharir:
Line transversals of convex polyhedra in R3. SODA 2009: 170-179 - 2008
- [j1]Haim Kaplan, Natan Rubin
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) - [i1]Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. CoRR abs/0807.1221 (2008) - 2007
- [c2]Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298 - [c1]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Counting colors in boxes. SODA 2007: 785-794
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: