Shakhar Smorodinsky

Generating author description...

All published works

Action	Title	Year	Authors
+	A solution to Ringel’s circle problem	2024	James Davies Chaya Keller Linda Kleist Shakhar Smorodinsky Bartosz Walczak
+ PDF Chat	On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects	2024	Timothy M. Chan Chaya Keller Shakhar Smorodinsky
+ PDF Chat	A survey of Zarankiewicz problem in geometry	2024	Shakhar Smorodinsky
+ PDF Chat	On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs	2024	Seunghun Lee Shakhar Smorodinsky
+ PDF Chat	Conflict-Free Colouring of Subsets	2023	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	Zarankiewicz's problem via $ε$-t-nets	2023	Chaya Keller Shakhar Smorodinsky
+	On Separating Path and Tree Systems in Graphs	2023	Ahmad Biniaz Prosenjit Bose Jean-Lou De Carufel Anil Maheshwari Babak Miraftab Saeed Odak Michiel Smid Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs	2022	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	Conflict-Free Colouring of Subsets	2022	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	A solution to Ringel's circle problem	2021	James Davies Chaya Keller Linda Kleist Shakhar Smorodinsky Bartosz Walczak
+ PDF Chat	A new lower bound on Hadwiger-Debrunner numbers in the plane	2021	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	On the VC-dimension of half-spaces with respect to convex sets	2021	Nicolas Grelier Saeed Ilchi Tillmann Miltzow Shakhar Smorodinsky
+ PDF Chat	On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs	2021	Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+	A solution to Ringel's circle problem	2021	James Davies Chaya Keller Linda Kleist Shakhar Smorodinsky Bartosz Walczak
+	The $\epsilon$-$t$-Net Problem	2020	Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	Conflict-Free Coloring of String Graphs	2020	Chaya Keller Alexandre Rok Shakhar Smorodinsky
+	The $ε$-$t$-Net Problem	2020	Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane	2019	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	Balanced line separators of unit disk graphs	2019	Paz Carmi Man Kwun Chiu Matthew J. Katz Matias Korman Yoshio Okamoto André van Renssen Marcel Roeloffzen Taichi Shiitada Shakhar Smorodinsky
+	On the VC-dimension of convex sets and half-spaces.	2019	Nicolas Grelier Saeed Ilchi Tillmann Miltzow Shakhar Smorodinsky
+	On the VC-dimension of half-spaces with respect to convex sets	2019	Nicolas Grelier Saeed Ilchi Tillmann Miltzow Shakhar Smorodinsky
+ PDF Chat	From a (p, 2)-Theorem to a Tight (p, q)-Theorem	2018	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number	2018	Chaya Keller Shakhar Smorodinsky
+	A new lower bound on Hadwiger-Debrunner numbers in the plane	2018	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	Improved bounds on the Hadwiger–Debrunner numbers	2018	Chaya Keller Shakhar Smorodinsky Gábor Tardos
+	On piercing numbers of families satisfying the (p,q) property	2018	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	Conflict-Free Coloring of Intersection Graphs of Geometric Objects	2018	Chaya Keller Shakhar Smorodinsky
+	A new lower bound on Hadwiger-Debrunner numbers in the plane	2018	Chaya Keller Shakhar Smorodinsky
+	Conflict-Free Coloring of String Graphs	2017	Chaya Keller Alexandre Rok Shakhar Smorodinsky
+	From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem	2017	Chaya Keller Shakhar Smorodinsky
+ PDF Chat	Distinct distances between points and lines	2017	Micha Sharir Shakhar Smorodinsky Claudiu Valculescu Frank de Zeeuw
+	Balanced Line Separators of Unit Disk Graphs	2017	Paz Carmi Man Kwun Chiu Matthew J. Katz Matias Korman Yoshio Okamoto André van Renssen Marcel Roeloffzen Taichi Shiitada Shakhar Smorodinsky
+	The Price of Anarchy in Hypergraph Coloring Games.	2017	Rann Smorodinsky Shakhar Smorodinsky
+	Conflict-Free Coloring of Intersection Graphs of Geometric Objects	2017	Chaya Keller Shakhar Smorodinsky
+	On Piercing Numbers of Families Satisfying the $(p,q)_r$ Property	2017	Chaya Keller Shakhar Smorodinsky
+	On the union complexity of families of axis-parallel rectangles with a low packing number	2017	Chaya Keller Shakhar Smorodinsky
+	Bounding a global red-blue proportion using local conditions.	2017	Márton Naszódi Leonardo Martínez-Sandoval Shakhar Smorodinsky
+	Hypergraphical Clustering Games of Mis-Coordination	2017	Rann Smorodinsky Shakhar Smorodinsky
+ PDF Chat	Balanced Line Separators of Unit Disk Graphs	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	2017	Paz Carmi Man Kwun Chiu Matthew J. Katz Matias Korman Yoshio Okamoto André van Renssen Marcel Roeloffzen Taichi Shiitada Shakhar Smorodinsky
+	On the union complexity of families of axis-parallel rectangles with a low packing number	2017	Chaya Keller Shakhar Smorodinsky
+	From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem	2017	Chaya Keller Shakhar Smorodinsky
+	Conflict-Free Coloring of Intersection Graphs of Geometric Objects	2017	Chaya Keller Shakhar Smorodinsky
+	Bounding a global red-blue proportion using local conditions	2017	Márton Naszódi Leonardo Martínez-Sandoval Shakhar Smorodinsky
+	Conflict-Free Coloring of String Graphs	2017	Chaya Keller Alexandre Rok Shakhar Smorodinsky
+	On Piercing Numbers of Families Satisfying the $(p,q)_r$ Property	2017	Chaya Keller Shakhar Smorodinsky
+	On Vertex Rankings of Graphs and its Relatives	2016	Ilan Karpas Ofer Neiman Shakhar Smorodinsky
+	On Vertex Rankings of Graphs and its Relatives	2016	Ilan Karpas Ofer Neiman Shakhar Smorodinsky
+	Distinct distances between points and lines	2015	Micha Sharir Shakhar Smorodinsky Claudiu Valculescu Frank de Zeeuw
+	A short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points.	2015	Alexandre Rok Shakhar Smorodinsky
+	Improved bounds on the Hadwiger-Debrunner numbers	2015	Chaya Keller Shakhar Smorodinsky Gábor Tardos
+	On vertex rankings of graphs and its relatives	2015	Ilan Karpas Ofer Neiman Shakhar Smorodinsky
+	On interference among moving sensors and related problems	2015	Jean-Lou De Carufel Matya Katz Matias Korman André van Renssen Marcel Roeloffzen Shakhar Smorodinsky
+	Improved bounds on the Hadwiger-Debrunner numbers	2015	Chaya Keller Shakhar Smorodinsky Gábor Tardos
+	Distinct distances between points and lines	2015	Micha Sharir Shakhar Smorodinsky Claudiu Valculescu Frank de Zeeuw
+	A short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points	2015	Alexandre Rok Shakhar Smorodinsky
+	On totally positive matrices and geometric incidences	2014	Miriam Farber Saurabh Ray Shakhar Smorodinsky
+	Hitting sets online and unique-max coloring	2014	Guy Even Shakhar Smorodinsky
+	Epsilon-Nets for Halfspaces Revisited	2014	Sariel Har-Peled Haim Kaplan Micha Sharir Shakhar Smorodinsky
+	On Totally Positive Matrices and Geometric Incidences	2013	Miriam Farber Saurabh Ray Shakhar Smorodinsky
+ PDF Chat	Conflict-Free Coloring and its Applications	2013	Shakhar Smorodinsky
+	On Totally Positive Matrices and Geometric Incidences	2013	Miriam Farber Saurabh Ray Shakhar Smorodinsky
+	Hitting Sets Online and Unique-Max Coloring	2012	Guy Even Shakhar Smorodinsky
+	Conflict-free coloring with respect to a subset of intervals	2012	Panagiotis Cheilaris Shakhar Smorodinsky
+	Hitting Sets Online and Unique-Max Coloring	2012	Guy Even Shakhar Smorodinsky
+ PDF Chat	Polychromatic coloring for half-planes	2011	Shakhar Smorodinsky Yelena Yuditsky
+	Choosability in geometric hypergraphs	2010	Panagiotis Cheilaris Shakhar Smorodinsky
+ PDF Chat	Polychromatic Coloring for Half-Planes	2010	Shakhar Smorodinsky Yelena Yuditsky
+ PDF Chat	Conflict-Free Coloring Made Stronger	2010	Elad Aigner‐Horev Roi Krakovski Shakhar Smorodinsky
+	The potential to improve the choice: list conflict-free coloring for geometric hypergraphs	2010	Panagiotis Cheilaris Shakhar Smorodinsky Marek Sulovský
+	Conflict-Free Coloring and its Applications	2010	Shakhar Smorodinsky
+	Colorful Strips	2009	Greg Aloupis Jean Cardinal Sébastien Collette Shinji Imahori Matias Korman Stefan Langerman Oded Schwartz Shakhar Smorodinsky Perouz Taslakian
+ PDF Chat	Compatible geometric matchings	2009	Oswin Aichholzer Sergey Bereg Adrian Dumitrescu Alfredo Garcı́a Clemens Huemer Ferrán Hurtado Mikio Kanō Alberto Márquez David Rappaport Shakhar Smorodinsky
+	Colorful Strips	2009	Greg Aloupis Jean Cardinal Sébastien Collette Shinji Imahori Matias Korman Stefan Langerman Oded Schwartz Shakhar Smorodinsky Perouz Taslakian
+ PDF Chat	Coloring Geometric Range Spaces	2008	Greg Aloupis Jean Cardinal Sébastien Collette Stefan Langerman Shakhar Smorodinsky
+ PDF Chat	Compatible Geometric Matchings	2008	Oswin Aichholzer Sergey Bereg Adrian Dumitrescu Alfredo Garcı́a Clemens Huemer Ferrán Hurtado Mikio Kano Alberto Márquez David Rappaport Shakhar Smorodinsky
+	Coloring Geometric Range Spaces	2008	Greg Aloupis Jean Cardinal Sébastien Collette Stefan Langerman Shakhar Smorodinsky
+ PDF Chat	Convexity in Topological Affine Planes	2007	Raghavan Dhandapani Jacob E. Goodman Andreas F. Holmsen Richard Pollack Shakhar Smorodinsky
+ PDF Chat	On The Chromatic Number of Geometric Hypergraphs	2007	Shakhar Smorodinsky
+	On the chromatic number of some geometric hypergraphs	2006	Shakhar Smorodinsky
+ PDF Chat	Geometric Permutations Induced by Line Transversals through a Fixed Point	2005	Boris Aronov Shakhar Smorodinsky
+ PDF Chat	Conflict-Free Coloring of Points and Simple Regions in the Plane	2005	Sariel Har-Peled Shakhar Smorodinsky
+	On geometric permutations induced by lines transversal through a fixed point	2005	Boris Aronov Shakhar Smorodinsky
+	On locally Delaunay geometric graphs	2004	Rom Pinchasi Shakhar Smorodinsky
+ PDF Chat	Lenses in arrangements of pseudo-circles and their applications	2004	Pankaj K. Agarwal Eran Nevo János Pach Rom Pinchasi Micha Sharir Shakhar Smorodinsky
+	On neighbors in geometric permutations	2003	Micha Sharir Shakhar Smorodinsky
+ PDF Chat	Lenses in arrangements of pseudo-circles and their applications	2002	Eran Nevo János Pach Rom Pinchasi Micha Sharir Shakhar Smorodinsky
+	On Neighbors in Geometric Permutations	2002	Micha Sharir Shakhar Smorodinsky
+ PDF Chat	Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in R d	2000	Shakhar Smorodinsky Joseph S. B. Mitchell M. Sharir
+	Sharp bounds on geometric permutations of pairwise disjoint balls in R <sup>d</sup>	1999	Shakhar Smorodinsky Joseph S. B. Mitchell Micha Sharir

