2023
"The number of bounded-degree spanning trees" .
R. Yuster.
In: Random Structures and Algorithms 62 (2023), 737-757.
"Sum-distinguishing number of sparse hypergraphs" .
M. Axenovich, Y. Caro, and R. Yuster.
In: European Journal of Combinatorics 112 (2023), 103712.
"Counting homomorphic cycles in degenerate graphs" .
L. Gishboliner, Y. Levanzov, A. Shapira, and R. Yuster.
In: ACM Transactions on Algorithms 19 (2023), 2:1-22.
Proceedings version: roceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), ACM Press (2022), 417-430.
2022
"Ramsey number of 1-subdivisions of transitive tournaments" .
N. Draganić, D. Munhá Correia, B. Sudakov, and R. Yuster.
In: Journal of Combinatorial Theory, Series B 157 (2022), 176–183.
"Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs" .
R. Yuster.
In: Journal of Combinatorial Theory, Series B 153 (2022), 195–222.
"On the quartet distance given partial information" .
S. Snir, O. Weissberg, and R. Yuster.
In: Journal of Graph Theory 100 (2022), 252–-269.
"The covering threshold of a directed acyclic graph by directed acyclic subgraphs" .
R. Yuster.
In: Electronic Journal of Combinatoircs 29 (2022), #4.45.
2019
"On the exact maximum induced density of almost all graphs and their inducibility" .
R. Yuster.
In: Journal of Combinatorial Theory Series B 136 (2019), 81-109.
"The removal lemma for tournaments" .
J. Fox, L. Gishboliner, A. Shapira, and R. Yuster.
In: Journal of Combinatorial Theory Series B 136 (2019), 110-134.
"Vector clique decompositions" .
R. Yuster.
In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), ACM Press (2019), 1221-1238.
"Acyclic subgraphs with high chromatic number" .
S. Nassar and R. Yuster.
In: European Journal of Combinatorics 75 (2019), 11-18.
"Packing without some pieces" .
R. Yuster.
In: Journal of Combinatorics 10 (2019), 1-25.
"Clumsy packings of graphs" . M. Axenovich, A. Kaufmann, and R. Yuster.
In: Electronic Journal of Combinatoircs 26 (2019), #2.39.
2017
"A tournament approach to pattern avoiding matrices" . A. Shapira and R. Yuster.
In: Israel Journal of Mathematics 217 (2017), 477-505.
"On the maximum number of spanning copies of an orientation in a tournament" . R. Yuster.
In: Combinatoircs, Probability, and Computing 26 (2017), 775–796.
"On the longest path of a randomly weighted tournament" . R. Yuster.
In: Discrete Applied Mathematics 230 (2017), 121-132.
"A Ramsey-type result for oriented trees" . R. Yuster.
In: European Journal of Combinatorics 60 (2017), 1-9.
"The effect of edge weights on clique weights" . R. Yuster.
In: Linear Algebra and its Applications 515 (2017), 298--312.
"Ramsey numbers for degree monotone paths" . Y. Caro, R. Yuster, and C. Zarb.
In: Discrete Mathematics 340 (2017), 124--131.
2014
"Edge-disjoint cliques in graphs with high minimum degree" . R. Yuster.
In: SIAM Journal on Discrete Mathematics 28 (2014), 893-910.
"On the compatibility of quartet trees" . N. Alon, S. Snir, and R. Yuster.
In: SIAM Journal on Discrete Mathematics 28 (2014), 1493-1507.
Proceedings version: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), SIAM (2014), 535-545.
"On minimum witnesses for boolean matrix multiplication" . K. Cohen and R. Yuster.
In: Algorithmica 69 (2014), 431-442.
"Forcing k-repetitions in degree sequences" . Y. Caro, A. Shapira, and R. Yuster.
In: Electronic Journal of Combinatoircs 21 (2014), #1.24.
2013
"Packing triangles in regular tournaments" . R. Yuster.
In: Journal of Graph Theory, 74 (2013), 58–66.
"Large feedback arc sets,
high minimum degree subgraphs, and long cycles in Eulerian digraphs" . H. Huang,
J. Ma, A. Shapira, B. Sudakov, R. Yuster.
In: Combinatorics, Probability, and Computing 22 (2013), 859–873.
Slides:
"The Turán number of
sparse spanning graphs" . N. Alon, R. Yuster.
In: Journal of Combinatorial Theory, Series B 103 (2013), 337–343.
Slides:
"Maximum matching in regular
and almost regular graphs" . R. Yuster.
In: Algorithmica 66 (2013), 87–92.
"Approximating the diameter of planar graphs in near linear time" . O. Weimann, R. Yuster.
In: ACM Transactions on Algorithms 12 (2015), Article 12, 13 pp.
Proceedings version: Proceedings of the 40th International Colloquium on Automata, Languages
and Programming (ICALP), Springer Verlag LNCS 7965 (2013), 828-839.
"Edge-disjoint induced subgraphs with given minimum degree" . R. Yuster.
In: Electronic Journal of Combinatoircs 20 (2013), #P53.
Slides:
2012
"The quasi-randomness of hypergraph
cut properties" . A. Shapira, R. Yuster.
In: Random Structures and Algorithms 40 (2012), 105–131.
Slides:
"Approximate shortest paths in
weighted graphs" . R. Yuster.
In: Journal of Computer and System Sciences 78 (2012), 632–637.
"H-packing of k-chromatic
graphs" . R. Yuster.
In: Moscow Journal of Combinatorics and Number Theory 2 (2012), 73–88.
"Dense graphs with a large triangle
cover have a large triangle packing" . R. Yuster.
In: Combinatorics, Probability, and Computing 21 (2012), 952-962.
Slides:
"Approximating the maximum consecutive subsums of a sequence" .
F. Cicalese, E. Laber, O. Weimann, R. Yuster.
In: Theoretical Computer Science 525 (2014), 130-137.
Proceedings version: Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM), Springer Verlag LNCS 7354 (2012), 149-158.
2011
"On graphs and algebraic graphs
not containing cycles of length 4" . N. Alon, H.T. Hall, C. Knauer, R. Pinchasi,
R. Yuster.
In: Journal of Graph Theory 68 (2011), 91–102.
"A shortest cycle for each vertex
of a graph" . R. Yuster.
In: Information Processing Letters 111 (2011), 1057–1061.
"Equitable hypergraph orientations" .
Y. Caro, D. West, R. Yuster.
In: The Electronic Journal of Combinatorics 18 (2011), #P121.
"A linear time approximation
scheme for Maximum Quartet Consistency on sparse sampled inputs" . S. Snir, R.
Yuster.
In: SIAM Journal on Discrete Mathematics 25 (2011), 1722-1736.
Proceedings version: Proceedings of the 14th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX), Springer Verlag LNCS
6845 (2011), 339-350.
"Colorful monochromatic
connectivity" . Y. Caro, R. Yuster.
In: Discrete Mathematics 311 (2011), 1786–1792.
"Distance oracles for vertex-labeled
graphs" . D. Harmelin, A. Levy, O. Weimann, R. Yuster.
In: Proceedings of the 38th International Colloquium on Automata, Languages
and Programming (ICALP), Springer Verlag LNCS 6756 (2011), 490-501.
Slides:
"On the size of dissociated
bases" . V. Lev, R. Yuster.
In: The Electronic Journal of Combinatorics 18 (2011), #P117.
Slides:
2010
"Generating a d -dimensional
linear subspace efficiently" . R. Yuster.
In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), SIAM (2010), 467-470.
Slides:
"Reconstructing approximate phylogenetic
trees from quartet samples" . S. Snir, R. Yuster.
In: SIAM Journal on Computing 41 (2012), 1466–1480.
Proceedings version: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), SIAM (2010), 1035-1044.
Slides:
"Large induced subgraphs with equated
maximum degree" . Y. Caro, R. Yuster.
In: Discrete Mathematics 310 (2010), 742-747.
"The rainbow connection of a
graph is (at most) reciprocal to its minimum degree" . M. Krivelevich, R. Yuster.
In: Journal of Graph Theory 63 (2010), 185-191.
"Single source shortest paths
in H-minor free graphs" . R. Yuster.
In: Theoretical Computer Science 411 (2010), 3042-3047.
"Two-phase algorithms for
the parametric shortest path problem" . S. Chakraborty, E. Fischer, O. Lachish,
R. Yuster.
In: Proceedings of the 27th International Symposium on Theoretical Aspects
of Computer Science (STACS), Dagstuhl Seminar Proceedings (2010), 167-178.
"On the density of a graph and its
blowup" . A. Shapira, R. Yuster.
In: Journal of Combinatorial Theory, Series B 100 (2010), 704-719.
Slides:
"Replacement paths via fast
matrix multiplication" . O. Weimann, R. Yuster.
In: ACM Transactions on Algorithms 9 (2013), Article 14.
Proceedings version: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer
Science (FOCS), IEEE (2010), 655-662.
Slides:
"Matrix sparsification and nested dissection over arbitrary fields" . N. Alon, R. Yuster.
In: Journal of the ACM 60 (2013), Article 25, 18pp.
Proceedings sversion: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer
Science (FOCS), IEEE (2010), 225-234.
Slides:
2009
"Efficient algorithms on sets of permutations,
dominance, and real-weighted APSP" . R. Yuster.
In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), SIAM (2009), 950-957.
Slides:
"Large disjoint subgraphs with the
same order and size" . Y. Caro, R. Yuster.
In: European Journal of Combinatorics 30 (2009), 813-821.
"Hardness and algorithms for
rainbow connectivity" . S. Chakraborty, E. Fischer, A. Matsliah, R. Yuster.
In: Journal of Combinatorial Optimization 21 (2011), 330–347.
Proceedings version: Proceedings of the 26th International Symposium on Theoretical
Aspects of Computer Science (STACS), Dagstuhl Seminar Proceedings (2009), 243-254.
"Multigraphs (only) satisfy
a weak triangle removal lemma" . A. Shapira, R. Yuster.
In: The Electronic Journal of Combinatorics 16 (2009), #N11.
"A comment on Ryser's conjecture
for intersecting hypergraphs" . T. Mansour, C. Song, R. Yuster.
In: Graphs and Combinatorics 25 (2009), 101-109.
"Computing the girth of a planar
graph in O(n log n ) time" . O. Weimann, R. Yuster.
In: SIAM Journal on Discrete Mathematics 24 (2010), 609-616.
Proceedings version: Proceedings of the 36th International Colloquium on
Automata, Languages and Programming (ICALP), Springer Verlag (2009), 764-773.
Slides:
2008
"Rainbow decompositions" .
R. Yuster.
In: Proceedings of the American Mathematical Society 136 (2008), 771-779.
Slides:
"The effect of induced subgraphs
on quasi-randomness" . A. Shapira, R. Yuster.
In: Random Structures and Algorithms 36 (2010), 90-109.
Proceedings version: Proceedings of the 19th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA), ACM Press (2008), 789-798.
Slides:
"Almost given length cycles
in digraphs" . R. Yuster.
In: Graphs and Combinatorics 24 (2008), 59-65.
"All-pairs disjoint paths from a common
ancestor in O(nw ) time" . R. Yuster.
In: Theoretical Computer Science 396 (2008) 145-150.
"On rainbow connection" .
Y. Caro, A. Lev, Y. Roditty, Z. Tuza, R. Yuster.
In: The Electronic Journal of Combinatorics 15 (2008), #R57.
"Quasi-randomness is determined by
the distribution of copies of a fixed graph in equicardinal large sets" . R.
Yuster.
In: Combinatorica 30 (2010), 239-246.
Proceedings version: Proceedings of the 12th International Workshop on Randomization
and Computation (RANDOM), Springer Verlag (2008), 596-601.
Slides:
"Packing transitive triples in a tournament" .
M. Kabiya, R. Yuster.
In: Annals of Combinatorics 12 (2008), 291-306.
Slides:
"Disjoint color-avoiding triangles" .
R. Yuster.
In: SIAM Journal on Discrete Mathematics 23 (2008), 195-204.
"Matrix sparsification for
rank and determinant computations via nested dissection" . R. Yuster.
In: Proceedings of the 49th Annual IEEE Symposium on Foundations
of Computer Science (FOCS), IEEE (2008), 137-145.
Slides:
2007
"Maximum matching in graphs with
an excluded minor" . R. Yuster, U. Zwick.
In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), ACM Press (2007), 108-117.
Slides:
"All pairs bottleneck paths in vertex
weighted graphs" . A. Shapira, R. Yuster, U. Zwick.
In: Algorithmica 59 (2011), 621–633.
Proceedings version: Proceedings of the 18th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA), ACM Press (2007), 978-985.
Slides:
"Remarks on the second neighborhood
problem" . D. Fidler, R. Yuster.
In: Journal of Graph Theory 55 (2007), 208-220.
"All-Pairs bottleneck paths for general
graphs in truly sub-cubic time" . V. Vassilevska, R. Williams, R. Yuster.
In: Theory of Computing 5 (2009), 173-189.
Proceedings version: Proceedings of the 39th ACM Symposium on the Theory
of Computing (STOC), ACM Press (2007), 585-589.
"Packing cliques in graphs with independence
number 2" . R. Yuster.
In: Combinatorics, Probability, and Computing 16 (2007), 805-817.
Slides:
"Almost exact matchings" .
R. Yuster.
In: Algorithmica 63 (2012), 39–50.
Proceedings version: Proceedings of the 10th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX), Springer Verlag (2007),
286-295.
Slides:
"Approximation algorithms and
hardness results for the clique packing problem" . F. Chataigner, G. Manic, Y.
Wakabayashi, R. Yuster.
In: Discrete Applied Mathematics 157 (2009), 1396-1406.
Proceedings version: Proceedings of the 4th European Conference on Combinatorics,
Graph Theory and Applications (EUROCOMB), Electronic Notes in Discrete Mathematics
29 (2007), 397-401.
"Combinatorial and computational
aspects of graph packing and graph decomposition" . R. Yuster.
In: Computer Science Review 1 (2007), 12-26.
"Fast algorithms for Maximum Subset
Matching and All-Pairs Shortest Paths in graphs with a (not so) small vertex cover" .
N. Alon, R. Yuster.
In: Proceedings of the 15th Annual European Symposium on Algorithms (ESA),
Springer Verlag (2007), 175-186.
Slides:
2006
"The number of orientations having
no fixed tournament" . N. Alon, R. Yuster.
In: Combinatorica 26 (2006), 1-16.
Slides:
"Decomposing oriented graphs into
transitive tournaments" . R. Yuster.
In: Discrete Mathematics 306 (2006), 166-170.
"Rainbow H -factors" .
R. Yuster.
In: The Electronic Journal of Combinatorics 13 (2006), #R13.
"A (1-1/e)-approximation algorithm
for the maximum generalized assignment problem with fixed profits" . I. Beniaminy,
Z. Nutov, R. Yuster.
In: Operations Research Letters 34 (2006), 283-288.
"Finding and counting cliques
and independent sets in r -uniform hypergraphs" . R. Yuster.
In: Information Processing Letters 99 (2006), 130-134.
"Finding the smallest H -subgraph
in real weighted graphs and related problems" . V. Vassilevska, R. Williams,
R. Yuster.
In: ACM Transactions on Algorithms 6 (2010), Article 44.
Proceedings version: Proceedings of the 33rd International Colloquium on
Automata, Languages and Programming (ICALP), Springer Verlag (2006), 262-273.
Slides:
"Mean Ramsey-Turan numbers" . R.
Yuster.
In: Journal of Graph Theory 53 (2006), 126-134.
2005
"Integer and fractional packing
of families of graphs" . R. Yuster.
In: Random Structures and Algorithms 26 (2005), 110-118.
Slides:
"Packing 4-cycles in Eulerian
and bipartite Eulerian tournaments with an application to distances in interchange
graphs" . R. Yuster.
In: Annals of Combinatorics 9 (2005), 117-124.
"Approximation algorithms and
hardness results for cycle packing problems" . M. Krivelevich, Z. Nutov, M. Salavatipour,
J. Verstraete, R. Yuster.
In: ACM Transcations on Algorithms 3 (2007), 48:1-48:21.
Proceedings version: "Approximation algorithms for cycle packing problems".
M. Krivelevich, Z. Nutov, R. Yuster. Proceedings of the 16th Annual ACM-SIAM Symposium
on Discrete Algorithms (SODA), ACM Press (2005), 556-561.
Slides:
"Asymptotically optimal Kk
packings of dense graphs via fractional Kk
decompositions" .
R. Yuster.
In: Journal of Combinatorial Theory, Series B 95 (2005), 1-11.
Slides:
"Connected odd dominating sets
in graphs" . Y. Caro, W.F. Klostermeyer, R. Yuster.
In: Discussiones Mathematicae Graph Theory 25 (2005), 225-239.
"Fractional decompositions of
dense hypergraphs" . R. Yuster.
In: Bulletin of the London Mathematical Society 39 (2007), 156-166.
Proceedings version: Proceedings of the 9th International Workshop on Randomization
and Computation (RANDOM), Springer Verlag (2005), 482-493.
Slides:
"Answering distance queries in directed
graphs using fast matrix multiplication" . R. Yuster, U. Zwick.
In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer
Science (FOCS), IEEE (2005), 389-396.
Slides:
"On a hypergraph matching problem" .
N. Alon, R. Yuster.
In: Graphs and Combinatorics 21 (2005), 377-384.
2004
"Detecting short directed cycles using
rectangular matrix multiplication and dynamic programming" . R. Yuster, U. Zwick.
In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), ACM Press (2004), 247-253.
Slides:
"Nowhere 0 mod p dominating sets
in multigraphs" . R. Yuster.
In: Ars Combinatoria 70 (2004), 309-318.
"Some remarks on domination" .
D. Archdeacon, J. Ellis-Monaghan, D. Fisher, D. Froncek, P.C.B. Lam, S. Seager,
B. Wei, R. Yuster.
In: Journal of Graph Theory 46 (2004), 207-210.
"Edge-coloring complete uniform
hypergraphs with many components" . Y. Caro, R. Yuster.
In: Journal of Combinatorial Theory, Series B 91 (2004), 215-227.
"Families of trees decompose the
random graph in an arbitrary way" . R. Yuster.
In: Combinatorics, Probability and Computing 13 (2004), 893-910.
"Dense graphs are antimagic" .
N. Alon, G. Kaplan, A. Lev, Y. Roditty, R. Yuster.
In: Journal of Graph Theory 47 (2004), 297-309.
"Packing directed cycles efficiently" .
Z. Nutov, R. Yuster.
In: Discrete Applied Mathematics (special issue) 155 (2007), 82-91.
Proceedings version: Proceedings of the 29th International Symposium on Mathematical
Foundations of Computer Science (MFCS), Springer Verlag (2004), 310-321.
Slides:
"Fast sparse matrix multiplication" .
R. Yuster, U. Zwick.
In: ACM Transactions on Algorithms 1 (2005), 2-13.
Proceedings version: Proceedings of the 12th Annual European Symposium on
Algorithms (ESA), Springer Verlag (2004), 604-615.
Slides:
"The number of edge-disjoint transitive
triples in a tournament" . R. Yuster.
In: Discrete Mathematics 287 (2004), 187-191.
2003
"Second neighborhood via first
neighborhood in digraphs" . G. Chen, J. Shen, R. Yuster.
In: Annals of Combinatorics 7 (2003), 15-20.
"2-connected graphs with small
2-connected dominating sets" . Y. Caro, R. Yuster.
In: Discrete Mathematics 269 (2003), 265-271.
"A note on graphs without k -connected
subgraphs" . R. Yuster.
In: Ars Combinatoria 67 (2003), 231-235.
"Equitable coloring of k -uniform
hypergraphs" . R. Yuster.
In: SIAM Journal on Discrete Mathematics 16 (2003), 524-532.
"The order of monochromatic subgraphs
with a given minimum degree" . Y. Caro, R. Yuster.
In: The Electronic Journal of Combinatorics 10 (2003), #R32.
"A coding theory bound and zero-sum
square matrices" . N. Alon, S. Litsyn, R. Yuster.
In: Graphs and Combinatorics 19 (2003), 449-457.
"Tiling transitive tournaments
and their blow-ups" . R. Yuster.
In: Order 20 (2003), 121-133.
2001
"Monotone paths in edge-ordered
sparse graphs" . Y. Roditty, B. Shoham, R. Yuster.
In: Discrete Mathematics 226 (2001), 411-417.
"Covering non-uniform hypergraphs" .
E. Boros, Y. Caro, Z. Furedi, R. Yuster.
In: Journal of Combinatorial Theory, Series B 82 (2001), 270-284.
Slides:
"Large monotone paths in graphs
with bounded degree" . R. Yuster.
In: Graphs and Combinatorics 17 (2001), 579-587.
"Orthogonal H -decompositions" .
Y. Caro, R. Yuster.
In: Bulletin of the ICA 33 (2001), 42-48.
2000
"Zero-sum ascending waves" . Y.
Caro, A. Bialostocki, G. Bialostocki, R. Yuster.
In: Journal of Combinatorial Mathematics and Combinatorial Computing 32 (2000),
103-114.
"Intersecting designs" . Y.
Caro, R. Yuster.
In: Journal of Combinatorial Theory, Series A 89 (2000), 113-125.
"Decomposing hypergraphs into simple
hypertrees" . R. Yuster.
In: Combinatorica 20 (2000), 119-140.
Slides:
"Packing and decomposition of graphs
with trees" . R. Yuster.
In: Journal of Combinatorial Theory, Series B 78 (2000), 123-140.
"Connected domination and spanning
trees with many leaves" . Y. Caro, D. West, R. Yuster.
In: SIAM Journal on Discrete Mathematics 13 (2000), 202-211.
"A Turán Type problem concerning
the powers of the degrees of a graph" . Y. Caro, R. Yuster.
In: The Electronic Journal of Combinatorics 7 (2000), #R47.
"Every H -decomposition has
a near-resolvable alternative" . N. Alon, R. Yuster.
In: European Journal of Combinatorics 21 (2000), 839-845.
Slides:
"Arithmetic progressions with
constant weight" . R. Yuster.
In: Discrete Mathematics 224 (2000), 225-237.
"Dominating a family of graphs
with small connected subgraphs" . Y. Caro, R. Yuster.
In: Combinatorics, Probability and Computing 9 (2000), 309-313.
"Graphs with large variance" . Y.
Caro, R. Yuster.
In: Ars Combinatoria 57 (2000), 151-162.
1999
"Orthogonal coloring of graphs" .
Y. Caro, R. Yuster.
In: The Electronic Journal of Combinatorics 6 (1999), #R5.
"Graph decomposition of slim graphs" .
Y. Caro, R. Yuster.
In: Graphs and Combinatorics 15 (1999), 5-19.
"Optimal factorizations of families
of trees" . R. Yuster.
In: Discrete Mathematics 203 (1999), 291-297.
"The uniformity space of hypergraphs
and its applications" . Y. Caro, R. Yuster.
In: Discrete Mathematics 202 (1999), 1-19.
"Decomposing large graphs with
small graphs of high density" . R. Yuster.
In: Journal of Graph Theory 32 (1999) 27-40.
"Orthogonal decomposition and packing
of complete graphs" . Y. Caro, R. Yuster.
In: Journal of Combinatorial Theory, Series A 88 (1999), 93-111.
"Graphs having the local decomposition
property" . Y. Caro, R. Yuster.
In: Ars Combinatoria, 52 (1999), 115-124.
1998
"Linear coloring of graphs" .
R. Yuster.
In: Discrete Mathematics 185 (1998), 293-297.
"Tree decomposition of graphs" .
R. Yuster.
In: Random Structures and Algorithms 12 (1998), 237-251.
"Covering graphs: The covering problem
solved" . Y. Caro, R. Yuster.
In: Journal of Combinatorial Theory, Series A, 83 (1998), 273-282.
"Packing and covering of dense
graphs" . N. Alon, Y. Caro, R. Yuster.
In: Journal of Combinatorial Designs 6 (1998), 451-472.
"The characterization of zero-sum
(mod 2) bipartite Ramsey numbers" . Y. Caro, R. Yuster.
In: Journal of Graph Theory 29 (1998), 151-166.
1997
"Packing Graphs: The packing problem
solved" . Y. Caro, R. Yuster.
In: The Electronic Journal of Combinatorics 4 (1997), #R1.
"A note on packing trees into
complete bipartite graphs" . R. Yuster.
In: Discrete Mathematics 163 (1997), 325-327.
"Efficient covering designs of
the complete graph" . Y. Caro, R. Yuster.
In: The Electronic Journal of Combinatorics 4 (1997), #R10.
"Independent transversals and independent
coverings in sparse partite graphs" . R. Yuster.
In: Combinatorics, Probability and Computing 6 (1997), 115-125.
"Independent transversals in r-partite
graphs" . R. Yuster.
In: Discrete Mathematics 176 (1997), 255-261.
"Recognizing Global occurrence of
local properties" . Y. Caro, R. Yuster.
In: Journal of Complexity 13 (1997), 340-352.
"Packing the edges of a graph by
a prescribed tree with minimum overlap" . N. Alon, Y. Caro, R. Yuster.
In: Journal of Combinatorial Theory, Series B 71 (1997), 144-161.
1994
"Finding even cycles even faster" .
R. Yuster, U. Zwick.
In: SIAM Journal on Discrete Mathematics 10 (1997), 209-222.
Proceedings version: Proceedings of the 21st International Colloquium on
Automata, Languages and Programming (ICALP), Springer Verlag (1994), 532-543.
"Color Coding" . N. Alon, R. Yuster,
U. Zwick.
In: Journal of the ACM 42 (1995), 844-856.
Proceedings version: Proceedings of the 26th ACM Symposium on the Theory
of Computing (STOC), ACM Press (1994), 326-335.
"Finding and counting given length
cycles" . N. Alon, R. Yuster, U. Zwick.
In: Algorithmica 17 (1997), 209-223.
Proceedings version: Proceedings of the 2nd Annual European Symposium on
Algorithms (ESA), Springer Verlag (1994), 354-364.
