Shakhar Smorodinsky

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 35

Top Topics

Sufficiently Accurate

Related Problems

Multivalued Dependencies

Geometric Objects

Top Venues

Discret. Comput. Geom.

Publications

Chaya Keller, Shakhar Smorodinsky
Zarankiewicz's Problem via ε-t-Nets. SoCG (2024)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
On Separating Path and Tree Systems in Graphs. CoRR (2023)
Chaya Keller, Shakhar Smorodinsky
Zarankiewicz's problem via ε-t-nets. CoRR (2023)
Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
Conflict-Free Colouring of Subsets. CoRR (2022)
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
A Solution to Ringel's Circle Problem. SoCG (2022)
Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
The ε-t-Net Problem. Discret. Comput. Geom. 68 (2) (2022)
Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. SIAM J. Discret. Math. 36 (3) (2022)
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
A solution to Ringel's circle problem. CoRR (2021)
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky
On the VC-dimension of half-spaces with respect to convex sets. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Chaya Keller, Alexandre Rok, Shakhar Smorodinsky
Conflict-Free Coloring of String Graphs. Discret. Comput. Geom. 65 (4) (2021)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66 (4) (2021)
Chaya Keller, Shakhar Smorodinsky
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. Discret. Comput. Geom. 63 (4) (2020)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced line separators of unit disk graphs. Comput. Geom. 86 (2020)
Chaya Keller, Shakhar Smorodinsky
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. SODA (2020)
Chaya Keller, Shakhar Smorodinsky
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. Discret. Comput. Geom. 64 (3) (2020)
Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
The ε-t-Net Problem. CoRR (2020)
Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
The ε-t-Net Problem. SoCG (2020)
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky
On the VC-dimension of convex sets and half-spaces. CoRR (2019)
Chaya Keller, Shakhar Smorodinsky
A new lower bound on Hadwiger-Debrunner numbers in the plane. CoRR (2018)
Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu, Frank de Zeeuw
Distinct distances between points and lines. Comput. Geom. 69 (2018)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG (2018)
Chaya Keller, Shakhar Smorodinsky
On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. Electron. J. Comb. 25 (4) (2018)
Chaya Keller, Shakhar Smorodinsky
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. SODA (2018)
Chaya Keller, Shakhar Smorodinsky
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. SoCG (2018)
Chaya Keller, Shakhar Smorodinsky
property. Comput. Geom. 72 (2018)
Rann Smorodinsky, Shakhar Smorodinsky
The Price of Anarchy in Hypergraph Coloring Games. CoRR (2017)
Chaya Keller, Shakhar Smorodinsky
On the union complexity of families of axis-parallel rectangles with a low packing number. CoRR (2017)
Márton Naszódi, Leonardo Martínez-Sandoval, Shakhar Smorodinsky
Bounding a global red-blue proportion using local conditions. CoRR (2017)
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
On interference among moving sensors and related problems. J. Comput. Geom. 8 (1) (2017)
Chaya Keller, Shakhar Smorodinsky, Gábor Tardos
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. SODA (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. WADS (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. CoRR (2017)
Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
On Vertex Rankings of Graphs and its Relatives. CoRR (2016)
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
On Interference Among Moving Sensors and Related Problems. ESA (2016)
Alexandre Rok, Shakhar Smorodinsky
Weak 1/r-Nets for Moving Points. SoCG (2016)
Alexandre Rok, Shakhar Smorodinsky
A short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points. CoRR (2015)
Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
On vertex rankings of graphs and its relatives. Discret. Math. 338 (8) (2015)
Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
On Kinetic Range Spaces and their Applications. CoRR (2015)
Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky
Epsilon-Nets for Halfspaces Revisited. CoRR (2014)
Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky
Strong Conflict-Free Coloring for Intervals. Algorithmica 70 (4) (2014)
Miriam Farber, Saurabh Ray, Shakhar Smorodinsky
On totally positive matrices and geometric incidences. J. Comb. Theory, Ser. A 128 (2014)
Guy Even, Shakhar Smorodinsky
Hitting sets online and unique-max coloring. Discret. Appl. Math. 178 (2014)
Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky
Strong Conflict-Free Coloring for Intervals. ISAAC (2012)
Shakhar Smorodinsky, Yelena Yuditsky
Polychromatic coloring for half-planes. J. Comb. Theory, Ser. A 119 (1) (2012)
Guy Even, Shakhar Smorodinsky
Hitting Sets Online and Unique-Max Coloring CoRR (2012)
Panagiotis Cheilaris, Shakhar Smorodinsky
Conflict-free coloring with respect to a subset of intervals CoRR (2012)
Guy Even, Shakhar Smorodinsky
Hitting Sets Online and Vertex Ranking. ESA (2011)
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
Colorful Strips. Graphs Comb. 27 (3) (2011)
Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. SCG (2011)
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19 (4) (2010)
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
Colorful Strips. LATIN (2010)
Shakhar Smorodinsky, Yelena Yuditsky
Polychromatic Coloring for Half-Planes. SWAT (2010)
Panagiotis Cheilaris, Shakhar Smorodinsky
Choosability in geometric hypergraphs CoRR (2010)
Elad Horev, Roi Krakovski, Shakhar Smorodinsky
Conflict-Free Coloring Made Stronger CoRR (2010)
Shakhar Smorodinsky
Conflict-Free Coloring and its Applications CoRR (2010)
Elad Horev, Roi Krakovski, Shakhar Smorodinsky
Conflict-Free Coloring Made Stronger. SWAT (2010)
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
Colorful Strips CoRR (2009)
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) (2009)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
Small weak epsilon-nets. Comput. Geom. 42 (5) (2009)
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41 (2) (2009)
Shakhar Smorodinsky
A note on the online First-Fit algorithm for coloring k. Inf. Process. Lett. 109 (1) (2008)
Shakhar Smorodinsky, Marek Sulovský, Uli Wagner
On Center Regions and Balls Containing Many Points. COCOON (2008)
Noga Alon, Shakhar Smorodinsky
Conflict-Free colorings of Shallow Discs. Int. J. Comput. Geom. Appl. 18 (6) (2008)
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
Coloring Geometric Range Spaces. LATIN (2008)
Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
Weak ε-nets and interval chains. SODA (2008)
Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
Weak ε-nets and interval chains. J. ACM 55 (6) (2008)
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. Electron. Notes Discret. Math. 31 (2008)
Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky
Deterministic conflict-free coloring for intervals: From offline to online. ACM Trans. Algorithms 4 (4) (2008)
Shakhar Smorodinsky
On The Chromatic Number of Geometric Hypergraphs. SIAM J. Discret. Math. 21 (3) (2007)
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
Online Conflict-Free Colorings for Hypergraphs. ICALP (2007)
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) (2007)
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)
Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38 (2) (2007)
Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
k-Sets in Four Dimensions. Discret. Comput. Geom. 35 (2) (2006)
Shakhar Smorodinsky
On the chromatic number of some geometric hypergraphs. SODA (2006)
Noga Alon, Shakhar Smorodinsky
Conflict-free colorings of shallow discs. SCG (2006)
Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky
Conflict-free coloring for intervals: from offline to online. SPAA (2006)
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)
Boris Aronov, Shakhar Smorodinsky
On geometric permutations induced by lines transversal through a fixed point. SODA (2005)
Boris Aronov, Shakhar Smorodinsky
Geometric Permutations Induced by Line Transversals through a Fixed Point. Discret. Comput. Geom. 34 (2) (2005)
Sariel Har-Peled, Shakhar Smorodinsky
Conflict-Free Coloring of Points and Simple Regions in the Plane. Discret. Comput. Geom. 34 (1) (2005)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
Small weak epsilon nets. CCCG (2005)
Shakhar Smorodinsky, Micha Sharir
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Comb. Probab. Comput. 13 (3) (2004)
Rom Pinchasi, Shakhar Smorodinsky
On locally Delaunay geometric graphs. SCG (2004)
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) (2004)
Micha Sharir, Shakhar Smorodinsky
On neighbors in geometric permutations. Discret. Math. 268 (1-3) (2003)
Micha Sharir, Shakhar Smorodinsky
Extremal Configurations and Levels in Pseudoline Arrangements. WADS (2003)
Sariel Har-Peled, Shakhar Smorodinsky
On conflict-free coloring of points and simple regions in the plane. SCG (2003)
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) (2003)
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)
Micha Sharir, Shakhar Smorodinsky
On Neighbors in Geometric Permutations. SWAT (2002)
Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
Lenses in arrangements of pseudo-circles and their applications. SCG (2002)
Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
-Sets in Three Dimensions. Discret. Comput. Geom. 26 (2) (2001)
Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discret. Comput. Geom. 23 (2) (2000)
Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
-sets in three dimensions. SCG (2000)
Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
An Improved Bound for k-Sets in Three Dimensions. EuroCG (2000)
Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
. SCG (1999)