The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Shakhar Smorodinsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
    Small weak epsilon nets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:52-56 [Conf]
  2. Noga Alon, Shakhar Smorodinsky
    Conflict-free colorings of shallow discs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:41-43 [Conf]
  3. Sariel Har-Peled, Shakhar Smorodinsky
    On conflict-free coloring of points and simple regions in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:114-123 [Conf]
  4. Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:123-132 [Conf]
  5. Rom Pinchasi, Shakhar Smorodinsky
    On locally Delaunay geometric graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:378-382 [Conf]
  6. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An improved bound for k-sets in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:43-49 [Conf]
  7. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:400-406 [Conf]
  8. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An Improved Bound for k-Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:132-135 [Conf]
  9. Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
    Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:691-700 [Conf]
  10. Boris Aronov, Shakhar Smorodinsky
    On geometric permutations induced by lines transversal through a fixed point. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:251-256 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  12. Shakhar Smorodinsky
    On the chromatic number of some geometric hypergraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:316-323 [Conf]
  13. Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky
    Conflict-free coloring for intervals: from offline to online. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:128-137 [Conf]
  14. Micha Sharir, Shakhar Smorodinsky
    On Neighbors in Geometric Permutations. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:131-139 [Conf]
  15. Micha Sharir, Shakhar Smorodinsky
    Extremal Configurations and Levels in Pseudoline Arrangements. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:127-139 [Conf]
  16. Shakhar Smorodinsky, Micha Sharir
    Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:389-411 [Journal]
  17. Boris Aronov, Shakhar Smorodinsky
    Geometric Permutations Induced by Line Transversals through a Fixed Point. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:285-294 [Journal]
  18. Sariel Har-Peled, Shakhar Smorodinsky
    Conflict-Free Coloring of Points and Simple Regions in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:1, pp:47-70 [Journal]
  19. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
    k-Sets in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:177-191 [Journal]
  20. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An Improved Bound for k-Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:195-204 [Journal]
  21. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:2, pp:247-259 [Journal]
  22. Micha Sharir, Shakhar Smorodinsky
    On neighbors in geometric permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:327-335 [Journal]
  23. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:139-186 [Journal]
  24. Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
    Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:94-136 [Journal]
  25. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  26. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Online Conflict-Free Colorings for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:219-230 [Conf]
  27. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:194-195 [Conf]

  28. On Center Regions and Balls Containing Many Points. [Citation Graph (, )][DBLP]


  29. Colorful Strips. [Citation Graph (, )][DBLP]


  30. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


  31. Weak ε-nets and interval chains. [Citation Graph (, )][DBLP]


  32. Conflict-Free Coloring Made Stronger. [Citation Graph (, )][DBLP]


  33. Polychromatic Coloring for Half-Planes. [Citation Graph (, )][DBLP]


  34. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  35. Small weak epsilon-nets. [Citation Graph (, )][DBLP]


  36. Colorful Strips [Citation Graph (, )][DBLP]


  37. Conflict-Free Coloring and its Applications [Citation Graph (, )][DBLP]


  38. Choosability in geometric hypergraphs [Citation Graph (, )][DBLP]


  39. Conflict-Free Coloring Made Stronger [Citation Graph (, )][DBLP]


  40. Convexity in Topological Affine Planes. [Citation Graph (, )][DBLP]


  41. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.456secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002