S. Smorodinsky, J.S.B. Mitchell, M. Sharir,
Sharp Bounds on Geometric Permutations for Pairwise Disjoint Balls in R^d,
In Proc. of the 15th ACM Symposium on Computational Geometry (SoCG) , pp. 400--406, 1999.
Presentation

M. Sharir, S. Smorodinsky, G. Tardos,
An Improved Bound for k-Sets in Three Dimensions
In Proc. of the 16th ACM Symposium on Computational Geometry (SoCG) , pp. 43--49, 2000 .

M. Sharir, S. Smorodinsky
Extremal Configurations and Le vels in Pseudoline Arrangements, In Proc.of WADS 2003.
Presentation

M. Sharir, S. Smorodinsky
On Neighbors in Geometric Permutations,
In Proc. of the Eighth Scandinavian Workshop on Algorithms Theory, pp.~131--139, SWAT 2002.
Presentation

E. Nevo, J. Pach, R. Picnchasi, M. Sharir, S. Smorodinsky
Lenses in Arrangements of Pseudo-circles and their Applications,
In Proc. of the 18th ACM Symposium on Computational Geometry June 5-7, ( SoCG 2002), Barcelona Spain.

G. Even, Z. Lotker, D. Ron, S. Smorodinsky,
Conflict-Free Colorings of Sim ple Geometric Regions With Applications to Frequency Assignment in Cellular Networks,
In proc. 43rd Annual IEEE Symposium on Foundations of Computer Science ( FOCS )pp. 691-700, 2002.

S. Har-Peled, S. Smorodinsky,
Conflict-Free Coloring of Points and Simple Regions in the Plane,
In Proc. of the 19th ACM Symposium on Computational Geometry (SoCG) , pp. 114--123, 2003.

R. Pinchasi, S. Smorodinsky, On Locally Delaunay Geometric Graphs,
In Proc. of the 20th ACM Symposium on Computational Geometry (SoCG 2004), pp. 378--382, june 9-11. Polytechnic University in Brooklyn, New York, U.S.A. Presentation

A. Fiat, M, Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, E. Welzl,
Online Conflict-Free Coloring for Intervals,
In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005).
Presentation

B. Aronov, S. Smorodinsky,
On Geometric Permutations Induced by Lines Transversal through a Fixed Point,
In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005).
Presentation

A. Bar-Noy, P. Cheilaris, S. Smorodinsky,
Conflict-Free Coloring for Intervals: from Offline to Online,
In Proc. of the 18th ACM Symposium on Parallelism in Algorithms and Architectures, ( SPAA 2006)

N. Alon, S. Smorodinsky,
Conflict-Free Colorings of Shallow Discs,
In Proc. of the 22nd ACM Symposium on Computational Geometry, ( SoCG 2006)
Presentation

B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara, S. Smorodinsky
Small Weak Epsilon Nets,
In proc of 17th Canadian Conference on Computational Geometry ( CCCG ), August 10-12, 2005 University of Windsor. 2005.

S. Smorodinsky,
On The Chromatic Number of Some Geometric Hypergraphs,
In Proc. of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006).
Presentation

A. Bar-Noy, P. Cheilaris, S. Olonetsky and S. Smorodinsky,
Online conflict-free colorings for hypergraphs,
In Proc. of the 34th International Colloquium on Automata, Languages and Programming , ( ICALP 2007).

N. Alon, H. Kaplan, G. Nivasch, M. Sharir and S. Smorodinsky,
Weak epsilon-nets and interval chains,
In Proc. of 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008).

G. Aloupis, J. Cardinal, S. Collette, S. Langerman and S. Smorodinsky,
Coloring Geometric Range Spaces,
In Proc. of 8th Latin American Theoretical Informatics, (LATIN), Lecture Notes in Computer Science, Springer Volume 4957, 2008.

S. Smorodinsky, M. Sulovsky and U. Wagner
On lower center regions and balls containing many points,
In Proc. of 14th Annual International Computing and Combinatorics Conference , (COCOON 2008).

G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky, P. Taslakian
Colorful Strips,
In Proc. of 9th Latin American Theoretical Informatics, (LATIN 2010),

S. Smorodinsky and Y. Yuditsky
Polychromatic coloring for half-planes,
In Proc. 12'th Scandinavian Symposium and Workshops on Algorithm Theory , (SWAT 2010).

E. Horev, R. Krakovski and S. Smorodinsky,
Conflict-Free Coloring Made Stronger,
In Proc. 12'th Scandinavian Symposium and Workshops on Algorithm Theory , (SWAT 2010).

P. Cheilaris, S. Smorodinsky and M. Sulovsky,
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs,
In Proc. of the 27th ACM Symposium on Computational Geometry (SoCG 2011).

G. Even and S. Smorodinsky,
Hitting Sets Online and Vertex Ranking,
In Proc. of the 19th Annual European Symposium on Algorithms (ESA 2011).


  • A. Rok and S. Smorodinsky
    Weak 1/r -nets for moving points,
    In Proc. of the 32nd international Symposium on Computational Geometry (SoCG 2016)


  • 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,
    In Proc. of the 24th Annual European Symposium on Algorithms (ESA 2016).

  • C. Keller, S. Smorodinsky and G. Tardos
    On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers,
    In Proc. of Symposium on Discrete Algorithms ( SODA 2017, to appear.)


  • P. Carmi and M.K. Chiu and M.J. Katz and M. Korman and Y. Okamoto and A. van Renssen and M. Roelo zen and T. Shiitada and S. Smorodinsky
    Balanced Line Separators of Unit Disk Graphs,
    In Proc. of the Algorithms and Data Structures Symposium (2017).