Shakhar Smorodinsky
Titolo
Citata da
Citata da
Anno
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
2202003
Conflict-free coloring of points and simple regions in the plane
S Har-Peled, S Smorodinsky
Discrete & Computational Geometry 34 (1), 47-70, 2005
1192005
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
962004
On the chromatic number of geometric hypergraphs
S Smorodinsky
SIAM Journal on Discrete Mathematics 21 (3), 676-687, 2007
882007
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
822000
Conflict-free coloring and its applications
S Smorodinsky
Geometry—Intuitive, Discrete, and Convex, 331-389, 2013
722013
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
692007
Combinatorial problems in computational geometry
S Smorodinsky
Tel-Aviv University, 2003
652003
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
552009
Conflict-free colorings of shallow discs
N Alon, S Smorodinsky
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
502006
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in R d
S Smorodinsky, JSB Mitchell, M Sharir
Discrete & Computational Geometry 23 (2), 247-259, 2000
382000
Online conflict-free colouring for hypergraphs
A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky
Combinatorics, Probability & Computing 19 (4), 493, 2010
362010
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
332006
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
322008
Online conflict-free coloring for intervals
A Fiat, J Matoušek, E Mossel, J Pach, M Sharir, S Smorodinsky, U Wagner, ...
SIAM Journal on Computing 36 (ARTICLE), 1342-1359, 2006
322006
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
292008
Coloring geometric range spaces
G Aloupis, J Cardinal, S Collette, S Langerman, S Smorodinsky
Discrete & Computational Geometry 41 (2), 348-362, 2009
222009
Conflict-free coloring made stronger
E Horev, R Krakovski, S Smorodinsky
Scandinavian Workshop on Algorithm Theory, 105-117, 2010
212010
Strong conflict-free coloring for intervals
P Cheilaris, L Gargano, AA Rescigno, S Smorodinsky
Algorithmica 70 (4), 732-749, 2014
202014
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
C Keller, S Smorodinsky, G Tardos
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
172017
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20