# Raphael Yuster

• Encyclopedia of Algorithms
• 1994
We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E). Theâ€¦ (More)
• 112
• Algorithmica
• 1997
We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in theâ€¦ (More)
• 55
• 78
• J. Algorithms
• 1994
The Regularity Lemma of SzemerÃ©di is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic.â€¦ (More)
• 34
• J. Comb. Theory, Ser. B
• 1996
The following asymptotic result is proved. For every > 0, and for every positive integer h, there exists an n0 = n0( , h) such that for every graph H with h vertices and for every n > n0, any graph Gâ€¦ (More)
• 26
• ESA
• 2004
Let <i>A</i> and <i>B</i> two <i>n</i>Ã—<i>n</i> matrices over a ring <i>R</i> (e.g., the reals or the integers) each containing at most <i>m</i> nonzero elements. We present a new algorithm thatâ€¦ (More)
• 14
• 22
• J. Comb. Optim.
• 2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted rc(G), is theâ€¦ (More)
• 13
• Electr. J. Comb.
• 2008
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is theâ€¦ (More)
• 11
• Graphs and Combinatorics
• 1992
The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree d â‰¥ Ï‡(H)âˆ’1 Ï‡(H) n contains (1âˆ’ o(1))n/h vertex disjoint copiesâ€¦ (More)
• 8