Raphael Yuster

5.6k total citations · 1 hit paper
152 papers, 2.8k citations indexed

About

Raphael Yuster is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Raphael Yuster has authored 152 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 135 papers in Computational Theory and Mathematics, 96 papers in Discrete Mathematics and Combinatorics and 37 papers in Electrical and Electronic Engineering. Recurrent topics in Raphael Yuster's work include Advanced Graph Theory Research (119 papers), Limits and Structures in Graph Theory (96 papers) and Complexity and Algorithms in Graphs (44 papers). Raphael Yuster is often cited by papers focused on Advanced Graph Theory Research (119 papers), Limits and Structures in Graph Theory (96 papers) and Complexity and Algorithms in Graphs (44 papers). Raphael Yuster collaborates with scholars based in Israel, United States and Netherlands. Raphael Yuster's co-authors include Noga Alon, Uri Zwick, Yair Caro, Michael Krivelevich, Y. Roditty, Hanno Lefmann, Richard A. Duke, V. Rödl, Sourav Chakraborty and Eldar Fischer and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Raphael Yuster

146 papers receiving 2.6k citations

Hit Papers

Color-coding 1995 2026 2005 2015 1995 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 Noga Alon, Raphael Yuster 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
Raphael Yuster Israel 23 2.1k 1.0k 567 423 406 152 2.8k
Nicholas Wormald Australia 29 1.4k 0.7× 1.2k 1.2× 472 0.8× 709 1.7× 376 0.9× 145 3.0k
Michael Krivelevich Israel 29 2.2k 1.0× 1.5k 1.5× 501 0.9× 746 1.8× 571 1.4× 203 3.0k
Colin McDiarmid United Kingdom 27 1.4k 0.6× 773 0.7× 367 0.6× 353 0.8× 258 0.6× 150 2.3k
Douglas B. West United States 25 1.8k 0.9× 757 0.7× 582 1.0× 528 1.2× 134 0.3× 231 2.3k
Jaroslav Nešetřil Czechia 32 3.2k 1.5× 1.8k 1.7× 625 1.1× 1.4k 3.3× 435 1.1× 257 4.1k
Jeremy Spinrad United States 22 2.2k 1.0× 474 0.5× 763 1.3× 344 0.8× 344 0.8× 65 2.5k
Derek G. Corneil Canada 30 2.7k 1.3× 485 0.5× 1.1k 1.9× 516 1.2× 749 1.8× 96 4.2k
Benny Sudakov United States 30 2.6k 1.2× 2.4k 2.3× 257 0.5× 1.4k 3.3× 351 0.9× 276 3.5k
Dieter Kratsch France 27 1.9k 0.9× 356 0.3× 756 1.3× 234 0.6× 234 0.6× 132 2.2k
János Komlós United States 35 2.4k 1.1× 1.7k 1.7× 900 1.6× 880 2.1× 1.3k 3.2× 76 4.6k

Countries citing papers authored by Raphael Yuster

Since Specialization
Citations

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

Fields of papers citing papers by Raphael Yuster

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Raphael Yuster

This figure shows the co-authorship network connecting the top 25 collaborators of Raphael Yuster. A scholar is included among the top collaborators of Raphael Yuster 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 Raphael Yuster. Raphael Yuster 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.
Axenovich, Maria, Yair Caro, & Raphael Yuster. (2023). Sum-distinguishing number of sparse hypergraphs. European Journal of Combinatorics. 112. 103712–103712. 1 indexed citations
2.
Shapira, A. & Raphael Yuster. (2015). Unavoidable tournaments. Journal of Combinatorial Theory Series B. 116. 191–207. 2 indexed citations
3.
Alon, Noga & Raphael Yuster. (2013). The Turán number of sparse spanning graphs. Journal of Combinatorial Theory Series B. 103(3). 337–343. 4 indexed citations
4.
Yuster, Raphael. (2011). Approximate shortest paths in weighted graphs. Journal of Computer and System Sciences. 78(2). 632–637. 6 indexed citations
5.
Yuster, Raphael. (2010). Generating a d-dimensional linear subspace efficiently. Symposium on Discrete Algorithms. 467–470. 4 indexed citations
6.
Yuster, Raphael. (2010). Single source shortest paths in H-minor free graphs. Theoretical Computer Science. 411(34-36). 3042–3047. 3 indexed citations
7.
Yuster, Raphael. (2009). Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. Symposium on Discrete Algorithms. 950–957. 5 indexed citations
8.
Vassilevska, Virginia, Ryan Williams, & Raphael Yuster. (2009). . Theory of Computing. 5(1). 173–189. 9 indexed citations
9.
Alon, Noga & Raphael Yuster. (2008). Every H-decomposition of Kn has a nearly resolvable alternative. 2 indexed citations
10.
Yuster, Raphael & Uri Zwick. (2007). Maximum matching in graphs with an excluded minor. Symposium on Discrete Algorithms. 108–117. 14 indexed citations
11.
Shapira, A., Raphael Yuster, & Uri Zwick. (2007). All-pairs bottleneck paths in vertex weighted graphs. Symposium on Discrete Algorithms. 978–985. 15 indexed citations
12.
Vassilevska, Virginia, Ryan Williams, & Raphael Yuster. (2006). Finding the smallest H-subgraph in real weighted graphs and related problems. 4 indexed citations
13.
Krivelevich, Michael, Zeev Nutov, & Raphael Yuster. (2005). Approximation algorithms for cycle packing problems. Symposium on Discrete Algorithms. 556–561. 8 indexed citations
14.
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
15.
Yuster, Raphael. (2003). A note on graphs without k-connected subgraphs.. Ars Combinatoria. 67. 5 indexed citations
16.
Yuster, Raphael. (2001). Graphs with Minimum Degree Three are Totally Dominated by Half of the Vertices. SSRN Electronic Journal. 1 indexed citations
17.
Caro, Yair & Raphael Yuster. (2000). Graphs with Large Variance.. Ars Combinatoria. 57. 10 indexed citations
18.
Yuster, Raphael. (1997). On packing trees into complete bipartite graphs. Discrete Mathematics. 163(1-3). 325–327. 9 indexed citations
19.
Yuster, Raphael. (1997). Independent transversals in r-partite graphs. Discrete Mathematics. 176(1-3). 255–261. 24 indexed citations
20.
Alon, Noga, Richard A. Duke, Hanno Lefmann, Vojtěch Rödl, & Raphael Yuster. (1992). The Algorithmic Aspects of the Regularity Lemma (Extended Abstract). 473–481. 5 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 Nicholas Wormald Breakdown of academic impact, for papers by Michael Krivelevich Breakdown of academic impact, for papers by Colin McDiarmid Breakdown of academic impact, for papers by Douglas B. West Breakdown of academic impact, for papers by Jaroslav Nešetřil Breakdown of academic impact, for papers by Jeremy Spinrad Breakdown of academic impact, for papers by Derek G. Corneil Breakdown of academic impact, for papers by Benny Sudakov Breakdown of academic impact, for papers by Dieter Kratsch Breakdown of academic impact, for papers by János Komlós
Rankless by CCL
2026