Natan Rubin - RankMe

52 papers A* 14A 2Journal 31Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Helly-Type Theorems for Splitting Point Sets. SODA Lidor Portal, Natan Rubin
2026	A*	`conf`	On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions. SODA Natan Rubin
2026	J	`jnl`	On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions. CoRR Natan Rubin
2025	A*	`conf`	An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. SODA Natan Rubin
2024	J	`jnl`	An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. CoRR Natan Rubin
2024	A*	`conf`	Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. SODA Natan Rubin
2024	J	`jnl`	Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. CoRR Natan Rubin
2022	J	`jnl`	An Improved Bound for Weak Epsilon-nets in the Plane. J. ACM Natan Rubin
2021	J	`jnl`	Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions. CoRR Natan Rubin
2021	A*	`conf`	Stronger bounds for weak epsilon-nets in higher dimensions. STOC Natan Rubin
2020	J	`jnl`	Further Consequences of the Colorful Helly Hypothesis. Discret. Comput. Geom. Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
2019	J	`jnl`	Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR János Pach, Natan Rubin, Gábor Tardos
2019	A*	`conf`	Planar point sets determine many pairwise crossing segments. STOC János Pach, Natan Rubin, Gábor Tardos
2018	A*	`conf`	An Improved Bound for Weak Epsilon-Nets in the Plane. FOCS Natan Rubin
2018	J	`jnl`	An Improved Bound for Weak Epsilon-Nets in the Plane. CoRR Natan Rubin
2018	A*	`conf`	Further Consequences of the Colorful Helly Hypothesis. SoCG Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
2018	J	`jnl`	Further Consequences of the Colorful Helly Hypothesis. CoRR Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
2017	J	`jnl`	A Crossing Lemma for Jordan Curves. CoRR János Pach, Natan Rubin, Gábor Tardos
2017	A	`conf`	Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA Pankaj K. Agarwal, Natan Rubin, Micha Sharir
2016	A*	`conf`	Beyond the Richter-Thomassen Conjecture. SODA János Pach, Natan Rubin, Gábor Tardos
2016	J	`jnl`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. János Pach, Natan Rubin, Gábor Tardos
2015	J	`jnl`	Beyond the Richter-Thomassen Conjecture. CoRR János Pach, Natan Rubin, Gábor Tardos
2015	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. J. ACM Natan Rubin
2015	A*	`conf`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA János Pach, Natan Rubin, Gábor Tardos
2015	J	`jnl`	Stable Delaunay Graphs. CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	Stable Delaunay Graphs. Discret. Comput. Geom. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2014	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2014	J	`jnl`	On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR János Pach, Natan Rubin, Gábor Tardos
2013	A*	`conf`	On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. FOCS Natan Rubin
2013	J	`jnl`	On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. CoRR Natan Rubin
2013	J	`jnl`	On Topological Changes in the Delaunay Triangulation of Moving Points. Discret. Comput. Geom. Natan Rubin
2013	J	`jnl`	On topological changes in the Delaunay triangulation of moving points CoRR Natan Rubin
2012	J	`jnl`	Improved Bounds for Geometric Permutations. SIAM J. Comput. Natan Rubin, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Lines Avoiding Balls in Three Dimensions Revisited. Discret. Comput. Geom. Natan Rubin
2012	—	`conf`	On topological changes in the delaunay triangulation of moving points. SCG Natan Rubin
2011	J	`jnl`	A kinetic triangulation scheme for moving points in the plane. Comput. Geom. Haim Kaplan, Natan Rubin, Micha Sharir
2011	J	`jnl`	Kinetic Stable Delaunay Graphs CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2011	—	`—`	Lines in higher dimensions Natan Rubin
2010	J	`jnl`	A Kinetic Triangulation Scheme for Moving Points in The Plane CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`conf`	A kinetic triangulation scheme for moving points in the plane. SCG Haim Kaplan, Natan Rubin, Micha Sharir
2010	J	`jnl`	Improved Bounds for Geometric Permutations CoRR Natan Rubin, Haim Kaplan, Micha Sharir
2010	A*	`conf`	Improved Bounds for Geometric Permutations. FOCS Natan Rubin, Haim Kaplan, Micha Sharir
2010	—	`conf`	Kinetic stable Delaunay graphs. SCG Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2010	J	`jnl`	Line Transversals of Convex Polyhedra in R SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`conf`	Lines avoiding balls in three dimensions revisited. SCG Natan Rubin
2009	A*	`conf`	Line transversals of convex polyhedra in SODA Haim Kaplan, Natan Rubin, Micha Sharir
2009	J	`jnl`	Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica Haim Kaplan, Natan Rubin, Micha Sharir
2008	J	`jnl`	Efficient Colored Orthogonal Range Counting. SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2008	J	`jnl`	Line Transversals of Convex Polyhedra in R CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2007	A*	`conf`	Counting colors in boxes. SODA Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2007	A	`conf`	Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA Haim Kaplan, Natan Rubin, Micha Sharir