Natan Rubin

View Scopus Profile

Natan Rubin

 https://orcid.org/0000-0002-7463-6728
20072024

Research activity per year

Filter
Conference contribution

Search results

  • 2021

    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
    5 Scopus citations
  • 2019

    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
    7 Scopus citations
  • 2018

    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

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

    Open Access
    17 Scopus citations

  • Further consequences of the colorful helly hypothesis

    Martínez-Sandoval, L., Roldán-Pensado, E. & Rubin, N., 1 Jun 2018, 34th International Symposium on Computational Geometry, SoCG 2018. Toth, C. D. & Speckmann, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 591-5914 5324 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 99).

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

    2 Scopus citations
  • 2017

    Approximate nearest neighbor search amid higher-dimensional flats

    Agarwal, P. K., Rubin, N. & Sharir, M., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

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

    3 Scopus citations
  • 2016

    Beyond the Richter-Thomassen conjecture

    Pach, J., Rubin, N. & Tardos, G., 1 Jan 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 957-968 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

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

    Open Access
    6 Scopus citations
  • 2015

    On the Richter-Thomassen conjecture about pairwise intersecting closed curves

    Pach, J., Rubin, N. & Tardos, G., 1 Jan 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. Association for Computing Machinery, Vol. 2015-January. p. 1506-1516 11 p.

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

    Open Access
    6 Scopus citations
  • 2013

    On kinetic delaunay triangulations: A near quadratic bound for unit speed motions

    Rubin, N., 1 Dec 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 519-528 10 p. 6686188

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

    Open Access
    5 Scopus citations
  • 2012

    On topological changes in the Delaunay triangulation of moving points

    Rubin, N., 23 Jul 2012, Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. p. 1-10 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    7 Scopus citations
  • 2010

    A kinetic triangulation scheme for moving points in the plane

    Kaplan, H., Rubin, N. & Sharir, M., 30 Jul 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 137-146 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    1 Scopus citations

  • Improved bounds for geometric permutations

    Rubin, N., Kaplan, H. & Sharir, M., 1 Jan 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. Institute of Electrical and Electronics Engineers, p. 355-364 10 p. 5671203. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    Open Access
    1 Scopus citations

  • Kinetic stable Delaunay graphs

    Agarwal, P. K., Gao, J., Guibas, L. J., Kaplan, H., Koltun, V., Rubin, N. & Sharir, M., 30 Jul 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 127-136 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    Open Access
    19 Scopus citations

  • Lines avoiding balls in three dimensions revisited

    Rubin, N., 30 Jul 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 58-67 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

    2 Scopus citations
  • 2009

    Line transversals of convex polyhedra in ℝ3

    Kaplan, H., Rubin, N. & Sharir, M., 1 Jan 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 170-179 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    5 Scopus citations
  • 2007

    Counting colors in boxes

    Kaplan, H., Rubin, N., Sharir, M. & Verbin, E., 1 Jan 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 785-794 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

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

    26 Scopus citations

  • Linear data structures for fast ray-shooting amidst convex polyhedra

    Kaplan, H., Rubin, N. & Sharir, M., 1 Jan 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 287-298 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

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

    Open Access
    1 Scopus citations