default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShakhar Smorodinsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Bruno Jartoux
, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Conflict-Free Colouring of Subsets. Discret. Comput. Geom. 72(2): 876-891 (2024)- [c36]Chaya Keller, Shakhar Smorodinsky:
Zarankiewicz's Problem via ε-t-Nets. SoCG 2024: 66:1-66:15 - [i23]Shakhar Smorodinsky:
A survey of Zarankiewicz problem in geometry. CoRR abs/2410.03702 (2024) - 2023
- [i22]Chaya Keller, Shakhar Smorodinsky:
Zarankiewicz's problem via ε-t-nets. CoRR abs/2311.13662 (2023) - [i21]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 abs/2312.14295 (2023) - 2022
- [j39]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
The ε-t-Net Problem. Discret. Comput. Geom. 68(2): 618-644 (2022) - [j38]Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. SIAM J. Discret. Math. 36(3): 1848-1860 (2022) - [c35]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14 - [i20]Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Conflict-Free Colouring of Subsets. CoRR abs/2207.01041 (2022) - 2021
- [j37]Chaya Keller, Alexandre Rok, Shakhar Smorodinsky:
Conflict-Free Coloring of String Graphs. Discret. Comput. Geom. 65(4): 1337-1372 (2021) - [j36]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): 1401-1414 (2021) - [j35]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) - [i19]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A solution to Ringel's circle problem. CoRR abs/2112.05042 (2021) - 2020
- [j34]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) - [j33]Chaya Keller, Shakhar Smorodinsky:
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. Discret. Comput. Geom. 63(4): 821-847 (2020) - [j32]Chaya Keller, Shakhar Smorodinsky:
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. Discret. Comput. Geom. 64(3): 916-941 (2020) - [c34]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
The ε-t-Net Problem. SoCG 2020: 5:1-5:15 - [c33]Chaya Keller, Shakhar Smorodinsky:
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane. SODA 2020: 1155-1169 - [i18]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
The ε-t-Net Problem. CoRR abs/2003.07061 (2020)
2010 – 2019
- 2019
- [i17]Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky:
On the VC-dimension of convex sets and half-spaces. CoRR abs/1907.01241 (2019) - 2018
- [j31]Chaya Keller, Shakhar Smorodinsky:
On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. Electron. J. Comb. 25(4): 4 (2018) - [j30]Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu, Frank de Zeeuw:
Distinct distances between points and lines. Comput. Geom. 69: 2-15 (2018) - [j29]Chaya Keller, Shakhar Smorodinsky:
On piercing numbers of families satisfying the (p, q)r property. Comput. Geom. 72: 11-18 (2018) - [c32]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: 2:1-2:12 - [c31]Chaya Keller, Shakhar Smorodinsky:
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. SoCG 2018: 51:1-51:14 - [c30]Chaya Keller, Shakhar Smorodinsky:
Conflict-Free Coloring of Intersection Graphs of Geometric Objects. SODA 2018: 2397-2411 - [i16]Chaya Keller, Shakhar Smorodinsky:
A new lower bound on Hadwiger-Debrunner numbers in the plane. CoRR abs/1809.06451 (2018) - 2017
- [j28]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): 32-46 (2017) - [c29]Chaya Keller, Shakhar Smorodinsky, Gábor Tardos:
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers. SODA 2017: 2254-2263 - [c28]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: 241-252 - [i15]Márton Naszódi, Leonardo Martínez-Sandoval, Shakhar Smorodinsky:
Bounding a global red-blue proportion using local conditions. CoRR abs/1701.02200 (2017) - [i14]Chaya Keller, Shakhar Smorodinsky:
On the union complexity of families of axis-parallel rectangles with a low packing number. CoRR abs/1702.00849 (2017) - [i13]Rann Smorodinsky, Shakhar Smorodinsky:
The Price of Anarchy in Hypergraph Coloring Games. CoRR abs/1706.05297 (2017) - [i12]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 abs/1709.02579 (2017) - 2016
- [c27]Alexandre Rok, Shakhar Smorodinsky:
Weak 1/r-Nets for Moving Points. SoCG 2016: 59:1-59:13 - [c26]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: 34:1-34:11 - [i11]Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky:
On Vertex Rankings of Graphs and its Relatives. CoRR abs/1609.06111 (2016) - 2015
- [j27]Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky:
On vertex rankings of graphs and its relatives. Discret. Math. 338(8): 1460-1467 (2015) - [i10]Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On Kinetic Range Spaces and their Applications. CoRR abs/1507.02130 (2015) - [i9]Alexandre Rok, Shakhar Smorodinsky:
A short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points. CoRR abs/1512.07505 (2015) - 2014
- [j26]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. Algorithmica 70(4): 732-749 (2014) - [j25]Guy Even, Shakhar Smorodinsky:
Hitting sets online and unique-max coloring. Discret. Appl. Math. 178: 71-82 (2014) - [j24]Miriam Farber, Saurabh Ray, Shakhar Smorodinsky:
On totally positive matrices and geometric incidences. J. Comb. Theory A 128: 149-161 (2014) - [i8]Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky:
Epsilon-Nets for Halfspaces Revisited. CoRR abs/1410.3154 (2014) - 2012
- [j23]Shakhar Smorodinsky, Yelena Yuditsky:
Polychromatic coloring for half-planes. J. Comb. Theory A 119(1): 146-154 (2012) - [c25]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. ISAAC 2012: 4-13 - [i7]Panagiotis Cheilaris, Shakhar Smorodinsky:
Conflict-free coloring with respect to a subset of intervals. CoRR abs/1204.6422 (2012) - [i6]Guy Even, Shakhar Smorodinsky:
Hitting Sets Online and Unique-Max Coloring. CoRR abs/1207.2598 (2012) - 2011
- [j22]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): 327-339 (2011) - [c24]Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský:
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. SCG 2011: 424-432 - [c23]Guy Even, Shakhar Smorodinsky:
Hitting Sets Online and Vertex Ranking. ESA 2011: 347-357 - 2010
- [j21]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19(4): 493-516 (2010) - [c22]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13 - [c21]Elad Horev, Roi Krakovski, Shakhar Smorodinsky:
Conflict-Free Coloring Made Stronger. SWAT 2010: 105-117 - [c20]Shakhar Smorodinsky, Yelena Yuditsky:
Polychromatic Coloring for Half-Planes. SWAT 2010: 118-126 - [i5]Shakhar Smorodinsky:
Conflict-Free Coloring and its Applications. CoRR abs/1005.3616 (2010) - [i4]Panagiotis Cheilaris, Shakhar Smorodinsky:
Choosability in geometric hypergraphs. CoRR abs/1005.5520 (2010) - [i3]Elad Horev, Roi Krakovski, Shakhar Smorodinsky:
Conflict-Free Coloring Made Stronger. CoRR abs/1006.2926 (2010)
2000 – 2009
- 2009
- [j20]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky:
Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) - [j19]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): 617-626 (2009) - [j18]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41(2): 348-362 (2009) - [i2]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. CoRR abs/0904.2115 (2009) - 2008
- [j17]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: 201-206 (2008) - [j16]Noga Alon, Shakhar Smorodinsky:
Conflict-Free colorings of Shallow Discs. Int. J. Comput. Geom. Appl. 18(6): 599-604 (2008) - [j15]Shakhar Smorodinsky:
A note on the online First-Fit algorithm for coloring k. Inf. Process. Lett. 109(1): 44-45 (2008) - [j14]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. J. ACM 55(6): 28:1-28:32 (2008) - [j13]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
Deterministic conflict-free coloring for intervals: From offline to online. ACM Trans. Algorithms 4(4): 44:1-44:18 (2008) - [c19]Shakhar Smorodinsky, Marek Sulovský, Uli Wagner:
On Center Regions and Balls Containing Many Points. COCOON 2008: 363-373 - [c18]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. LATIN 2008: 146-157 - [c17]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. SODA 2008: 1194-1203 - 2007
- [j12]Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky:
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38(2): 243-257 (2007) - [j11]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): 1342-1359 (2007) - [j10]Shakhar Smorodinsky:
On The Chromatic Number of Geometric Hypergraphs. SIAM J. Discret. Math. 21(3): 676-687 (2007) - [c16]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 - [c15]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: 194-195 - 2006
- [j9]Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner:
k-Sets in Four Dimensions. Discret. Comput. Geom. 35(2): 177-191 (2006) - [c14]Noga Alon, Shakhar Smorodinsky:
Conflict-free colorings of shallow discs. SCG 2006: 41-43 - [c13]Shakhar Smorodinsky:
On the chromatic number of some geometric hypergraphs. SODA 2006: 316-323 - [c12]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137 - 2005
- [j8]Sariel Har-Peled, Shakhar Smorodinsky:
Conflict-Free Coloring of Points and Simple Regions in the Plane. Discret. Comput. Geom. 34(1): 47-70 (2005) - [j7]Boris Aronov, Shakhar Smorodinsky:
Geometric Permutations Induced by Line Transversals through a Fixed Point. Discret. Comput. Geom. 34(2): 285-294 (2005) - [c11]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara:
Small weak epsilon nets. CCCG 2005: 52-56 - [c10]Boris Aronov, Shakhar Smorodinsky:
On geometric permutations induced by lines transversal through a fixed point. SODA 2005: 251-256 - [c9]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: 545-554 - 2004
- [j6]Shakhar Smorodinsky, Micha Sharir:
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Comb. Probab. Comput. 13(3): 389-411 (2004) - [j5]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): 139-186 (2004) - [c8]Rom Pinchasi, Shakhar Smorodinsky:
On locally Delaunay geometric graphs. SCG 2004: 378-382 - 2003
- [b1]Shakhar Smorodinsky:
Combinatorial problems in computational geometry. Tel Aviv University, Israel, 2003 - [j4]Micha Sharir, Shakhar Smorodinsky:
On neighbors in geometric permutations. Discret. Math. 268(1-3): 327-335 (2003) - [j3]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): 94-136 (2003) - [c7]Sariel Har-Peled, Shakhar Smorodinsky:
On conflict-free coloring of points and simple regions in the plane. SCG 2003: 114-123 - [c6]Micha Sharir, Shakhar Smorodinsky:
Extremal Configurations and Levels in Pseudoline Arrangements. WADS 2003: 127-139 - 2002
- [c5]Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. SCG 2002: 123-132 - [c4]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: 691-700 - [c3]Micha Sharir, Shakhar Smorodinsky:
On Neighbors in Geometric Permutations. SWAT 2002: 131-139 - 2001
- [j2]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions. Discret. Comput. Geom. 26(2): 195-204 (2001) - 2000
- [j1]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discret. Comput. Geom. 23(2): 247-259 (2000) - [c2]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An improved bound for k-sets in three dimensions. SCG 2000: 43-49 - [i1]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions. EuroCG 2000: 132-135
1990 – 1999
- 1999
- [c1]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. SCG 1999: 400-406
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
