2009 |
39 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
S. Imahori,
M. Korman,
Stefan Langerman,
O. Schwartz,
Shakhar Smorodinsky,
Perouz Taslakian:
Colorful Strips
CoRR abs/0904.2115: (2009) |
38 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
Shakhar Smorodinsky:
Coloring Geometric Range Spaces.
Discrete & Computational Geometry 41(2): 348-362 (2009) |
2008 |
37 | EE | Shakhar Smorodinsky,
Marek Sulovský,
Uli Wagner:
On Center Regions and Balls Containing Many Points.
COCOON 2008: 363-373 |
36 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
Shakhar Smorodinsky:
Coloring Geometric Range Spaces.
LATIN 2008: 146-157 |
35 | EE | Noga Alon,
Haim Kaplan,
Gabriel Nivasch,
Micha Sharir,
Shakhar Smorodinsky:
Weak ε-nets and interval chains.
SODA 2008: 1194-1203 |
34 | EE | Amotz Bar-Noy,
Panagiotis Cheilaris,
Shakhar Smorodinsky:
Deterministic conflict-free coloring for intervals: From offline to online.
ACM Transactions on Algorithms 4(4): (2008) |
33 | EE | Oswin Aichholzer,
Sergey Bereg,
Adrian Dumitrescu,
Alfredo García,
Clemens Huemer,
Ferran Hurtado,
Mikio Kano,
Alberto Márquez,
David Rappaport,
Shakhar Smorodinsky,
Diane L. Souvaine,
Jorge Urrutia,
David R. Wood:
Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics 31: 201-206 (2008) |
32 | EE | Shakhar Smorodinsky:
A note on the online First-Fit algorithm for coloring k.
Inf. Process. Lett. 109(1): 44-45 (2008) |
31 | EE | Noga Alon,
Shakhar Smorodinsky:
Conflict-Free colorings of Shallow Discs.
Int. J. Comput. Geometry Appl. 18(6): 599-604 (2008) |
30 | EE | Noga Alon,
Haim Kaplan,
Gabriel Nivasch,
Micha Sharir,
Shakhar Smorodinsky:
Weak &epsis;-nets and interval chains.
J. ACM 55(6): (2008) |
2007 |
29 | EE | Amotz Bar-Noy,
Panagiotis Cheilaris,
Svetlana Olonetsky,
Shakhar Smorodinsky:
Online Conflict-Free Colorings for Hypergraphs.
ICALP 2007: 219-230 |
28 | EE | Amotz Bar-Noy,
Panagiotis Cheilaris,
Svetlana Olonetsky,
Shakhar Smorodinsky:
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.
SPAA 2007: 194-195 |
27 | EE | Raghavan Dhandapani,
Jacob E. Goodman,
Andreas Holmsen,
Richard Pollack,
Shakhar Smorodinsky:
Convexity in Topological Affine Planes.
Discrete & Computational Geometry 38(2): 243-257 (2007) |
26 | EE | Ke Chen,
Amos Fiat,
Haim Kaplan,
Meital Levy,
Jirí Matousek,
Elchanan Mossel,
János Pach,
Micha Sharir,
Shakhar Smorodinsky,
Uli Wagner,
Emo Welzl:
Online Conflict-Free Coloring for Intervals.
SIAM J. Comput. 36(5): 1342-1359 (2007) |
25 | EE | Shakhar Smorodinsky:
On The Chromatic Number of Geometric Hypergraphs.
SIAM J. Discrete Math. 21(3): 676-687 (2007) |
2006 |
24 | EE | Shakhar Smorodinsky:
On the chromatic number of some geometric hypergraphs.
SODA 2006: 316-323 |
23 | EE | Amotz Bar-Noy,
Panagiotis Cheilaris,
Shakhar Smorodinsky:
Conflict-free coloring for intervals: from offline to online.
SPAA 2006: 128-137 |
22 | EE | Noga Alon,
Shakhar Smorodinsky:
Conflict-free colorings of shallow discs.
Symposium on Computational Geometry 2006: 41-43 |
21 | EE | Jirí Matousek,
Micha Sharir,
Shakhar Smorodinsky,
Uli Wagner:
k-Sets in Four Dimensions.
Discrete & Computational Geometry 35(2): 177-191 (2006) |
2005 |
20 | EE | Boris Aronov,
Franz Aurenhammer,
Ferran Hurtado,
Stefan Langerman,
David Rappaport,
Shakhar Smorodinsky,
Carlos Seara:
Small weak epsilon nets.
CCCG 2005: 52-56 |
19 | EE | Boris Aronov,
Shakhar Smorodinsky:
On geometric permutations induced by lines transversal through a fixed point.
SODA 2005: 251-256 |
18 | EE | Amos Fiat,
Meital Levy,
Jirí Matousek,
Elchanan Mossel,
János Pach,
Micha Sharir,
Shakhar Smorodinsky,
Uli Wagner,
Emo Welzl:
Online conflict-free coloring for intervals.
SODA 2005: 545-554 |
17 | EE | Sariel Har-Peled,
Shakhar Smorodinsky:
Conflict-Free Coloring of Points and Simple Regions in the Plane.
Discrete & Computational Geometry 34(1): 47-70 (2005) |
16 | EE | Boris Aronov,
Shakhar Smorodinsky:
Geometric Permutations Induced by Line Transversals through a Fixed Point.
Discrete & Computational Geometry 34(2): 285-294 (2005) |
2004 |
15 | EE | Rom Pinchasi,
Shakhar Smorodinsky:
On locally Delaunay geometric graphs.
Symposium on Computational Geometry 2004: 378-382 |
14 | | Shakhar Smorodinsky,
Micha Sharir:
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles.
Combinatorics, Probability & Computing 13(3): 389-411 (2004) |
13 | EE | Pankaj K. Agarwal,
Eran Nevo,
János Pach,
Rom Pinchasi,
Micha Sharir,
Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications.
J. ACM 51(2): 139-186 (2004) |
2003 |
12 | EE | Sariel Har-Peled,
Shakhar Smorodinsky:
On conflict-free coloring of points and simple regions in the plane.
Symposium on Computational Geometry 2003: 114-123 |
11 | EE | Micha Sharir,
Shakhar Smorodinsky:
Extremal Configurations and Levels in Pseudoline Arrangements.
WADS 2003: 127-139 |
10 | EE | Micha Sharir,
Shakhar Smorodinsky:
On neighbors in geometric permutations.
Discrete Mathematics 268(1-3): 327-335 (2003) |
9 | EE | Guy Even,
Zvi Lotker,
Dana Ron,
Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
SIAM J. Comput. 33(1): 94-136 (2003) |
2002 |
8 | EE | Guy Even,
Zvi Lotker,
Dana Ron,
Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
FOCS 2002: 691-700 |
7 | EE | Micha Sharir,
Shakhar Smorodinsky:
On Neighbors in Geometric Permutations.
SWAT 2002: 131-139 |
6 | EE | Eran Nevo,
János Pach,
Rom Pinchasi,
Micha Sharir,
Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications.
Symposium on Computational Geometry 2002: 123-132 |
2001 |
5 | EE | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions.
Discrete & Computational Geometry 26(2): 195-204 (2001) |
2000 |
4 | | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions.
EWCG 2000: 132-135 |
3 | EE | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An improved bound for k-sets in three dimensions.
Symposium on Computational Geometry 2000: 43-49 |
2 | EE | Shakhar Smorodinsky,
Joseph S. B. Mitchell,
Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd.
Discrete & Computational Geometry 23(2): 247-259 (2000) |
1999 |
1 | EE | Shakhar Smorodinsky,
Joseph S. B. Mitchell,
Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd.
Symposium on Computational Geometry 1999: 400-406 |