Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shakhar Smorodinsky
2010 – today
- 2012
[j23]Shakhar Smorodinsky, Yelena Yuditsky: Polychromatic coloring for half-planes. J. Comb. Theory, Ser. A 119(1): 146-154 (2012)- [c25]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky: Strong Conflict-Free Coloring for Intervals. ISAAC 2012: 4-13
- [i7]Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring with respect to a subset of intervals. CoRR abs/1204.6422 (2012)
- [i6]Guy Even, Shakhar Smorodinsky: Hitting Sets Online and Unique-Max Coloring. CoRR abs/1207.2598 (2012)
- 2011
- [j22]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. Graphs and Combinatorics 27(3): 327-339 (2011)
- [c24]Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský: The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. Symposium on Computational Geometry 2011: 424-432
- [c23]
- 2010
- [j21]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colouring for Hypergraphs. Combinatorics, Probability & Computing 19(4): 493-516 (2010)
- [c22]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. LATIN 2010: 2-13
- [c21]Elad Horev, Roi Krakovski, Shakhar Smorodinsky: Conflict-Free Coloring Made Stronger. SWAT 2010: 105-117
- [c20]
- [i5]
- [i4]Panagiotis Cheilaris, Shakhar Smorodinsky: Choosability in geometric hypergraphs. CoRR abs/1005.5520 (2010)
- [i3]Elad Horev, Roi Krakovski, Shakhar Smorodinsky: Conflict-Free Coloring Made Stronger. CoRR abs/1006.2926 (2010)
2000 – 2009
- 2009
- [j20]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky: Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009)
- [j19]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009)
- [j18]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. Discrete & Computational Geometry 41(2): 348-362 (2009)
- [i2]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. CoRR abs/0904.2115 (2009)
- 2008
- [j17]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, 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)
- [j16]Noga Alon, Shakhar Smorodinsky: Conflict-Free colorings of Shallow Discs. Int. J. Comput. Geometry Appl. 18(6): 599-604 (2008)
- [j15]Shakhar Smorodinsky: A note on the online First-Fit algorithm for coloring k. Inf. Process. Lett. 109(1): 44-45 (2008)
- [j14]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak &epsis;-nets and interval chains. J. ACM 55(6) (2008)
- [j13]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Deterministic conflict-free coloring for intervals: From offline to online. ACM Transactions on Algorithms 4(4) (2008)
- [c19]Shakhar Smorodinsky, Marek Sulovský, Uli Wagner: On Center Regions and Balls Containing Many Points. COCOON 2008: 363-373
- [c18]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. LATIN 2008: 146-157
- [c17]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak ε-nets and interval chains. SODA 2008: 1194-1203
- 2007
- [j12]Raghavan Dhandapani, Jacob E. Goodman, Andreas Holmsen, Richard Pollack, Shakhar Smorodinsky: Convexity in Topological Affine Planes. Discrete & Computational Geometry 38(2): 243-257 (2007)
- [j11]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)
- [j10]Shakhar Smorodinsky: On The Chromatic Number of Geometric Hypergraphs. SIAM J. Discrete Math. 21(3): 676-687 (2007)
- [c16]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230
- [c15]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
- 2006
- [j9]Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner: k-Sets in Four Dimensions. Discrete & Computational Geometry 35(2): 177-191 (2006)
- [c14]Noga Alon, Shakhar Smorodinsky: Conflict-free colorings of shallow discs. Symposium on Computational Geometry 2006: 41-43
- [c13]
- [c12]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137
- 2005
- [j8]Sariel Har-Peled, Shakhar Smorodinsky: Conflict-Free Coloring of Points and Simple Regions in the Plane. Discrete & Computational Geometry 34(1): 47-70 (2005)
- [j7]Boris Aronov, Shakhar Smorodinsky: Geometric Permutations Induced by Line Transversals through a Fixed Point. Discrete & Computational Geometry 34(2): 285-294 (2005)
- [c11]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara: Small weak epsilon nets. CCCG 2005: 52-56
- [c10]Boris Aronov, Shakhar Smorodinsky: On geometric permutations induced by lines transversal through a fixed point. SODA 2005: 251-256
- [c9]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
- 2004
- [j6]Shakhar Smorodinsky, Micha Sharir: Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Combinatorics, Probability & Computing 13(3): 389-411 (2004)
- [j5]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)
- [c8]Rom Pinchasi, Shakhar Smorodinsky: On locally Delaunay geometric graphs. Symposium on Computational Geometry 2004: 378-382
- 2003
- [j4]Micha Sharir, Shakhar Smorodinsky: On neighbors in geometric permutations. Discrete Mathematics 268(1-3): 327-335 (2003)
- [j3]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)
- [c7]Sariel Har-Peled, Shakhar Smorodinsky: On conflict-free coloring of points and simple regions in the plane. Symposium on Computational Geometry 2003: 114-123
- [c6]Micha Sharir, Shakhar Smorodinsky: Extremal Configurations and Levels in Pseudoline Arrangements. WADS 2003: 127-139
- 2002
- [c5]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
- [c4]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
- [c3]
- 2001
- [j2]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
- [j1]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)
- [c2]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An improved bound for k-sets in three dimensions. Symposium on Computational Geometry 2000: 43-49
- [i1]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An Improved Bound for k-Sets in Three Dimensions. EuroCG 2000: 132-135
1990 – 1999
- 1999
- [c1]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
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-05 21:49 CET by the dblp team