Natan Rubin

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Improved bounds for point selections and halving hyperplanes in higher dimensions	2024-11-28	Paper
Stronger bounds for weak epsilon-nets in higher dimensions	2023-11-14	Paper
An Improved Bound for Weak Epsilon-nets in the Plane	2023-04-27	Paper
Planar point sets determine many pairwise crossing segments	2021-07-05	Paper
Further Consequences of the Colorful Helly Hypothesis	2020-08-18	Paper
Further consequences of the colorful Helly hypothesis	2020-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q5111687	2020-05-27	Paper
Planar point sets determine many pairwise crossing segments	2020-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4633823	2019-05-06	Paper
An Improved Bound for Weak Epsilon-Nets in the Plane	2018-08-08	Paper
Beyond the Richter-Thomassen Conjecture	2018-07-16	Paper
A crossing lemma for Jordan curves	2018-06-26	Paper
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves	2017-10-10	Paper
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves	2017-10-05	Paper
On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions	2016-03-24	Paper
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions	2016-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q2934665	2014-12-18	Paper
On topological changes in the Delaunay triangulation of moving points	2014-08-07	Paper
Lines avoiding balls in three dimensions revisited	2014-04-03	Paper
A kinetic triangulation scheme for moving points in the plane	2014-04-03	Paper
On topological changes in the Delaunay triangulation of moving points	2013-08-05	Paper
Lines avoiding balls in three dimensions revisited	2012-08-13	Paper
Improved bounds for geometric permutations	2012-08-10	Paper
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$	2011-04-04	Paper
A kinetic triangulation scheme for moving points in the plane	2011-03-25	Paper
Linear data structures for fast ray-shooting amidst convex polyhedra	2009-08-27	Paper
Efficient Colored Orthogonal Range Counting	2009-06-22	Paper
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra	2008-09-25	Paper
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions	N/A	Paper

Research outcomes over time

This page was built for person: Natan Rubin