| 2009 |
|---|
| 93 | EE | Raphael Yuster:
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP.
SODA 2009: 950-957 |
| 92 | EE | Sourav Chakraborty,
Eldar Fischer,
Arie Matsliah,
Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity.
STACS 2009: 243-254 |
| 91 | EE | Sourav Chakraborty,
Eldar Fischer,
Arie Matsliah,
Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity
CoRR abs/0902.1255: (2009) |
| 2008 |
|---|
| 90 | EE | Raphael Yuster:
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.
APPROX-RANDOM 2008: 596-601 |
| 89 | EE | Raphael Yuster:
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection.
FOCS 2008: 137-145 |
| 88 | EE | Asaf Shapira,
Raphael Yuster:
The effect of induced subgraphs on quasi-randomness.
SODA 2008: 789-798 |
| 87 | EE | Noga Alon,
Raphael Yuster,
Uri Zwick:
Color Coding.
Encyclopedia of Algorithms 2008 |
| 86 | EE | Raphael Yuster:
Single source shortest paths in H-minor free graphs
CoRR abs/0809.2970: (2008) |
| 85 | EE | Raphael Yuster:
All-pairs disjoint paths from a common ancestor in O~(ninfinit) time.
Theor. Comput. Sci. 396(1-3): 145-150 (2008) |
| 2007 |
|---|
| 84 | EE | Raphael Yuster:
Almost Exact Matchings.
APPROX-RANDOM 2007: 286-295 |
| 83 | EE | Noga Alon,
Raphael Yuster:
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.
ESA 2007: 175-186 |
| 82 | EE | Raphael Yuster,
Uri Zwick:
Maximum matching in graphs with an excluded minor.
SODA 2007: 108-117 |
| 81 | EE | Asaf Shapira,
Raphael Yuster,
Uri Zwick:
All-pairs bottleneck paths in vertex weighted graphs.
SODA 2007: 978-985 |
| 80 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
All-pairs bottleneck paths for general graphs in truly sub-cubic time.
STOC 2007: 585-589 |
| 79 | EE | Michael Krivelevich,
Zeev Nutov,
Mohammad R. Salavatipour,
Jacques Yuster,
Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems.
ACM Transactions on Algorithms 3(4): (2007) |
| 78 | EE | Raphael Yuster:
Packing Cliques in Graphs with Independence Number 2.
Combinatorics, Probability & Computing 16(5): 805-817 (2007) |
| 77 | EE | Raphael Yuster:
Combinatorial and computational aspects of graph packing and graph decomposition.
Computer Science Review 1(1): 12-26 (2007) |
| 76 | EE | Zeev Nutov,
Raphael Yuster:
Packing directed cycles efficiently.
Discrete Applied Mathematics 155(2): 82-91 (2007) |
| 75 | EE | F. Chataigner,
Gordana Manic,
Yoshiko Wakabayashi,
Raphael Yuster:
Approximation algorithms and hardness results for the clique packing problem.
Electronic Notes in Discrete Mathematics 29: 397-401 (2007) |
| 74 | EE | Dror Fidler,
Raphael Yuster:
Remarks on the second neighborhood problem.
Journal of Graph Theory 55(3): 208-220 (2007) |
| 2006 |
|---|
| 73 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.
ICALP (1) 2006: 262-273 |
| 72 | EE | Virginia Vassilevska,
Ryan Williams,
Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications
CoRR abs/cs/0609009: (2006) |
| 71 | EE | Noga Alon,
Raphael Yuster:
The Number Of Orientations Having No Fixed Tournament.
Combinatorica 26(1): 1-16 (2006) |
| 70 | EE | Raphael Yuster:
Decomposing oriented graphs into transitive tournaments.
Discrete Mathematics 306(1): 166-170 (2006) |
| 69 | EE | Raphael Yuster:
Rainbow H-factors.
Electr. J. Comb. 13(1): (2006) |
| 68 | EE | Raphael Yuster:
Finding and counting cliques and independent sets in r-uniform hypergraphs.
Inf. Process. Lett. 99(4): 130-134 (2006) |
| 67 | EE | Raphael Yuster:
Mean Ramsey-Turán numbers.
Journal of Graph Theory 53(2): 126-134 (2006) |
| 66 | EE | Zeev Nutov,
Israel Beniaminy,
Raphael Yuster:
A (1-1/e)-approximation algorithm for the generalized assignment problem.
Oper. Res. Lett. 34(3): 283-288 (2006) |
| 2005 |
|---|
| 65 | EE | Raphael Yuster:
Fractional Decompositions of Dense Hypergraphs.
APPROX-RANDOM 2005: 482-493 |
| 64 | EE | Raphael Yuster,
Uri Zwick:
Answering distance queries in directed graphs using fast matrix multiplication.
FOCS 2005: 389-396 |
| 63 | EE | Michael Krivelevich,
Zeev Nutov,
Raphael Yuster:
Approximation algorithms for cycle packing problems.
SODA 2005: 556-561 |
| 62 | EE | Raphael Yuster,
Uri Zwick:
Fast sparse matrix multiplication.
ACM Transactions on Algorithms 1(1): 2-13 (2005) |
| 61 | EE | Noga Alon,
Raphael Yuster:
On a Hypergraph Matching Problem.
Graphs and Combinatorics 21(4): 377-384 (2005) |
| 60 | EE | Raphael Yuster:
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions.
J. Comb. Theory, Ser. B 95(1): 1-11 (2005) |
| 59 | EE | Raphael Yuster:
Integer and fractional packing of families of graphs.
Random Struct. Algorithms 26(1-2): 110-118 (2005) |
| 2004 |
|---|
| 58 | EE | Raphael Yuster,
Uri Zwick:
Fast Sparse Matrix Multiplication.
ESA 2004: 604-615 |
| 57 | EE | Zeev Nutov,
Raphael Yuster:
Packing Directed Cycles Efficiently.
MFCS 2004: 310-321 |
| 56 | EE | Raphael Yuster,
Uri Zwick:
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
SODA 2004: 254-260 |
| 55 | | Raphael Yuster:
Nowhere 0 mod p dominating sets in multigraphs.
Ars Comb. 70: (2004) |
| 54 | EE | Raphael Yuster:
Families of Trees Decompose the Random Graph in an Arbitrary Way.
Combinatorics, Probability & Computing 37(6): 893-910 (2004) |
| 53 | EE | Raphael Yuster:
The number of edge-disjoint transitive triples in a tournament.
Discrete Mathematics 287(1-3): 187-191 (2004) |
| 52 | EE | Yair Caro,
Raphael Yuster:
Edge coloring complete uniform hypergraphs with many components.
J. Comb. Theory, Ser. B 91(2): 215-227 (2004) |
| 51 | EE | Dan Archdeacon,
Joanna A. Ellis-Monaghan,
D. Fisher,
Dalibor Froncek,
Peter Che Bor Lam,
Suzanne M. Seager,
B. Wei,
Raphael Yuster:
Some remarks on domination.
Journal of Graph Theory 46(3): 207-210 (2004) |
| 50 | EE | Noga Alon,
Gil Kaplan,
Arieh Lev,
Yehuda Roditty,
Raphael Yuster:
Dense graphs are antimagic.
Journal of Graph Theory 47(4): 297-309 (2004) |
| 2003 |
|---|
| 49 | | Raphael Yuster:
A note on graphs without k-connected subgraphs.
Ars Comb. 67: (2003) |
| 48 | EE | Yair Caro,
Raphael Yuster:
2-connected graphs with small 2-connected dominating sets.
Discrete Mathematics 269(1-3): 265-271 (2003) |
| 47 | EE | Yair Caro,
Raphael Yuster:
The Order of Monochromatic Subgraphs with a Given Minimum Degree.
Electr. J. Comb. 10: (2003) |
| 46 | EE | Noga Alon,
Simon Litsyn,
Raphael Yuster:
A Coding Theory Bound and Zero-Sum Square Matrices.
Graphs and Combinatorics 19(4): 449-457 (2003) |
| 45 | EE | Raphael Yuster:
Tiling Transitive Tournaments and Their Blow-ups.
Order 20(2): 121-133 (2003) |
| 44 | EE | Raphael Yuster:
Equitable Coloring of k-Uniform Hypergraphs.
SIAM J. Discrete Math. 16(4): 524-532 (2003) |
| 2002 |
|---|
| 43 | EE | Yair Caro,
Raphael Yuster:
List decomposition of graphs.
Discrete Mathematics 243(1-3): 67-77 (2002) |
| 42 | EE | Jian Shen,
Raphael Yuster:
A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs.
Electr. J. Comb. 9(1): (2002) |
| 41 | EE | Paul Balister,
Yair Caro,
Cecil C. Rousseau,
Raphael Yuster:
Zero-sum Square Matrices.
Eur. J. Comb. 23(5): 489-497 (2002) |
| 40 | EE | Raphael Yuster:
The decomposition threshold for bipartite graphs with minimum degree one.
Random Struct. Algorithms 21(2): 121-134 (2002) |
| 2001 |
|---|
| 39 | EE | Yehuda Roditty,
Barack Shoham,
Raphael Yuster:
Monotone paths in edge-ordered sparse graphs.
Discrete Mathematics 226(1-3): 411-417 (2001) |
| 38 | EE | Raphael Yuster:
Large Monotone Paths in Graphs with Bounded Degree.
Graphs and Combinatorics 17(3): 579-587 (2001) |
| 37 | EE | Endre Boros,
Yair Caro,
Zoltán Füredi,
Raphael Yuster:
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B 82(2): 270-284 (2001) |
| 2000 |
|---|
| 36 | | Yair Caro,
Raphael Yuster:
Graphs with Large Variance.
Ars Comb. 57: (2000) |
| 35 | EE | Raphael Yuster:
Decomposing Hypergraphs into Simple Hypertrees.
Combinatorica 20(1): 119-140 (2000) |
| 34 | | Yair Caro,
Raphael Yuster:
Dominating A Family Of Graphs With Small Connected Subgraphs.
Combinatorics, Probability & Computing 9(4): (2000) |
| 33 | EE | Raphael Yuster:
Arithmetic progressions with constant weight.
Discrete Mathematics 224(1-3): 225-237 (2000) |
| 32 | EE | Yair Caro,
Raphael Yuster:
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.
Electr. J. Comb. 7: (2000) |
| 31 | EE | Noga Alon,
Raphael Yuster:
EveryH-decomposition ofKnhas a Nearly Resolvable Alternative.
Eur. J. Comb. 21(7): 839-845 (2000) |
| 30 | EE | Yair Caro,
Raphael Yuster:
Intersecting Designs.
J. Comb. Theory, Ser. A 89(1): 113-125 (2000) |
| 29 | EE | Raphael Yuster:
Packing and Decomposition of Graphs with Trees.
J. Comb. Theory, Ser. B 78(1): 123-140 (2000) |
| 28 | EE | Yair Caro,
Douglas B. West,
Raphael Yuster:
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discrete Math. 13(2): 202-211 (2000) |
| 1999 |
|---|
| 27 | | Yair Caro,
Raphael Yuster:
Graphs Having the Local Decomposition Property.
Ars Comb. 52: (1999) |
| 26 | EE | Yair Caro,
Raphael Yuster:
The uniformity space of hypergraphs and its applications.
Discrete Mathematics 202(1-3): 1-19 (1999) |
| 25 | EE | Raphael Yuster:
Optimal factorizations of families of trees.
Discrete Mathematics 203(1-3): 291-297 (1999) |
| 24 | EE | Yair Caro,
Raphael Yuster:
Orthogonal Colorings of Graphs.
Electr. J. Comb. 6: (1999) |
| 23 | EE | Yair Caro,
Raphael Yuster:
Orthogonal Decomposition and Packing of Complete Graphs.
J. Comb. Theory, Ser. A 88(1): 93-111 (1999) |
| 1998 |
|---|
| 22 | EE | Raphael Yuster:
Linear coloring of graphs.
Discrete Mathematics 185(1-3): 293-297 (1998) |
| 21 | EE | Yair Caro,
Raphael Yuster:
Covering Graphs: The Covering Problem Solved.
J. Comb. Theory, Ser. A 83(2): 273-282 (1998) |
| 20 | | Raphael Yuster:
Tree decomposition of graphs.
Random Struct. Algorithms 12(3): 237-251 (1998) |
| 1997 |
|---|
| 19 | | Noga Alon,
Raphael Yuster,
Uri Zwick:
Finding and Counting Given Length Cycles.
Algorithmica 17(3): 209-223 (1997) |
| 18 | | Raphael Yuster:
Independent Transversals and Independent Coverings in Sparse Partite Graphs.
Combinatorics, Probability & Computing 6(1): 115-125 (1997) |
| 17 | EE | Raphael Yuster:
On packing trees into complete bipartite graphs.
Discrete Mathematics 163(1-3): 325-327 (1997) |
| 16 | EE | Raphael Yuster:
Independent transversals in r-partite graphs.
Discrete Mathematics 176(1-3): 255-261 (1997) |
| 15 | EE | Yair Caro,
Raphael Yuster:
Efficient Covering Designs of the Complete Graph.
Electr. J. Comb. 4(1): (1997) |
| 14 | EE | Yair Caro,
Raphael Yuster:
Packing Graphs: The packing problem solved.
Electr. J. Comb. 4(1): (1997) |
| 13 | EE | Noga Alon,
Yair Caro,
Raphael Yuster:
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
J. Comb. Theory, Ser. B 71(2): 144-161 (1997) |
| 12 | EE | Yair Caro,
Raphael Yuster:
Recognizing Global Occurrence of Local Properties.
J. Complexity 13(3): 340-352 (1997) |
| 11 | EE | Raphael Yuster,
Uri Zwick:
Finding Even Cycles Even Faster.
SIAM J. Discrete Math. 10(2): 209-222 (1997) |
| 1996 |
|---|
| 10 | EE | Noga Alon,
Raphael Yuster:
H-Factors in Dense Graphs.
J. Comb. Theory, Ser. B 66(2): 269-282 (1996) |
| 1995 |
|---|
| 9 | EE | Noga Alon,
Raphael Yuster,
Uri Zwick:
Color-Coding.
J. ACM 42(4): 844-856 (1995) |
| 8 | | Noga Alon,
Raphael Yuster:
The 123 Theorem and Its Extensions.
J. Comb. Theory, Ser. A 72(2): 322-331 (1995) |
| 1994 |
|---|
| 7 | | Noga Alon,
Raphael Yuster,
Uri Zwick:
Finding and Counting Given Length Cycles (Extended Abstract).
ESA 1994: 354-364 |
| 6 | | Raphael Yuster,
Uri Zwick:
Finding Even Cycles Even Faster.
ICALP 1994: 532-543 |
| 5 | EE | Noga Alon,
Raphael Yuster,
Uri Zwick:
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.
STOC 1994: 326-335 |
| 4 | EE | Noga Alon,
Raphael Yuster,
Uri Zwick:
Color-Coding
Electronic Colloquium on Computational Complexity (ECCC) 1(9): (1994) |
| 3 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms 16(1): 80-109 (1994) |
| 1993 |
|---|
| 2 | | Noga Alon,
Raphael Yuster:
Threshold Functions for H-factors.
Combinatorics, Probability & Computing 2: 137-144 (1993) |
| 1992 |
|---|
| 1 | | Noga Alon,
Richard A. Duke,
Hanno Lefmann,
Vojtech Rödl,
Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
FOCS 1992: 473-481 |
