Raphael Yuster
   HOME

TheInfoList



OR:

Raphael "Raphy" Yuster () is an Israeli mathematician specializing in
combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...
and
graph theory In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph ...
. He is a professor of mathematics at the
University of Haifa The University of Haifa (, ) is a public research university located on Mount Carmel in Haifa, Israel. Founded in 1963 as a branch of the Hebrew University of Jerusalem, the University of Haifa received full academic accreditation as an inde ...
. He is a recipient of the
Nerode Prize The EATCS–IPEC Nerode Prize is a theoretical computer science prize awarded for outstanding research in the area of parameterized complexity, multivariate algorithmics. It is awarded by the European Association for Theoretical Computer Science an ...
for his work on
color-coding In computer science and graph theory, the term color-coding refers to an algorithmic technique which is useful in the discovery of network motifs. For example, it can be used to detect a simple path of length in a given graph. The traditional c ...
, and is also known for the Alon–Yuster conjecture relating the
chromatic number In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain constraints, such as that no two adjacent elements have the same color. Graph coloring i ...
s of graphs to the number of disjoint copies of a smaller graph that can be found in a larger one, later proven by János Komlós, Gábor N. Sárközy, and
Endre Szemerédi Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science a ...
.


Education and career

Yuster was a student at
Tel Aviv University Tel Aviv University (TAU) is a Public university, public research university in Tel Aviv, Israel. With over 30,000 students, it is the largest university in the country. Located in northwest Tel Aviv, the university is the center of teaching and ...
, where he received a bachelor's degree in 1989, a master's degree in 1991, and a Ph.D. in 1995. His doctoral dissertation, ''Non Constructive Graph Theoretic Proofs and Their Algorithmic Aspects'', was supervised by
Noga Alon Noga Alon (; born 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Education and career ...
. He has been a faculty member at the University of Haifa since 2004.


Recognition

With Noga Alon and
Uri Zwick Uri Zwick (Hebrew: אורי צוויק) is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism. With Howard Karloff ...
, Yuster was a recipient of the 2019
Nerode Prize The EATCS–IPEC Nerode Prize is a theoretical computer science prize awarded for outstanding research in the area of parameterized complexity, multivariate algorithmics. It is awarded by the European Association for Theoretical Computer Science an ...
, given for their work on color coding, an application of the
probabilistic method In mathematics, the probabilistic method is a nonconstructive method, primarily used in combinatorics and pioneered by Paul Erdős, for proving the existence of a prescribed kind of mathematical object. It works by showing that if one randomly c ...
to
subgraph isomorphism The term subgraph can refer to: *The security-focused Linux-based Subgraph operating system, see Subgraph (operating system) *Subgraph of a function, see Hypograph (mathematics) *In graph theory In mathematics and computer science, graph theo ...
. His work with Zwick on sparse
matrix multiplication In mathematics, specifically in linear algebra, matrix multiplication is a binary operation that produces a matrix (mathematics), matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the n ...
received the 2023
European Symposium on Algorithms The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer ...
Test-of-Time Award.


Selected publications


See also

*
Rainbow coloring In graph theory, a path in an edge-colored graph is said to be rainbow if no color repeats on it. A graph is said to be rainbow-connected (or rainbow colored) if there is a rainbow path between each pair of its vertices. If there is a rainbow s ...
, the topic of several works by Yuster


References


External links


Home page
* {{DEFAULTSORT:Yuster, Raphael Year of birth missing (living people) Living people Israeli mathematicians Tel Aviv University alumni Academic staff of the University of Haifa