Shlomi Rubinstein

653 total citations
14 papers, 314 citations indexed

About

Shlomi Rubinstein is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, Shlomi Rubinstein has authored 14 papers receiving a total of 314 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computational Theory and Mathematics, 7 papers in Industrial and Manufacturing Engineering and 5 papers in Computer Networks and Communications. Recurrent topics in Shlomi Rubinstein's work include Complexity and Algorithms in Graphs (7 papers), Optimization and Packing Problems (6 papers) and Optimization and Search Problems (4 papers). Shlomi Rubinstein is often cited by papers focused on Complexity and Algorithms in Graphs (7 papers), Optimization and Packing Problems (6 papers) and Optimization and Search Problems (4 papers). Shlomi Rubinstein collaborates with scholars based in Israel and United States. Shlomi Rubinstein's co-authors include Refael Hassin, Arie Tamir, Esther M. Arkin and Maxim Sviridenko and has published in prestigious journals such as Pacific Journal of Mathematics, Discrete Applied Mathematics and Operations Research Letters.

In The Last Decade

Shlomi Rubinstein

14 papers receiving 280 citations

Peers

Shlomi Rubinstein
Toshihiro Fujito Japan
David Hartvigsen United States
Justin Ward United Kingdom
Chu Min Li France
Magnus Wahlström United Kingdom
Ewald Speckenmeyer Germany
Anil Kamath United States
Stefan Kratsch Germany
Edward F. Grove United States
Glencora Borradaile United States
Toshihiro Fujito Japan
Shlomi Rubinstein
Citations per year, relative to Shlomi Rubinstein Shlomi Rubinstein (= 1×) peers Toshihiro Fujito

Countries citing papers authored by Shlomi Rubinstein

Since Specialization
Citations

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

Fields of papers citing papers by Shlomi Rubinstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Shlomi Rubinstein

This figure shows the co-authorship network connecting the top 25 collaborators of Shlomi Rubinstein. A scholar is included among the top collaborators of Shlomi Rubinstein 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 Shlomi Rubinstein. Shlomi Rubinstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

14 of 14 papers shown
1.
Hassin, Refael & Shlomi Rubinstein. (2006). An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. Information Processing Letters. 98(3). 92–95. 7 indexed citations
2.
Hassin, Refael & Shlomi Rubinstein. (2005). An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics. 154(6). 971–979. 30 indexed citations
3.
Arkin, Esther M., Refael Hassin, Shlomi Rubinstein, & Maxim Sviridenko. (2004). Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica. 39(2). 175–187. 10 indexed citations
4.
Hassin, Refael & Shlomi Rubinstein. (2004). On the complexity of the k-customer vehicle routing problem. Operations Research Letters. 33(1). 71–76. 9 indexed citations
5.
Hassin, Refael & Shlomi Rubinstein. (2003). Approximation algorithms for the metric maximum clustering problem with given cluster sizes. Operations Research Letters. 31(3). 179–184. 3 indexed citations
6.
Hassin, Refael & Shlomi Rubinstein. (2002). Robust Matchings. SIAM Journal on Discrete Mathematics. 15(4). 530–537. 20 indexed citations
7.
Hassin, Refael & Shlomi Rubinstein. (2002). A -approximation algorithm for metric Max TSP. Information Processing Letters. 81(5). 247–251. 20 indexed citations
8.
Hassin, Refael & Shlomi Rubinstein. (2001). Approximation algorithms for maximum linear arrangement. Information Processing Letters. 80(4). 171–177. 5 indexed citations
9.
Hassin, Refael & Shlomi Rubinstein. (2000). Better approximations for max TSP. Information Processing Letters. 75(4). 181–186. 29 indexed citations
10.
Hassin, Refael & Shlomi Rubinstein. (1998). An approximation algorithm for the maximum traveling salesman problem. Information Processing Letters. 67(3). 125–130. 15 indexed citations
11.
Hassin, Refael, Shlomi Rubinstein, & Arie Tamir. (1997). Approximation algorithms for maximum dispersion. Operations Research Letters. 21(3). 133–137. 94 indexed citations
12.
Hassin, Refael & Shlomi Rubinstein. (1997). An approximation algorithm for maximum packing of 3-edge paths. Information Processing Letters. 63(2). 63–67. 15 indexed citations
13.
Hassin, Refael & Shlomi Rubinstein. (1994). Approximations for the maximum acyclic subgraph problem. Information Processing Letters. 51(3). 133–140. 38 indexed citations
14.
Rubinstein, Shlomi, et al.. (1984). Maximal subalgebras ofC∗-crossed products. Pacific Journal of Mathematics. 110(2). 325–333. 19 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 Toshihiro Fujito Breakdown of academic impact, for papers by David Hartvigsen Breakdown of academic impact, for papers by Justin Ward Breakdown of academic impact, for papers by Chu Min Li Breakdown of academic impact, for papers by Magnus Wahlström Breakdown of academic impact, for papers by Ewald Speckenmeyer Breakdown of academic impact, for papers by Anil Kamath Breakdown of academic impact, for papers by Stefan Kratsch Breakdown of academic impact, for papers by Edward F. Grove Breakdown of academic impact, for papers by Glencora Borradaile
Rankless by CCL
2026