Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks G Even, Z Lotker, D Ron, S Smorodinsky SIAM Journal on Computing 33 (1), 94-136, 2003 | 264 | 2003 |
On conflict-free coloring of points and simple regions in the plane S Har-Peled, S Smorodinsky Proceedings of the nineteenth annual symposium on Computational geometry …, 2003 | 125 | 2003 |
Lenses in arrangements of pseudo-circles and their applications PK Agarwal, E Nevo, J Pach, R Pinchasi, M Sharir, S Smorodinsky Journal of the ACM (JACM) 51 (2), 139-186, 2004 | 122 | 2004 |
Conflict-free coloring and its applications S Smorodinsky Geometry—Intuitive, Discrete, and Convex: A Tribute to László Fejes Tóth …, 2013 | 110 | 2013 |
An improved bound for k-sets in three dimensions M Sharir, S Smorodinsky, G Tardos Proceedings of the sixteenth annual symposium on Computational geometry, 43-49, 2000 | 102 | 2000 |
On the chromatic number of geometric hypergraphs S Smorodinsky SIAM Journal on Discrete Mathematics 21 (3), 676-687, 2007 | 99 | 2007 |
Online conflict-free coloring for intervals K Chen, A Fiat, H Kaplan, M Levy, J Matoušek, E Mossel, J Pach, M Sharir, ... SIAM Journal on Computing 36 (5), 1342-1359, 2007 | 97 | 2007 |
Combinatorial problems in computational geometry S Smorodinsky Tel-Aviv University, 2003 | 76 | 2003 |
Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ... Computational Geometry 42 (6-7), 617-626, 2009 | 67 | 2009 |
Conflict-free colorings of shallow discs N Alon, S Smorodinsky Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 53 | 2006 |
Sharp bounds on geometric permutations of pairwise disjoint balls in Rd S Smorodinsky, JSB Mitchell, M Sharir Proceedings of the fifteenth annual symposium on Computational geometry, 400-406, 1999 | 44 | 1999 |
Online conflict-free colouring for hypergraphs A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky Combinatorics, Probability and Computing 19 (4), 493-516, 2010 | 36 | 2010 |
Weak ε-nets and interval chains N Alon, H Kaplan, G Nivasch, M Sharir, S Smorodinsky Journal of the ACM (JACM) 55 (6), 1-32, 2008 | 35 | 2008 |
Conflict-free coloring for intervals: from offline to online A Bar-Noy, P Cheilaris, S Smorodinsky Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006 | 34 | 2006 |
Deterministic conflict-free coloring for intervals: from offline to online A Bar-Noy, P Cheilaris, S Smorodinsky ACM Transactions on Algorithms (TALG) 4 (4), 1-18, 2008 | 33 | 2008 |
Conflict-free coloring made stronger E Horev, R Krakovski, S Smorodinsky Algorithm Theory-SWAT 2010: 12th Scandinavian Symposium and Workshops on …, 2010 | 28 | 2010 |
Conflict-free coloring of intersection graphs of geometric objects C Keller, S Smorodinsky Discrete & Computational Geometry 64 (3), 916-941, 2020 | 26 | 2020 |
Strong conflict-free coloring for intervals P Cheilaris, L Gargano, AA Rescigno, S Smorodinsky Algorithmica 70 (4), 732-749, 2014 | 26 | 2014 |
Small weak epsilon-nets B Aronov, F Aurenhammer, F Hurtado, S Langerman, D Rappaport, ... Computational Geometry 42 (5), 455-462, 2009 | 24 | 2009 |
Coloring geometric range spaces G Aloupis, J Cardinal, S Collette, S Langerman, S Smorodinsky Discrete & Computational Geometry 41, 348-362, 2009 | 21 | 2009 |