• M. Sharir, S. Smorodinsky, G. Tardos,
    An Improved Bound for k-Sets in Three Dimensions Discrete & Comput. Geom (DCG) 26:195-204 (2001).

  • M. Sharir, S. Smorodinsky
    On Neighbors in Geometric Permutations, Discrete Mathematics 268:327-335 (2003).

  • P.K. Agarwal, E. Nevo, J. Pach, R. Picnchasi, M. Sharir, S. Smorodinsky
    Lenses in Arrangements of Pseudo-circles and their Applications,
    JACM 51(2): 139-186 (2004).

  • S. Smorodinsky, M. Sharir,
    Selecting Points that are Heavily Covered by Pseudo-circles, Spheres or Rectangles,
    Combinatorics, Probability & Computing, 13 (2004), 389--411.

  • G. Even, Z. Lotker, D. Ron, S. Smorodinsky,
    Conflict-Free Colorings of Simple Geometric Regions With Applications to Frequency Assignment in Cellular Networks,
    SIAM J. Comput. (SICOMP) 33(1): 94-136 (2003).

  • S. Har-Peled, S. Smorodinsky,
    Conflict-Free Coloring of Points and Simple Regions in the Plane,
    Discrete & Comput. Geom (DCG), 34: 47-70 (2005).

  • K. Chen, A. Fiat, H. Kaplan, M, Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, E. Welzl,
    Online Conflict-Free Coloring for Intervals,
    SIAM J. Comput. (SICOMP), 36: 1342--1359 (2006).

  • B. Aronov, S. Smorodinsky,
    On Geometric Permutations Induced by Lines Transversal through a Fixed Point,
    Discrete & Comput. Geom ( DCG), 34(2):285--294 (2005).

  • J. Matousek, M. Sharir, S. Smorodinsky, U. Wagner,
    On K-Sets in Four dimensions,
    Discrete & Comput. Geom ( DCG), 35(2):177--191 (2006).

  • R. Dhandapani, J.E. Goodman, A. Holmsen, R. Pollack, S. Smorodinsky,
    Convexity in Topological Affine Planes,
    Discrete & Comput. Geom (DCG), 38:243--257 (2007).

  • S. Smorodinsky,
    On The Chromatic Number of Some Geometric Hypergraphs,
    Siam Journal on Discrete Mathematics (SIDMA), 21(3) 676--687 (2007).

  • N. Alon, S. Smorodinsky,
    Conflict-Free Colorings of Shallow Discs,
    International Journal of Computational Geometry and Applications
    (IJCGA), to appear (2008)
    Special issue devoted to the 22nd ACM Symposium on Computational Geometry, ( SoCG ).

  • B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara, S. Smorodinsky
    Small Weak Epsilon Nets,
    Computational Geometry: Theory and Applications ( CGTA ),42:455-462, 2009.
    Special issue devoted to 17th Canadian Conference on Computational Geometry ( CCCG ).

  • N. Alon, H. Kaplan, G. Nivasch, M. Sharir and S. Smorodinsky,
    Weak epsilon-nets and interval chains,
    J. ACM, 55(6): (2008).

  • A. Bar-Noy, P. Cheilaris and S. Smorodinsky,
    Deterministic Conflict-Free Coloring for Intervals: from Offline to Online,
    ACM Transactions on Algorithms, 4(4) 44:1--18, (2008).

  • S. Smorodinsky,
    A note on the online first-fit algorithm for coloring $k$-inductive graphs,
    Information Processing Letters (IPL), 109 44--45, (2008).

  • G. Aloupis, J. Cardinal, S. Collette, S. Langerman and S. Smorodinsky,
    Coloring Geometric Range Spaces,
    Discrete & Comput. Geom (DCG), 41(2): 348-362 (2009)

  • A. Bar-Noy, P. Cheilaris, S. Olonetsky and S. Smorodinsky,
    Online conflict-free colorings for hypergraphs,
    Combinatorics, Probability & Computing (CPC), 19:493-516 (2010)

  • G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky, P. Taslakian
    Colorful Strips,
    Graphs and Combinatorics, 27(3) 327-339 (2011).

  • S. Smorodinsky and Y. Yuditsky
    Polychromatic coloring for half-planes,
    Journal of Combinatorial Theory series A, 119(1): 146-154 (2012).

  • M. Farber, S. Ray and S. Smorodinsky
    On totally positive matrices and geometric incidences,
    Journal of Combinatorial Theory series A, 128: 149-161 (2014).

  • G. Even and S. Smorodinsky
    Hitting sets online and unique-max coloring,
    Discrete Applied Mathematics, 178: 71-82 (2014).

  • P. Cheilaris, L. Gargano, A. Rescigno and S. Smorodinsky
    Strong Conflict-Free Coloring for Intervals,
    Algorithmica, (DOI)10.1007/s00453-014-9929-x (2014).

  • I. Karpas, O. Neiman and S. Smorodinsky
    On vertex rankings of graphs and its relatives, Discrete Mathematics 338:1460-1467 (2015).

  • M. Sharir, S. Smorodinsky, C. Valculescu and F. de Zeeuw
    Distinct distances between points and lines, manuscript (2015).

  • J.L. De Carufel, M.J. Katz, M. Korman, A. van Renssen, M. Roeloffzen and S. Smorodinsky
    On Interference Among Moving Sensors and related Problems, Journal of Computational Geometry, accepted. .

  • A. Rok and S. Smorodinsky
    A short proof of the First Selection Lemma and weak 1/r -nets for moving points, manuscript .

  • C. Keller, S. Smorodinsky and G. Tardos
    Improved bounds on the Hadwiger-Debrunner numbers, Israel Journal of Mathematics, accepted.