World's Best Scientists 2026 revealed!
Raphael Yuster

Raphael Yuster

D-Index & Metrics

Mathematics

D-Index
36
Citations
7853
World Ranking
2593
National Ranking
44

Engineering and Technology

D-Index
36
Citations
7852
World Ranking
8577
National Ranking
64

Overview

Raphael Yuster is affiliated with the University of Haifa in Israel. Their research spans the fields of Computer Science and Mathematics, focusing primarily on Computational Theory and Mathematics, as well as Discrete Mathematics and Combinatorics. Other subfields include Geometry and Topology, Electrical and Electronic Engineering, and Artificial Intelligence.

The main topics covered in Yuster's work include:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Complexity and Algorithms in Graphs
  • Graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • Markov Chains and Monte Carlo Methods

Yuster has published extensively in several academic venues. The most frequent publication platforms include:

  • arXiv (Cornell University)
  • The Electronic Journal of Combinatorics
  • Discrete Mathematics
  • Journal of Combinatorial Theory Series B
  • Journal of Graph Theory

Selected recent papers by Yuster are:

  • "Ramsey number of 1-subdivisions of transitive tournaments" (2022), Journal of Combinatorial Theory Series B
  • "Paths with many shortcuts in tournaments" (2020), Discrete Mathematics
  • "Sum-distinguishing number of sparse hypergraphs" (2023), European Journal of Combinatorics
  • "Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs" (2020), The Electronic Journal of Combinatorics
  • "Counting Homomorphic Cycles in Degenerate Graphs" (2022), ACM Transactions on Algorithms

Frequent coauthors collaborating with Yuster include:

  • Yair Caro
  • Lior Gishboliner
  • Yevgeny Levanzov
  • A. Shapira
  • Nemanja Draganić

Best Publications

  • Color-coding

    Noga Alon;Raphael Yuster;Uri Zwick

  • Finding and counting given length cycles

    Noga Alon;Raphael Yuster;Uri Zwick

  • The algorithmic aspects of the regularity lemma

    N. Alon;R. A. Duke;H. Lefmann;V. Rödl

  • The algorithmic aspects of the regularity lemma

    N. Alon

  • Fast sparse matrix multiplication

    Raphael Yuster;Uri Zwick

  • The rainbow connection of a graph is (at most) reciprocal to its minimum degree

    Unknown

  • Hardness and algorithms for rainbow connection

    Sourav Chakraborty;Eldar Fischer;Arie Matsliah;Raphael Yuster

  • The rainbow connection of a graph is (at most) reciprocal to its minimum degree

    Michael Krivelevich;Raphael Yuster

  • On Rainbow Connection

    Yair Caro;Arieh Lev;Yehuda Roditty;Zsolt Tuza

  • H-Factors in Dense Graphs

    Noga Alon;Raphael Yuster

  • Dense graphs are antimagic

    N. Alon;G. Kaplan;A. Lev;Y. Roditty

  • Connected Domination and Spanning Trees with Many Leaves

    Yair Caro;Douglas B. West;Raphael Yuster

  • Finding Even Cycles Even Faster

    Raphael Yuster;Uri Zwick

  • Some remarks on domination

    D. Archdeacon;J. Ellis-Monaghan;D. Fisher;D. Froncek

  • Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

    Noga Alon;Raphy Yuster;Uri Zwick

  • Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

    Raphael Yuster

  • Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

    Raphael Yuster;Uri Zwick

  • Some remarks on domination: SOME REMARKS ON DOMINATION

    D. Archdeacon;J. Ellis-Monaghan;D. Fisher;D. Froncek

  • AlmostH-factors in dense graphs

    Noga Alon;Raphael Yuster

  • A (1-1/e)-approximation algorithm for the generalized assignment problem

    Zeev Nutov;Israel Beniaminy;Raphael Yuster

  • Hardness and Algorithms for Rainbow Connectivity

    Sourav Chakraborty;Eldar Fischer;Arie Matsliah;Raphael Yuster

  • Dense graphs are antimagic

    N. Alon;G. Kaplan;A. Lev;Y. Roditty

Frequent Co-Authors

Noga Alon
Noga Alon Tel Aviv University
Uri Zwick
Uri Zwick Tel Aviv University
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Douglas B. West
Douglas B. West University of Illinois at Urbana-Champaign
Jacob Fox
Jacob Fox Stanford University
Toufik Mansour
Toufik Mansour University of Haifa
Benny Sudakov
Benny Sudakov ETH Zurich
Simon Litsyn
Simon Litsyn Tel Aviv University
Zoltán Füredi
Zoltán Füredi University of Illinois at Urbana-Champaign

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to diverse career paths, often complemented by advanced degrees in related fields. For professionals aiming to enhance their finance expertise, pursuing the cheapest online master's in finance offers an affordable way to gain critical financial modeling and analytical skills.

For those interested in leadership and business management, exploring shortest online MBA degree programs is ideal for gaining essential business acumen without a lengthy commitment. These programs often provide flexibility for working professionals while delivering comprehensive curricula.

Marketing professionals with a quantitative background may find pursuing an MS in digital marketing degree cost tuition fees valuable. This degree bridges the gap between mathematical analysis and digital strategy, equipping graduates to excel in data-driven marketing roles.

For students aiming to complete advanced business education swiftly, year long MBA programs offer an intensive yet effective option to build leadership skills and advance careers in various industries.

Best Scientists Citing Raphael Yuster

Trending Scientists