Skip to main navigation Skip to search Skip to main content
20072026

Research activity per year

Fingerprint

Dive into the research topics where Natan Rubin is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles
  • Helly-Type Theorems for Splitting Point Sets

    Portal, L. & Rubin, N., 1 Jan 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 2888-2902 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions

    Rubin, N., 1 Jan 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 4875-4893 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions

    Rubin, N., 1 Jan 2024, p. 4464-4501. 38 p.

    Research output: Contribution to conference › Paper › peer-review

    3 Scopus citations
  • An Improved Bound for Weak Epsilon-nets in the Plane

    Rubin, N., 27 Oct 2022, In: Journal of the ACM. 69, 5, ART32.

    Research output: Contribution to journal › Article › peer-review

    1 Scopus citations
  • Planar point sets determine many pairwise crossing segments

    Pach, J., Rubin, N. & Tardos, G., 6 Aug 2021, In: Advances in Mathematics. 386, 107779.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    19 Scopus citations
  • Stronger bounds for weak epsilon-nets in higher dimensions

    Rubin, N., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 989-1002 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    6 Scopus citations
  • Further Consequences of the Colorful Helly Hypothesis

    Martínez-Sandoval, L., Roldán-Pensado, E. & Rubin, N., 1 Jun 2020, In: Discrete and Computational Geometry. 63, 4, p. 848-866 19 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    7 Scopus citations
  • Planar point sets determine many pairwise crossing segments

    Pach, J., Rubin, N. & Tardos, G., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 1158-1166 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    10 Scopus citations
  • A Crossing Lemma for Jordan curves

    Pach, J., Rubin, N. & Tardos, G., 20 Jun 2018, In: Advances in Mathematics. 331, p. 908-940 33 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    5 Scopus citations
  • An improved bound for weak epsilon-nets in the plane

    Rubin, N., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). Institute of Electrical and Electronics Engineers, p. 224-235 12 p. 8555108. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    17 Scopus citations