Raphael Yuster
Title
Cited by
Cited by
Year
Color-coding
N Alon, R Yuster, U Zwick
Journal of the ACM (JACM) 42 (4), 844-856, 1995
9751995
Finding and counting given length cycles
N Alon, R Yuster, U Zwick
Algorithmica 17 (3), 209-223, 1997
5381997
The algorithmic aspects of the regularity lemma
N Alon, R Yuster, U Zwick
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium …, 1992
3371992
Fast sparse matrix multiplication
R Yuster, U Zwick
ACM Transactions On Algorithms (TALG) 1 (1), 2-13, 2005
2302005
Hardness and algorithms for rainbow connection
S Chakraborty, E Fischer, A Matsliah, R Yuster
Journal of Combinatorial Optimization 21 (3), 330-347, 2011
2072011
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
M Krivelevich, R Yuster
Journal of Graph Theory 63 (3), 185-191, 2010
2042010
On rainbow connection
Y Caro, A Lev, Y Roditty, Z Tuza, R Yuster
the electronic journal of combinatorics, R57-R57, 2008
1872008
H-factors in dense graphs
N Alon, R Yuster
Journal of Combinatorial Theory, Series B 66 (2), 269-282, 1996
1551996
Dense graphs are antimagic
N Alon, G Kaplan, A Lev, Y Roditty, R Yuster
Journal of Graph Theory 47 (4), 297-309, 2004
1252004
Some remarks on domination
D Archdeacon, J Ellis‐Monaghan, D Fisher, D Froncek, PCB Lam, ...
Journal of Graph Theory 46 (3), 207-210, 2004
852004
Connected domination and spanning trees with many leaves
Y Caro, DB West, R Yuster
SIAM Journal on Discrete Mathematics 13 (2), 202-211, 2000
822000
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
N Alon, R Yuster, U Zwick
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
811994
Finding even cycles even faster
R Yuster, U Zwick
SIAM Journal on Discrete Mathematics 10 (2), 209-222, 1997
801997
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
R Yuster, U Zwick
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
622004
AlmostH-factors in dense graphs
N Alon, R Yuster
Graphs and Combinatorics 8 (2), 95-102, 1992
571992
Approximation algorithms and hardness results for cycle packing problems
M Krivelevich, Z Nutov, MR Salavatipour, JV Yuster, R Yuster
ACM Transactions on Algorithms (TALG) 3 (4), 48, 2007
562007
The number of edge colorings with no monochromatic triangle
R Yuster
Journal of Graph Theory 21 (4), 441-452, 1996
561996
Combinatorial and computational aspects of graph packing and graph decomposition
R Yuster
Computer Science Review 1 (1), 12-26, 2007
552007
Linear coloring of graphs
R Yuster
Discrete Mathematics 185 (1-3), 293-297, 1998
481998
Replacement paths via fast matrix multiplication
O Weimann, R Yuster
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 655-662, 2010
46*2010
The system can't perform the operation now. Try again later.
Articles 1–20