Uri Zwick

10.1k total citations · 2 hit papers
151 papers, 4.7k citations indexed

About

Uri Zwick is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Uri Zwick has authored 151 papers receiving a total of 4.7k indexed citations (citations by other indexed papers that have themselves been cited), including 115 papers in Computational Theory and Mathematics, 55 papers in Artificial Intelligence and 48 papers in Computer Networks and Communications. Recurrent topics in Uri Zwick's work include Complexity and Algorithms in Graphs (84 papers), Advanced Graph Theory Research (61 papers) and Optimization and Search Problems (35 papers). Uri Zwick is often cited by papers focused on Complexity and Algorithms in Graphs (84 papers), Advanced Graph Theory Research (61 papers) and Optimization and Search Problems (35 papers). Uri Zwick collaborates with scholars based in Israel, United States and United Kingdom. Uri Zwick's co-authors include Raphael Yuster, Mikkel Thorup, Noga Alon, Eran Halperin, H. R. Chandrasekhar, Liam Roditty, Edith Cohen, R.G. Humphreys, Haim Kaplan and M. Cardona and has published in prestigious journals such as Journal of the ACM, Solid State Communications and Electronics Letters.

In The Last Decade

Uri Zwick

145 papers receiving 4.3k citations

Hit Papers

Color-coding 1977 2026 1993 2009 1995 1977 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Color-coding
    1995 490 citations Raphael Yuster, Uri Zwick et al. profile →
  2. Infrared and Raman spectra of the IV-VI compounds SnS and SnSe
    1977 470 citations Uri Zwick et al. profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Uri Zwick Israel 33 2.5k 1.7k 1.2k 730 578 151 4.7k
Harold N. Gabow United States 35 2.3k 0.9× 1.9k 1.2× 813 0.7× 724 1.0× 421 0.7× 118 4.7k
Kurt Mehlhorn Germany 41 1.9k 0.8× 1.5k 0.9× 1.7k 1.4× 628 0.9× 711 1.2× 273 5.6k
Martin Grohe Germany 32 3.2k 1.3× 1.3k 0.8× 1.2k 1.0× 193 0.3× 459 0.8× 158 4.3k
Derek G. Corneil Canada 30 2.7k 1.1× 1.1k 0.7× 749 0.6× 532 0.7× 231 0.4× 96 4.2k
Michael L. Fredman United States 26 2.0k 0.8× 1.6k 1.0× 1.7k 1.4× 475 0.7× 743 1.3× 56 4.9k
Mikkel Thorup United States 42 2.2k 0.9× 3.7k 2.2× 2.3k 1.9× 995 1.4× 716 1.2× 232 6.3k
David Peleg Israel 51 4.1k 1.6× 5.9k 3.5× 1.6k 1.3× 876 1.2× 319 0.6× 305 8.5k
Shimon Even Israel 33 2.4k 1.0× 2.3k 1.4× 1.7k 1.4× 891 1.2× 239 0.4× 94 5.5k
Paul Seymour United States 53 9.7k 3.9× 3.0k 1.8× 1.0k 0.8× 1.8k 2.4× 248 0.4× 265 11.8k
Alon Itai Israel 34 1.6k 0.7× 2.1k 1.2× 1.4k 1.2× 752 1.0× 195 0.3× 70 4.4k

Countries citing papers authored by Uri Zwick

Since Specialization
Citations

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

Fields of papers citing papers by Uri Zwick

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Uri Zwick

