Shay Solomon

1.1k total citations
52 papers, 384 citations indexed

About

Shay Solomon is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Shay Solomon has authored 52 papers receiving a total of 384 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computational Theory and Mathematics, 22 papers in Computer Graphics and Computer-Aided Design and 15 papers in Computer Networks and Communications. Recurrent topics in Shay Solomon's work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (23 papers) and Computational Geometry and Mesh Generation (22 papers). Shay Solomon is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (23 papers) and Computational Geometry and Mesh Generation (22 papers). Shay Solomon collaborates with scholars based in Israel, United States and United Kingdom. Shay Solomon's co-authors include Michael Elkin, Ofer Neiman, Yefim Dinitz, David Peleg, Moses Charikar, Mingfei Li, T-H. Hubert Chan, Fabrizio Grandoni, Lee-Ad Gottlieb and Sayan Bhattacharya and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Shay Solomon

46 papers receiving 370 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Shay Solomon Israel 9 170 114 93 81 60 52 384
Dror Rawitz Israel 12 233 1.4× 347 3.0× 101 1.1× 56 0.7× 118 2.0× 71 541
Giacomo Zambelli Italy 10 232 1.4× 50 0.4× 51 0.5× 29 0.4× 135 2.3× 24 410
Alexander Ageev Russia 10 209 1.2× 225 2.0× 60 0.6× 43 0.5× 128 2.1× 24 464
Amitabh Basu United States 10 100 0.6× 51 0.4× 35 0.4× 21 0.3× 61 1.0× 45 332
Robert Wilber United States 6 166 1.0× 124 1.1× 94 1.0× 13 0.2× 56 0.9× 11 439
Volker Kaibel Germany 12 203 1.2× 58 0.5× 30 0.3× 25 0.3× 112 1.9× 37 360
Bodo Manthey Germany 10 113 0.7× 86 0.8× 23 0.2× 29 0.4× 72 1.2× 50 346
Wenxun Xing China 12 176 1.0× 86 0.8× 9 0.1× 39 0.5× 208 3.5× 50 466
Ravishankar Krishnaswamy United States 13 80 0.5× 220 1.9× 18 0.2× 51 0.6× 109 1.8× 39 375
Jeffery Westbrook United States 17 356 2.1× 479 4.2× 98 1.1× 56 0.7× 84 1.4× 34 766

Countries citing papers authored by Shay Solomon

Since Specialization
Citations

This map shows the geographic impact of Shay Solomon'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 Shay Solomon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shay Solomon more than expected).

Fields of papers citing papers by Shay Solomon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shay Solomon. 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 Shay Solomon. The network helps show where Shay Solomon may publish in the future.

Co-authorship network of co-authors of Shay Solomon

This figure shows the co-authorship network connecting the top 25 collaborators of Shay Solomon. A scholar is included among the top collaborators of Shay Solomon 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 Shay Solomon. Shay Solomon 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.
Bhattacharya, Sayan, et al.. (2024). Faster $(\Delta+1)$-Edge Coloring: Breaking the $m\sqrt{n}$ Time Barrier. Warwick Research Archive Portal (University of Warwick). 2186–2201. 1 indexed citations
2.
Solomon, Shay, et al.. (2022). Truly Optimal Euclidean Spanners. SIAM Journal on Computing. 54(4). FOCS19–135. 1 indexed citations
3.
Bhattacharya, Sayan, et al.. (2022). Fully Dynamic (Δ +1)-Coloring in O (1) Update Time. ACM Transactions on Algorithms. 18(2). 1–25. 2 indexed citations
4.
Solomon, Shay, et al.. (2021). A Generalized Matching Reconfiguration Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Solomon, Shay, et al.. (2021). Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
6.
Solomon, Shay, et al.. (2020). Light Euclidean Spanners with Steiner Points. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 22. 1 indexed citations
7.
Assadi, Sepehr, Krzysztof Onak, Baruch Schieber, & Shay Solomon. (2019). Fully dynamic maximal independent set with sublinear in n update time. Symposium on Discrete Algorithms. 1919–1936.
8.
Grandoni, Fabrizio, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, & Shay Solomon. (2019). (1 + ε-Approximate incremental matching in constant deterministic amortized time. Symposium on Discrete Algorithms. 1886–1898. 2 indexed citations
9.
Solomon, Shay, et al.. (2018). Improved Dynamic Graph Coloring. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 2 indexed citations
10.
Peleg, David & Shay Solomon. (2016). Dynamic (1 + ε)-approximate matchings: a density-sensitive approach. Symposium on Discrete Algorithms. 712–729. 7 indexed citations
11.
Elkin, Michael & Shay Solomon. (2016). Fast Constructions of Lightweight Spanners for General Graphs. ACM Transactions on Algorithms. 12(3). 1–21. 7 indexed citations
12.
Parter, Merav, David Peleg, & Shay Solomon. (2015). Local-on-Average Distributed Tasks. 220–239. 2 indexed citations
13.
Solomon, Shay. (2014). From hierarchical partitions to hierarchical covers. 363–372. 13 indexed citations
14.
Solomon, Shay. (2014). Euclidean Steiner Shallow-Light Trees. 454–463. 4 indexed citations
15.
Neiman, Ofer & Shay Solomon. (2012). Deterministic Algorithms for Fully Dynamic Maximal Matching. arXiv (Cornell University). 1 indexed citations
16.
Berend, Daniel, et al.. (2012). The Tower of Hanoi problem on Pathh graphs. Discrete Applied Mathematics. 160(10-11). 1465–1483. 3 indexed citations
17.
Solomon, Shay. (2011). An optimal-time construction of sparse Euclidean spanners with tiny diameter. Symposium on Discrete Algorithms. 820–839. 4 indexed citations
18.
Solomon, Shay, et al.. (2008). A Natural Extension of Catalan Numbers. Journal of integer sequences. 11(3). 2 indexed citations
19.
Dinitz, Yefim & Shay Solomon. (2006). Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. Lecture notes in computer science. 36–47. 5 indexed citations
20.
Solomon, Shay, et al.. (1985). Proceedings of the 1985 winter simulation conference. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 26(3). 137–45. 149 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

Rankless by CCL
2026