This map shows the geographic impact of Guy Kortsarz'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 Guy Kortsarz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy Kortsarz more than expected).
This network shows the impact of papers produced by Guy Kortsarz. 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 Guy Kortsarz. The network helps show where Guy Kortsarz may publish in the future.
Co-authorship network of co-authors of Guy Kortsarz
This figure shows the co-authorship network connecting the top 25 collaborators of Guy Kortsarz.
A scholar is included among the top collaborators of Guy Kortsarz 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 Guy Kortsarz. Guy Kortsarz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kortsarz, Guy, et al.. (2005). Complete partitions of graphs. Symposium on Discrete Algorithms. 860–869.6 indexed citations
9.
Hajiaghayi, Mohammad Taghi, Guy Kortsarz, & Mohammad R. Salavatipour. (2005). Approximating Buy-at-Bulk k-Steiner trees. DSpace@MIT (Massachusetts Institute of Technology).1 indexed citations
10.
Hajiaghayi, Mohammad Taghi, Guy Kortsarz, & Mohammad R. Salavatipour. (2005). Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. DSpace@MIT (Massachusetts Institute of Technology).4 indexed citations
Gandhi, Rajiv, Eran Halperin, Samir Khuller, Guy Kortsarz, & Aravind Srinivasan. (2003). An improved approximation algorithm for vertex cover with hard capacities (extended abstract). Lecture notes in computer science. 2719. 164–175.2 indexed citations
Elkin, Michael & Guy Kortsarz. (2003). Sublogarithmic approximation for telephone multicast: path out of jungle.. Symposium on Discrete Algorithms. 76–85.15 indexed citations
15.
Halperin, Eran, Guy Kortsarz, & Robert Krauthgamer. (2003). Tight lower bounds for the asymmetric k-center problem. Electronic colloquium on computational complexity. 10.8 indexed citations
Kortsarz, Guy & David Peleg. (1993). On Choosing a Dense Subgraph (Extended Abstract). 692–701.9 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.