This figure shows the co-authorship network connecting the top 25 collaborators of Uri Zwick. A scholar is included among the top collaborators of Uri Zwick 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 Uri Zwick. Uri Zwick 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.
Kaplan, Haim, et al.. (2018). Improved bounds for multipass pairing heaps and path-balanced binary search trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–13. 2 indexed citations
2.
Hansen, Thomas Dueholm, Mike Paterson, & Uri Zwick. (2014). Improved upper bounds for random-edge and random-jump on abstract cubes. Symposium on Discrete Algorithms. 874–881. 4 indexed citations
3.
Paterson, Mike, Yuval Peres, Mikkel Thorup, Peter Winkler, & Uri Zwick. (2009). Maximum Overhang. American Mathematical Monthly. 116(9). 763–787. 2 indexed citations
4.
Madani, Omid, Mikkel Thorup, & Uri Zwick. (2009). Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. Symposium on Discrete Algorithms. 958–967.
5.
Yuster, Raphael & Uri Zwick. (2007). Maximum matching in graphs with an excluded minor. Symposium on Discrete Algorithms. 108–117. 14 indexed citations
6.
Shapira, A., Raphael Yuster, & Uri Zwick. (2007). All-pairs bottleneck paths in vertex weighted graphs. Symposium on Discrete Algorithms. 978–985. 15 indexed citations
7.
Thorup, Mikkel & Uri Zwick. (2006). Spanners and emulators with sublinear distance errors. Symposium on Discrete Algorithms. 802–809. 51 indexed citations
8.
Dı́az, Josep, Klaus Jansen, Andrea Roli, & Uri Zwick. (2006). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial ... (Lecture Notes in Computer Science). Springer eBooks. 1 indexed citations
9.
Yuster, Raphael & Uri Zwick. (2004). Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. Symposium on Discrete Algorithms. 254–260. 27 indexed citations
10.
Thorup, Mikkel, et al.. (2004). Meldable RAM priority queues and minimum directed spanning trees. Symposium on Discrete Algorithms. 40–48. 1 indexed citations
11.
Battista, Giuseppe Di & Uri Zwick. (2003). Algorithms -- ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003 : proceedings. Springer eBooks. 7 indexed citations
12.
Cohen, Edith, Eran Halperin, Haim Kaplan, & Uri Zwick. (2002). Reachability and distance queries via 2-hop labels. Symposium on Discrete Algorithms. 937–946. 103 indexed citations
13.
Roditty, Liam, Mikkel Thorup, & Uri Zwick. (2002). Roundtrip spanners and roundtrip routing in directed graphs. Symposium on Discrete Algorithms. 844–851. 19 indexed citations
14.
Zwick, Uri. (2002). Computer assisted proof of optimal approximability results. Symposium on Discrete Algorithms. 496–505. 17 indexed citations
15.
Halperin, Eran, et al.. (2002). MAX CUT in cubic graphs. Symposium on Discrete Algorithms. 506–513. 2 indexed citations
16.
Cohen, Edith, Haim Kaplan, & Uri Zwick. (2002). Competitive Analysis of the LRFU Paging Algorithm. Algorithmica. 33(4). 511–516. 11 indexed citations
17.
Chockler, Hana & Uri Zwick. (2001). Which formulae shrink under random restrictions. Symposium on Discrete Algorithms. 702–708. 1 indexed citations
18.
Halperin, Eran, et al.. (2001). Coloring k-colorable graphs using smaller palettes. Symposium on Discrete Algorithms. 319–326. 14 indexed citations
19.
Nayak, Ashwin, Alistair Sinclair, & Uri Zwick. (1998). Spatial codes and the hardness of string folding problems. Symposium on Discrete Algorithms. 639–648. 5 indexed citations
20.
Dubiner, Moshe & Uri Zwick. (1992). Amplification and Percolat ion. 258–267. 8 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 Harold N. Gabow Breakdown of academic impact, for papers by Kurt Mehlhorn Breakdown of academic impact, for papers by Martin Grohe Breakdown of academic impact, for papers by Derek G. Corneil Breakdown of academic impact, for papers by Michael L. Fredman Breakdown of academic impact, for papers by Mikkel Thorup Breakdown of academic impact, for papers by David Peleg Breakdown of academic impact, for papers by Shimon Even Breakdown of academic impact, for papers by Paul Seymour Breakdown of academic impact, for papers by Alon Itai
Rankless by CCL
2026