( en | de | ru )

 

Disambiguation of "Smorodinsky, Shakhar"

Author of the publication

copydeleteadd this publication to your clipboard
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.

, , , and . SIAM J. Comput., 33 (1): 94-136 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Smorodinsky, Shakhar
add a person with the name Smorodinsky, Shakhar
 

Other publications of authors with the same name

From a (p, 2)-Theorem to a Tight (p, q)-Theorem., and . Discret. Comput. Geom., 63 (4): 821-847 (2020)Epsilon-Nets for Halfspaces Revisited., , , and . CoRR, (2014)Hitting Sets Online and Vertex Ranking., and . ESA, volume 6942 of Lecture Notes in Computer Science, page 347-357. Springer, (2011)Compatible Geometric Matchings., , , , , , , , , and 3 other author(s). Electron. Notes Discret. Math., (2008)Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd., , and . Discret. Comput. Geom., 23 (2): 247-259 (2000)Conflict-free colorings of shallow discs., and . SCG, page 41-43. ACM, (2006)A Solution to Ringel's Circle Problem., , , , and . SoCG, volume 224 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Strong Conflict-Free Coloring for Intervals., , , and . Algorithmica, 70 (4): 732-749 (2014)Combinatorial problems in computational geometry. Tel Aviv University, Israel, (2003)Tel Aviv University Library.On locally Delaunay geometric graphs., and . SCG, page 378-382. ACM, (2004)