Shakhar Smorodinsky

1.4k total citations
53 papers, 626 citations indexed

About

Shakhar Smorodinsky is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Shakhar Smorodinsky has authored 53 papers receiving a total of 626 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computer Graphics and Computer-Aided Design, 34 papers in Computational Theory and Mathematics and 13 papers in Computer Vision and Pattern Recognition. Recurrent topics in Shakhar Smorodinsky's work include Computational Geometry and Mesh Generation (45 papers), Advanced Graph Theory Research (26 papers) and Point processes and geometric inequalities (12 papers). Shakhar Smorodinsky is often cited by papers focused on Computational Geometry and Mesh Generation (45 papers), Advanced Graph Theory Research (26 papers) and Point processes and geometric inequalities (12 papers). Shakhar Smorodinsky collaborates with scholars based in Israel, United States and Switzerland. Shakhar Smorodinsky's co-authors include Micha Sharir, Guy Even, Dana Ron, Zvi Lotker, Sariel Har-Peled, Gábor Tardos, Noga Alon, Amotz Bar-Noy, János Pach and Rom Pinchasi and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Discrete Applied Mathematics.

In The Last Decade

Shakhar Smorodinsky

49 papers receiving 546 citations

Peers

Shakhar Smorodinsky
Gézá Tóth Hungary
Pável Valtr Czechia
R. Bruce Richter Canada
Hubert de Fraysseix France
Gelasio Salazar Mexico
János Pach Hungary
Jeffrey S. Salowe United States
F. Hurtado Spain
Jürgen Bokowski Germany
Imrich Vrt’o Slovakia
Gézá Tóth Hungary
Shakhar Smorodinsky
Citations per year, relative to Shakhar Smorodinsky Shakhar Smorodinsky (= 1×) peers Gézá Tóth

Countries citing papers authored by Shakhar Smorodinsky

Since Specialization
Citations

This map shows the geographic impact of Shakhar Smorodinsky's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Shakhar Smorodinsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shakhar Smorodinsky more than expected).

Fields of papers citing papers by Shakhar Smorodinsky

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shakhar Smorodinsky. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Shakhar Smorodinsky. The network helps show where Shakhar Smorodinsky may publish in the future.

Co-authorship network of co-authors of Shakhar Smorodinsky

This figure shows the co-authorship network connecting the top 25 collaborators of Shakhar Smorodinsky. A scholar is included among the top collaborators of Shakhar Smorodinsky based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shakhar Smorodinsky. Shakhar Smorodinsky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sharir, Micha, et al.. (2017). Distinct distances between points and lines. Computational Geometry. 69. 2–15.
2.
Smorodinsky, Shakhar, et al.. (2017). On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers. Symposium on Discrete Algorithms. 2254–2263. 1 indexed citations
3.
Neiman, Ofer, et al.. (2015). On vertex rankings of graphs and its relatives. Discrete Mathematics. 338(8). 1460–1467. 3 indexed citations
4.
Ray, Saurabh, et al.. (2014). On totally positive matrices and geometric incidences. Journal of Combinatorial Theory Series A. 128. 149–161. 6 indexed citations
5.
Even, Guy & Shakhar Smorodinsky. (2014). Hitting sets online and unique-max coloring. Discrete Applied Mathematics. 178. 71–82. 3 indexed citations
6.
Smorodinsky, Shakhar, et al.. (2011). Polychromatic coloring for half-planes. Journal of Combinatorial Theory Series A. 119(1). 146–154. 4 indexed citations
7.
Smorodinsky, Shakhar, et al.. (2010). Choosability in geometric hypergraphs. arXiv (Cornell University). 3 indexed citations
8.
Aichholzer, Oswin, Sergey Bereg, Adrian Dumitrescu, et al.. (2009). Compatible geometric matchings. Computational Geometry. 42(6-7). 617–626. 19 indexed citations
9.
Aronov, Boris, Franz Aurenhammer, Ferrán Hurtado, et al.. (2009). Small weak epsilon-nets. Computational Geometry. 42(5). 455–462. 3 indexed citations
10.
Alon, Noga, et al.. (2008). Weak ε-nets and interval chains. Symposium on Discrete Algorithms. 1194–1203. 6 indexed citations
11.
Alon, Noga, et al.. (2008). Weak ε-nets and interval chains. Journal of the ACM. 55(6). 1–32. 14 indexed citations
12.
Chen, Ke, Amos Fiat, Haim Kaplan, et al.. (2007). Online Conflict‐Free Coloring for Intervals. SIAM Journal on Computing. 36(5). 1342–1359. 33 indexed citations
13.
Smorodinsky, Shakhar. (2006). On the chromatic number of some geometric hypergraphs. Symposium on Discrete Algorithms. 316–323. 27 indexed citations
14.
Fiat, Amos, Jiřı́ Matoušek, Elchanan Mossel, et al.. (2005). Online conflict-free coloring for intervals. Symposium on Discrete Algorithms. 545–554. 12 indexed citations
15.
Aronov, Boris, Franz Aurenhammer, Ferrán Hurtado, et al.. (2005). Small weak epsilon nets. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 52–56. 6 indexed citations
16.
Aronov, Boris & Shakhar Smorodinsky. (2005). On geometric permutations induced by lines transversal through a fixed point. Symposium on Discrete Algorithms. 251–256.
17.
Sharir, Micha & Shakhar Smorodinsky. (2003). On neighbors in geometric permutations. Discrete Mathematics. 268(1-3). 327–335. 3 indexed citations
18.
Even, Guy, Zvi Lotker, Dana Ron, & Shakhar Smorodinsky. (2003). Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. 691–700. 18 indexed citations
19.
Har-Peled, Sariel & Shakhar Smorodinsky. (2003). On conflict-free coloring of points and simple regions in the plane. 1 indexed citations
20.
Sharir, Micha, Shakhar Smorodinsky, & Gábor Tardos. (2001). An Improved Bound for k-Sets in Three Dimensions. Discrete & Computational Geometry. 26(2). 195–204. 46 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gézá Tóth Breakdown of academic impact, for papers by Pável Valtr Breakdown of academic impact, for papers by R. Bruce Richter Breakdown of academic impact, for papers by Hubert de Fraysseix Breakdown of academic impact, for papers by Gelasio Salazar Breakdown of academic impact, for papers by János Pach Breakdown of academic impact, for papers by Jeffrey S. Salowe Breakdown of academic impact, for papers by F. Hurtado Breakdown of academic impact, for papers by Jürgen Bokowski Breakdown of academic impact, for papers by Imrich Vrt’o
Rankless by CCL
2026