Theo dõi
Raphael Yuster
Raphael Yuster
University of Haifa
Email được xác minh tại math.haifa.ac.il - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Color-coding
N Alon, R Yuster, U Zwick
Journal of the ACM (JACM) 42 (4), 844-856, 1995
13631995
Finding and counting given length cycles
N Alon, R Yuster, U Zwick
Algorithmica 17 (3), 209-223, 1997
7971997
The algorithmic aspects of the regularity lemma
N Alon, R Yuster, U Zwick
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium …, 1992
4041992
Fast sparse matrix multiplication
R Yuster, U Zwick
ACM Transactions On Algorithms (TALG) 1 (1), 2-13, 2005
3672005
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
3012010
Hardness and algorithms for rainbow connection
S Chakraborty, E Fischer, A Matsliah, R Yuster
Journal of Combinatorial Optimization 21, 330-347, 2011
2652011
On rainbow connection
Y Caro, A Lev, Y Roditty, Z Tuza, R Yuster
the electronic journal of combinatorics 15 (1), R57, 2008
2302008
H-factors in dense graphs
N Alon, R Yuster
Journal of Combinatorial Theory, Series B 66 (2), 269-282, 1996
1881996
Dense graphs are antimagic
N Alon, G Kaplan, A Lev, Y Roditty, R Yuster
Journal of Graph Theory 47 (4), 297-309, 2004
1822004
Finding even cycles even faster
R Yuster, U Zwick
SIAM Journal on Discrete Mathematics 10 (2), 209-222, 1997
1311997
Connected domination and spanning trees with many leaves
Y Caro, DB West, R Yuster
SIAM Journal on Discrete Mathematics 13 (2), 202-211, 2000
1212000
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
1111994
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
R Yuster, U Zwick
SODA 4, 254-260, 2004
1052004
Some remarks on domination
D Archdeacon, J Ellis‐Monaghan, D Fisher, D Froncek, PCB Lam, ...
Journal of Graph Theory 46 (3), 207-210, 2004
1012004
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
902007
The number of edge colorings with no monochromatic triangle
R Yuster
Journal of Graph Theory 21 (4), 441-452, 1996
861996
Combinatorial and computational aspects of graph packing and graph decomposition
R Yuster
Computer Science Review 1 (1), 12-26, 2007
782007
Answering distance queries in directed graphs using fast matrix multiplication
R Yuster, U Zwick
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 389-396, 2005
642005
Replacement paths and distance sensitivity oracles via fast matrix multiplication
O Weimann, R Yuster
ACM Transactions on Algorithms (TALG) 9 (2), 1-13, 2013
632013
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
R Yuster
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
632009
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20