Common Coauthors

Coauthor	Papers Together
Chaya Keller	33
Micha Sharir	9
Yelena Yuditsky	9
Matias Korman	7
Bruno Jartoux	6
Marcel Roeloffzen	5
André van Renssen	5
Alexandre Rok	5
Jean Cardinal	4
Taichi Shiitada	4
Stefan Langerman	4
Greg Aloupis	4
Paz Carmi	4
Man Kwun Chiu	4
Sébastien Collette	4
Matthew J. Katz	4
Frank de Zeeuw	3
Bartosz Walczak	3
Gábor Tardos	3
Saeed Ilchi	3
James Davies	3
Ilan Karpas	3
Panagiotis Cheilaris	3
Saurabh Ray	3
Rom Pinchasi	3
Nicolas Grelier	3
Claudiu Valculescu	3
Tillmann Miltzow	3
Ofer Neiman	3
Miriam Farber	3
Guy Even	3
Yoshio Okamoto	3
Linda Kleist	3
Noga Alon	2
Oded Schwartz	2
Eran Nevo	2
Joseph S. B. Mitchell	2
Alberto Márquez	2
Perouz Taslakian	2
János Pach	2
Clemens Huemer	2
Sergey Bereg	2
Sariel Har-Peled	2
Boris Aronov	2
Jean-Lou De Carufel	2
Rann Smorodinsky	2
Leonardo Martínez-Sandoval	2
David R. Wood	2
Jorge Urrutia	2
Diane L. Souvaine	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem	1992	Noga Alon Daniel J. Kleitman	11
+	Convex Sets in the Plane with Three of Every Four Meeting	2001	Daniel J. Kleitman András Gyárfás Gézá Tóth	9
+	Über eine Variante zum Hellyschen Satz	1957	H. Hadwiger Hans Debrunner	8
+ PDF Chat	Indecomposable Coverings	2007	János Pach Gábor Tardos Gézá Tóth	7
+ PDF Chat	Lower bounds for weak epsilon-nets and stair-convexity	2011	Boris Bukh Jiřı́ Matoušek Gabriel Nivasch	7
+	Decomposition of multiple coverings into many parts	2008	János Pach Gézá Tóth	7
+	On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities	2015	Vladimir Vapnik Alexey Chervonenkis	7
+	Applications of random sampling in computational geometry, II	1988	Kenneth L. Clarkson	6
+ PDF Chat	Geometric permutations and common transversals	1986	Meir Katchalski Teresa Lewis A. Liu	6
+ PDF Chat	The different ways of stabbing disjoint convex sets	1992	Meir Katchalski T. Lewis A. Liu	6
+ PDF Chat	Conflict-Free Coloring and its Applications	2013	Shakhar Smorodinsky	6
+ PDF Chat	Upper bounds on geometric permutations for convex sets	1990	Rephael Wenger	6
+ PDF Chat	Decomposing Coverings and the Planar Sensor Cover Problem	2009	Matt Gibson Kasturi Varadarajan	6
+ PDF Chat	On The Chromatic Number of Geometric Hypergraphs	2007	Shakhar Smorodinsky	5
+ PDF Chat	Coloring Geometric Range Spaces	2008	Greg Aloupis Jean Cardinal Sébastien Collette Stefan Langerman Shakhar Smorodinsky	5
+ PDF Chat	Conflict-Free Coloring of Points and Simple Regions in the Plane	2005	Sariel Har-Peled Shakhar Smorodinsky	5
+	Toward a theory of crossing numbers	1970	W. T. Tutte	5
+ PDF Chat	Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set	2012	Timothy M. Chan	5
+ PDF Chat	Conflict-Free Coloring Made Stronger	2010	Elad Aigner‐Horev Roi Krakovski Shakhar Smorodinsky	5
+ PDF Chat	The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2	1990	Herbert Edelsbrunner Micha Sharir	5
+ PDF Chat	Improved bounds on the Hadwiger–Debrunner numbers	2018	Chaya Keller Shakhar Smorodinsky Gábor Tardos	5
+ PDF Chat	Near-Optimal Separators in String Graphs	2013	Jir̆í Matous̆ek	4
+	Combinatorial geometry	1996		4
+ PDF Chat	Point Selections and Weak ε-Nets for Convex Hulls	1992	Noga Alon Imre Bárány Zoltán Füredi Daniel J. Kleitman	4
+ PDF Chat	A Purely Combinatorial Proof of the Hadwiger Debrunner $(p,q)$ Conjecture	1996	N. Alon D. J. Kleitman	4
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	4
+ PDF Chat	Combinatorial complexity bounds for arrangements of curves and spheres	1990	Kenneth L. Clarkson Herbert Edelsbrunner Leonidas Guibas Micha Sharir Emo Welzl	4
+ PDF Chat	Applications of random sampling in computational geometry, II	1989	Kenneth L. Clarkson Peter W. Shor	4
+ PDF Chat	Almost tight bounds forɛ-Nets	1992	János Komlós János Pach Gerhard J. Woeginger	4
+ PDF Chat	Über wesentlich unplättbare Kurven im dreidimensionalen Raume	1934	Ch. Chojnacki	4
+ PDF Chat	A Variant of the Hadwiger–Debrunner (p, q)-Problem in the Plane	2015	Sathish Govindarajan Gabriel Nivasch	4
+	Intersection patterns of convex sets	1984	Gil Kalai	4
+ PDF Chat	Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in R d	2000	Shakhar Smorodinsky Joseph S. B. Mitchell M. Sharir	4
+	Extremal problems in discrete geometry	1983	Endre Szemerédi W. T. Trotter	4
+	A Survey of the Hadwiger-Debrunner (p, q)-problem	2003	Jürgen Eckhoff	4
+	Coloring Intersection Hypergraphs of Pseudo-Disks	2018	Bal 'azs Keszegh	3
+	Unit distances in the Euclidean plane	1984	Joel Spencer Endre Szemerédi WT Trotter	3
+	Discrepancy and approximations for bounded VC-dimension	1993	Jiřı́ Matoušek Emo Welzl Lorenz Wernisch	3
+ PDF Chat	Tight upper bounds for the discrepancy of half-spaces	1995	Jiřı́ Matoušek	3
+ PDF Chat	Lenses in arrangements of pseudo-circles and their applications	2004	Pankaj K. Agarwal Eran Nevo János Pach Rom Pinchasi Micha Sharir Shakhar Smorodinsky	3
+ PDF Chat	Colourful and Fractional (p,q)-theorems	2013	Imre Bárány Ferenc Fodor Luis Montejano Déborah Oliveros Attila Pór	3
+	Geometric Discrepancy	1999	Jiřı́ Matoušek	3
+	Combinatorial Theorems on Classifications of Subsets of a Given Set	1952	P. Erdős R. Rado	3
+ PDF Chat	Tight lower bounds for the size of epsilon-nets	2012	János Pach Gábor Tardos	3
+ PDF Chat	A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in R d	2001	Matthew J. Katz Kasturi Varadarajan	3
+ PDF Chat	Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs	2013	Panagiotis Cheilaris Balázs Keszegh Dömötör Pálvölgyi	3
+	Maximal Independent Subsets in Steiner Systems and in Planar Sets	1991	Zoltán Füred	3
+	On the density of families of sets	1972	N. Sauer	3
+ PDF Chat	Tight lower bounds for the size of epsilon-nets	2011	János Pach Gábor Tardos	3
+	Independent sets in hypergraphs	2014	József Balogh Robert Morris Wojciech Samotij	3