|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 32 occurrences of 16 keywords
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shakhar Smorodinsky, Yelena Yuditsky |
Polychromatic coloring for half-planes.  |
J. Comb. Theory, Ser. A  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Cheilaris, Shakhar Smorodinsky |
Conflict-free coloring with respect to a subset of intervals |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Shakhar Smorodinsky |
Hitting Sets Online and Vertex Ranking. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský |
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
Online Conflict-Free Colouring for Hypergraphs. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky |
Conflict-Free Coloring and its Applications |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Panagiotis Cheilaris, Shakhar Smorodinsky |
Choosability in geometric hypergraphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elad Horev, Roi Krakovski, Shakhar Smorodinsky |
Conflict-Free Coloring Made Stronger |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky, Yelena Yuditsky |
Polychromatic Coloring for Half-Planes. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Horev, Roi Krakovski, Shakhar Smorodinsky |
Conflict-Free Coloring Made Stronger. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Geometric hypergraphs, Decompositions, Coloring, Covering |
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky |
Small weak epsilon-nets. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky |
A note on the online First-Fit algorithm for coloring k. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky |
Deterministic conflict-free coloring for intervals: From offline to online. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Online algorithms, coloring, cellular networks, frequency assignment, conflict free |
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak &epsis;-nets and interval chains. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
Interval chain, inverse Ackermann function, moment curve, weak epsilon-net |
| 1 | Noga Alon, Shakhar Smorodinsky |
Conflict-Free colorings of Shallow Discs. |
Int. J. Comput. Geometry Appl. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak ε-nets and interval chains. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky, Marek Sulovský, Uli Wagner |
On Center Regions and Balls Containing Many Points. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raghavan Dhandapani, Jacob E. Goodman, Andreas Holmsen, Richard Pollack, Shakhar Smorodinsky |
Convexity in Topological Affine Planes. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky |
On The Chromatic Number of Geometric Hypergraphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Chen 0006, 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
Online Conflict-Free Colorings for Hypergraphs. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
online algorithms, coloring, cellular networks, frequency assignment, conflict free |
| 1 | Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner |
k-Sets in Four Dimensions. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky |
On the chromatic number of some geometric hypergraphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shakhar Smorodinsky |
Conflict-free colorings of shallow discs. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
conflict-free coloring, wireless, combinatorics, frequency-assignment |
| 1 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky |
Conflict-free coloring for intervals: from offline to online. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
online algorithms, coloring, cellular networks, frequency assignment, conflict free |
| 1 | Sariel Har-Peled, Shakhar Smorodinsky |
Conflict-Free Coloring of Points and Simple Regions in the Plane. |
Discrete & Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Shakhar Smorodinsky |
Geometric Permutations Induced by Line Transversals through a Fixed Point. |
Discrete & Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Shakhar Smorodinsky |
On geometric permutations induced by lines transversal through a fixed point. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara |
Small weak epsilon nets. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Shakhar Smorodinsky, Micha Sharir |
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
incidence problems, pseudo-circles, Arrangements |
| 1 | Rom Pinchasi, Shakhar Smorodinsky |
On locally Delaunay geometric graphs. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
extremal graph theory, sensor networks, geometric graphs, Delaunay |
| 1 | Micha Sharir, Shakhar Smorodinsky |
On neighbors in geometric permutations. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Shakhar Smorodinsky |
On conflict-free coloring of points and simple regions in the plane. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
coloring, cellular network, frequency assignment |
| 1 | Micha Sharir, Shakhar Smorodinsky |
Extremal Configurations and Levels in Pseudoline Arrangements. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
distinct distances, pseudo-circles, arrangements, lenses, incidences, levels |
| 1 | Micha Sharir, Shakhar Smorodinsky |
On Neighbors in Geometric Permutations. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An Improved Bound for k-Sets in Three Dimensions. |
Discrete & Computational Geometry |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir |
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. |
Discrete & Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An improved bound for k-sets in three dimensions. |
Symposium on Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An Improved Bound for k-Sets in Three Dimensions. |
EuroCG |
2000 |
DBLP BibTeX RDF |
|
| 1 | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir |
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. |
Symposium on Computational Geometry |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")