Scholar
Shakhar Smorodinsky
Google Scholar ID: H__Wa0sAAAAJ
Ben-Gurion University of the Negev
Computational Geometry
Combinatorics
Algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
608
H-index
13
i10-index
18
Publications
20
Co-authors
43
list available
Contact
CV
Open ↗
Publications
7 items
A simple proof of a $(p,2)$-theorem for non-piercing regions
2025
Cited
0
Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets
2025
Cited
0
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
2025
Cited
0
Polychromatic Coloring of Tuples in Hypergraphs
2025
Cited
0
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
International Symposium on Computational Geometry · 2024
Cited
1
A survey of Zarankiewicz problem in geometry
arXiv.org · 2024
Cited
3
On Separating Path and Tree Systems in Graphs
arXiv.org · 2023
Cited
1
Resume (English only)
Co-authors
43 total
Co-author 1
Guy Even
EE, Tel-Aviv Univ
Janos Pach
Ecole Polytechnique Federale de Lausanne and Renyi Institute Budapest
Amotz Bar-Noy
Professor of Computer Science, City University of New York (CUNY)
Noga Alon
Princeton University and Tel Aviv University
rom pinchasi
Technion
Haim Kaplan
School of Computer Science, Tel Aviv University
Zvi Lotker
Professor In Bar Ilan University
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up