Raphael Yuster

200 papers A* 19A 5B 3Journal 163Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Acyclic subgraphs of digraphs with high chromatic number.
Eur. J. Comb.
Raphael Yuster
2026 J jnl
Inducibility in H-free graphs and inducibility of Turán graphs.
J. Comb. Theory B
Raphael Yuster
2026 B conf
Maintaining a Kingdom in a Tournament.
SOFSEM
Oren Weimann, Raphael Yuster
2026 J jnl
Simultaneous separation in bounded degree trees.
CoRR
Sagi Snir, Raphael Yuster
2026 J jnl
Simultaneous separation in bounded degree trees.
Discret. Appl. Math.
Sagi Snir, Raphael Yuster
2025 J jnl
Finding and counting small tournaments in large tournaments.
Theor. Comput. Sci.
Raphael Yuster
2025 J jnl
On Tournament Inversion.
J. Graph Theory
Raphael Yuster
2025 J jnl
On the Minimum Density of Monotone Subwords.
Electron. J. Comb.
Raphael Yuster
2024 J jnl
Flip colouring of graphs.
Graphs Comb.
Yair Caro, Josef Lauri, Xandru Mifsud, Raphael Yuster, Christina Zarb
2024 J jnl
Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs.
Electron. J. Comb.
Raphael Yuster
2024 J jnl
Packing and Covering a Given Directed Graph in a Directed Graph.
SIAM J. Discret. Math.
Raphael Yuster
2024 J jnl
Path-monochromatic bounded depth rooted trees in (random) tournaments.
Discret. Math.
Raphael Yuster
2023 J jnl
Counting Homomorphic Cycles in Degenerate Graphs.
ACM Trans. Algorithms
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2023 J jnl
Finding and counting small tournaments in large tournaments.
CoRR
Raphael Yuster
2023 J jnl
Sum-distinguishing number of sparse hypergraphs.
Eur. J. Comb.
Maria Axenovich, Yair Caro, Raphael Yuster
2023 J jnl
The number of bounded-degree spanning trees.
Random Struct. Algorithms
Raphael Yuster
2022 A* conf
Counting Homomorphic Cycles in Degenerate Graphs.
SODA
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2022 J jnl
Hamiltonian cycles above expectation in
J. Comb. Theory B
Raphael Yuster
2022 J jnl
On the quartet distance given partial information.
J. Graph Theory
Sagi Snir, Osnat Weissberg, Raphael Yuster
2022 J jnl
Ramsey number of 1-subdivisions of transitive tournaments.
J. Comb. Theory B
Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster
2022 J jnl
The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs.
Electron. J. Comb.
Raphael Yuster
2021 J jnl
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight).
SIAM J. Discret. Math.
Safwat Nassar, Raphael Yuster
2021 J jnl
On Factors of Independent Transversals in $k$-Partite Graphs.
Electron. J. Comb.
Raphael Yuster
2021 J jnl
On the quartet distance given partial information.
CoRR
Sagi Snir, Osnat Weissberg, Raphael Yuster
2021 J jnl
Paths with many shortcuts in tournaments.
Discret. Math.
Raphael Yuster
2020 J jnl
A 2
CoRR
Raphael Yuster
2020 J jnl
A 2
Theor. Comput. Sci.
Raphael Yuster
2020 J jnl
Counting Homomorphic Cycles in Degenerate Graphs.
CoRR
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2020 J jnl
Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs.
Electron. J. Comb.
Raphael Yuster
2020 J jnl
Incremental distance products via faulty shortest paths.
Inf. Process. Lett.
Oren Weimann, Raphael Yuster
2020 J jnl
Induced subgraphs with many repeated degrees.
Discret. Math.
Yair Caro, Raphael Yuster
2020 J jnl
Perfect sequence covering arrays.
Des. Codes Cryptogr.
Raphael Yuster
2019 J jnl
Acyclic subgraphs with high chromatic number.
Eur. J. Comb.
Safwat Nassar, Raphael Yuster
2019 J jnl
Clumsy Packings of Graphs.
Electron. J. Comb.
Maria Axenovich, Anika Kaufmann, Raphael Yuster
2019 J jnl
On the exact maximum induced density of almost all graphs and their inducibility.
J. Comb. Theory B
Raphael Yuster
2019 J jnl
The removal lemma for tournaments.
J. Comb. Theory B
Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster
2019 A* conf
Vector clique decompositions.
SODA
Raphael Yuster
2018 J jnl
The Effect of Local Majority on Global Majorityin Connected Graphs.
Graphs Comb.
Yair Caro, Raphael Yuster
2017 J jnl
A Ramsey type result for oriented trees.
Eur. J. Comb.
Raphael Yuster
2017 J jnl
On the Maximum Number of Spanning Copies of an Orientation in a Tournament.
Comb. Probab. Comput.
Raphael Yuster
2017 J jnl
On the longest path of a randomly weighted tournament.
Discret. Appl. Math.
Raphael Yuster
2017 J jnl
Ramsey numbers for degree monotone paths.
Discret. Math.
Yair Caro, Raphael Yuster, Christina Zarb
2016 J jnl
Approximating the Diameter of Planar Graphs in Near Linear Time.
ACM Trans. Algorithms
Oren Weimann, Raphael Yuster
2016 — ch.
Color Coding.
Encyclopedia of Algorithms
Noga Alon, Raphael Yuster, Uri Zwick
2016 J jnl
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ.
Graphs Comb.
Yair Caro, Raphael Yuster
2016 J jnl
Unavoidable tournaments.
J. Comb. Theory B
Asaf Shapira, Raphael Yuster
2015 J jnl
Packing edge-disjoint triangles in regular and almost regular tournaments.
Discret. Math.
Islam Akaria, Raphael Yuster
2014 J jnl
Approximating the maximum consecutive subsums of a sequence.
Theor. Comput. Sci.
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2014 J jnl
Edge-Disjoint Cliques in Graphs with High Minimum Degree.
SIAM J. Discret. Math.
Raphael Yuster
2014 J jnl
Forcing $k$-repetitions in Degree Sequences.
Electron. J. Comb.
Yair Caro, Asaf Shapira, Raphael Yuster
2014 J jnl
On Minimum Witnesses for Boolean Matrix Multiplication.
Algorithmica
Keren Cohen, Raphael Yuster
2014 J jnl
On the Compatibility of Quartet Trees.
SIAM J. Discret. Math.
Noga Alon, Sagi Snir, Raphael Yuster
2014 A* conf
On the compatibility of quartet trees.
SODA
Noga Alon, Sagi Snir, Raphael Yuster
2013 — conf
Approximating the Diameter of Planar Graphs in Near Linear Time.
ICALP (1)
Oren Weimann, Raphael Yuster
2013 J jnl
Edge-Disjoint Induced Subgraphs with Given Minimum Degree.
Electron. J. Comb.
Raphael Yuster
2013 J jnl
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.
Comb. Probab. Comput.
Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster
2013 J jnl
Matrix sparsification and nested dissection over arbitrary fields.
J. ACM
Noga Alon, Raphael Yuster
2013 J jnl
Maximum Matching in Regular and Almost Regular Graphs.
Algorithmica
Raphael Yuster
2013 J jnl
Packing Triangles in Regular Tournaments.
J. Graph Theory
Raphael Yuster
2013 J jnl
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication.
ACM Trans. Algorithms
Oren Weimann, Raphael Yuster
2013 J jnl
The Turán number of sparse spanning graphs.
J. Comb. Theory B
Noga Alon, Raphael Yuster
2012 J jnl
Almost Exact Matchings.
Algorithmica
Raphael Yuster
2012 J jnl
Approximate shortest paths in weighted graphs.
J. Comput. Syst. Sci.
Raphael Yuster
2012 J jnl
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing.
Comb. Probab. Comput.
Raphael Yuster
2012 B conf
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.
CPM
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2012 J jnl
Reconstructing Approximate Phylogenetic Trees from Quartet Samples.
SIAM J. Comput.
Sagi Snir, Raphael Yuster
2012 J jnl
The quasi-randomness of hypergraph cut properties.
Random Struct. Algorithms
Asaf Shapira, Raphael Yuster
2011 — conf
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs.
APPROX-RANDOM
Sagi Snir, Raphael Yuster
2011 J jnl
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs.
SIAM J. Discret. Math.
Sagi Snir, Raphael Yuster
2011 J jnl
A shortest cycle for each vertex of a graph.
Inf. Process. Lett.
Raphael Yuster
2011 J jnl
All-Pairs Bottleneck Paths in Vertex Weighted Graphs.
Algorithmica
Asaf Shapira, Raphael Yuster, Uri Zwick
2011 J jnl
Approximating the Diameter of Planar Graphs in Near Linear Time
CoRR
Oren Weimann, Raphael Yuster
2011 J jnl
Colorful monochromatic connectivity.
Discret. Math.
Yair Caro, Raphael Yuster
2011 — conf
Distance Oracles for Vertex-Labeled Graphs.
ICALP (2)
Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
2011 J jnl
Equitable Hypergraph Orientations.
Electron. J. Comb.
Yair Caro, Douglas B. West, Raphael Yuster
2011 J jnl
Hardness and algorithms for rainbow connection.
J. Comb. Optim.
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2011 J jnl
On graphs and algebraic graphs that do not contain cycles of length 4.
J. Graph Theory
Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
2011 J jnl
On the Size of Dissociated Bases.
Electron. J. Comb.
Vsevolod F. Lev, Raphael Yuster
2010 J jnl
Computing the Girth of a Planar Graph in O(n logn) Time.
SIAM J. Discret. Math.
Oren Weimann, Raphael Yuster
2010 J jnl
Computing the diameter polynomially faster than APSP
CoRR
Raphael Yuster
2010 J jnl
Finding heaviest
ACM Trans. Algorithms
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2010 A* conf
Generating a d-dimensional Linear Subspace Efficiently.
SODA
Raphael Yuster
2010 J jnl
Large induced subgraphs with equated maximum degree.
Discret. Math.
Yair Caro, Raphael Yuster
2010 J jnl
On the density of a graph and its blowup.
J. Comb. Theory B
Asaf Shapira, Raphael Yuster
2010 J jnl
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets.
Comb.
Raphael Yuster
2010 A* conf
Reconstructing Approximate Phylogenetic Trees from Quartet Samples.
SODA
Sagi Snir, Raphael Yuster
2010 A* conf
Replacement Paths via Fast Matrix Multiplication.
FOCS
Oren Weimann, Raphael Yuster
2010 J jnl
Single source shortest paths in H-minor free graphs.
Theor. Comput. Sci.
Raphael Yuster
2010 A* conf
Solving Linear Systems through Nested Dissection.
FOCS
Noga Alon, Raphael Yuster
2010 J jnl
The effect of induced subgraphs on quasi-randomness.
Random Struct. Algorithms
Asaf Shapira, Raphael Yuster
2010 J jnl
The rainbow connection of a graph is (at most) reciprocal to its minimum degree.
J. Graph Theory
Michael Krivelevich, Raphael Yuster
2010 A conf
Two-phase Algorithms for the Parametric Shortest Path Problem.
STACS
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster
2010 J jnl
Two-phase algorithms for the parametric shortest path problem
CoRR
Eldar Fischer, Oded Lachish, Raphael Yuster
2009 J jnl
A Comment on Ryser's Conjecture for Intersecting Hypergraphs.
Graphs Comb.
Toufik Mansour, Chunwei Song, Raphael Yuster
2009 J jnl
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time.
Theory Comput.
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2009 J jnl
Approximation algorithms and hardness results for the clique packing problem.
Discret. Appl. Math.
Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster
2009 — conf
Computing the Girth of a Planar Graph in
ICALP (1)
Oren Weimann, Raphael Yuster
2009 A* conf
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP.
SODA
Raphael Yuster
2009 J jnl
Hardness and Algorithms for Rainbow Connectivity
CoRR
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2009 A conf
Hardness and Algorithms for Rainbow Connectivity.
STACS
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2009 J jnl
Large disjoint subgraphs with the same order and size.
Eur. J. Comb.
Yair Caro, Raphael Yuster
2009 J jnl
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma.
Electron. J. Comb.
Asaf Shapira, Raphael Yuster
2008 J jnl
All-pairs disjoint paths from a common ancestor in O~(n
Theor. Comput. Sci.
Raphael Yuster
2008 J jnl
Almost Given Length Cycles in Digraphs.
Graphs Comb.
Raphael Yuster
2008 — ch.
Color Coding.
Encyclopedia of Algorithms
Noga Alon, Raphael Yuster, Uri Zwick
2008 J jnl
Disjoint Color-Avoiding Triangles.
SIAM J. Discret. Math.
Raphael Yuster
2008 A* conf
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection.
FOCS
Raphael Yuster
2008 J jnl
On Rainbow Connection.
Electron. J. Comb.
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
2008 — conf
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.
APPROX-RANDOM
Raphael Yuster
2008 J jnl
Single source shortest paths in H-minor free graphs
CoRR
Raphael Yuster
2008 A* conf
The effect of induced subgraphs on quasi-randomness.
SODA
Asaf Shapira, Raphael Yuster
2007 A* conf
All-pairs bottleneck paths for general graphs in truly sub-cubic time.
STOC
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2007 A* conf
All-pairs bottleneck paths in vertex weighted graphs.
SODA
Asaf Shapira, Raphael Yuster, Uri Zwick
2007 — conf
Almost Exact Matchings.
APPROX-RANDOM
Raphael Yuster
2007 J jnl
Approximation algorithms and hardness results for cycle packing problems.
ACM Trans. Algorithms
Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster
2007 J jnl
Approximation algorithms and hardness results for the clique packing problem.
Electron. Notes Discret. Math.
Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster
2007 J jnl
Combinatorial and computational aspects of graph packing and graph decomposition.
Comput. Sci. Rev.
Raphael Yuster
2007 A conf
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.
ESA
Noga Alon, Raphael Yuster
2007 A* conf
Maximum matching in graphs with an excluded minor.
SODA
Raphael Yuster, Uri Zwick
2007 J jnl
Packing Cliques in Graphs with Independence Number 2.
Comb. Probab. Comput.
Raphael Yuster
2007 J jnl
Packing directed cycles efficiently.
Discret. Appl. Math.
Zeev Nutov, Raphael Yuster
2007 J jnl
Remarks on the second neighborhood problem.
J. Graph Theory
Dror Fidler, Raphael Yuster
2006 J jnl
A (1-1/
Oper. Res. Lett.
Zeev Nutov, Israel Beniaminy, Raphael Yuster
2006 J jnl
Decomposing oriented graphs into transitive tournaments.
Discret. Math.
Raphael Yuster
2006 J jnl
Finding and counting cliques and independent sets in r-uniform hypergraphs.
Inf. Process. Lett.
Raphael Yuster
2006 J jnl
Finding heaviest H-subgraphs in real weighted graphs, with applications
CoRR
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2006 — conf
Finding the Smallest
ICALP (1)
Virginia Vassilevska, Ryan Williams, Raphael Yuster
2006 J jnl
Mean Ramsey-Turán numbers.
J. Graph Theory
Raphael Yuster
2006 J jnl
Rainbow H-factors.
Electron. J. Comb.
Raphael Yuster
2006 J jnl
The Number Of Orientations Having No Fixed Tournament.
Comb.
Noga Alon, Raphael Yuster
2005 A* conf
Answering distance queries in directed graphs using fast matrix multiplication.
FOCS
Raphael Yuster, Uri Zwick
2005 A* conf
Approximation algorithms for cycle packing problems.
SODA
Michael Krivelevich, Zeev Nutov, Raphael Yuster
2005 J jnl
Asymptotically optimal
J. Comb. Theory B
Raphael Yuster
2005 J jnl
Connected odd dominating sets in graphs.
Discuss. Math. Graph Theory
Yair Caro, William Klostermeyer, Raphael Yuster
2005 J jnl
Fast sparse matrix multiplication.
ACM Trans. Algorithms
Raphael Yuster, Uri Zwick
2005 — conf
Fractional Decompositions of Dense Hypergraphs.
APPROX-RANDOM
Raphael Yuster
2005 J jnl
Integer and fractional packing of families of graphs.
Random Struct. Algorithms
Raphael Yuster
2005 J jnl
On a Hypergraph Matching Problem.
Graphs Comb.
Noga Alon, Raphael Yuster
2004 J jnl
Dense graphs are antimagic.
J. Graph Theory
Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
2004 A* conf
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
SODA
Raphael Yuster, Uri Zwick
2004 J jnl
Edge coloring complete uniform hypergraphs with many components.
J. Comb. Theory B
Yair Caro, Raphael Yuster
2004 J jnl
Families of Trees Decompose the Random Graph in an Arbitrary Way.
Comb. Probab. Comput.
Raphael Yuster
2004 A conf
Fast Sparse Matrix Multiplication.
ESA
Raphael Yuster, Uri Zwick
2004 J jnl
Nowhere 0 mod p dominating sets in multigraphs.
Ars Comb.
Raphael Yuster
2004 B conf
Packing Directed Cycles Efficiently.
MFCS
Zeev Nutov, Raphael Yuster
2004 J jnl
Some remarks on domination.
J. Graph Theory
Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster
2004 J jnl
The number of edge-disjoint transitive triples in a tournament.
Discret. Math.
Raphael Yuster
2003 J jnl
2-connected graphs with small 2-connected dominating sets.
Discret. Math.
Yair Caro, Raphael Yuster
2003 J jnl
A Coding Theory Bound and Zero-Sum Square Matrices.
Graphs Comb.
Noga Alon, Simon Litsyn, Raphael Yuster
2003 J jnl
A note on graphs without k-connected subgraphs.
Ars Comb.
Raphael Yuster
2003 J jnl
Equitable Coloring of k-Uniform Hypergraphs.
SIAM J. Discret. Math.
Raphael Yuster
2003 J jnl
The Order of Monochromatic Subgraphs with a Given Minimum Degree.
Electron. J. Comb.
Yair Caro, Raphael Yuster
2003 J jnl
Tiling Transitive Tournaments and Their Blow-ups.
Order
Raphael Yuster
2002 J jnl
A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs.
Electron. J. Comb.
Jian Shen, Raphael Yuster
2002 J jnl
List decomposition of graphs.
Discret. Math.
Yair Caro, Raphael Yuster
2002 J jnl
The decomposition threshold for bipartite graphs with minimum degree one.
Random Struct. Algorithms
Raphael Yuster
2002 J jnl
Zero-sum Square Matrices.
Eur. J. Comb.
Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
2001 J jnl
Covering Non-uniform Hypergraphs.
J. Comb. Theory B
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
2001 J jnl
Large Monotone Paths in Graphs with Bounded Degree.
Graphs Comb.
Raphael Yuster
2001 J jnl
Monotone paths in edge-ordered sparse graphs.
Discret. Math.
Yehuda Roditty, Barack Shoham, Raphael Yuster
2000 J jnl
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.
Electron. J. Comb.
Yair Caro, Raphael Yuster
2000 J jnl
Arithmetic progressions with constant weight.
Discret. Math.
Raphael Yuster
2000 J jnl
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discret. Math.
Yair Caro, Douglas B. West, Raphael Yuster
2000 J jnl
Decomposing Hypergraphs into Simple Hypertrees.
Comb.
Raphael Yuster
2000 J jnl
Dominating A Family Of Graphs With Small Connected Subgraphs.
Comb. Probab. Comput.
Yair Caro, Raphael Yuster
2000 J jnl
Every
Eur. J. Comb.
Noga Alon, Raphael Yuster
2000 J jnl
Graphs with Large Variance.
Ars Comb.
Yair Caro, Raphael Yuster
2000 J jnl
Intersecting Designs.
J. Comb. Theory A
Yair Caro, Raphael Yuster
2000 J jnl
Packing and Decomposition of Graphs with Trees.
J. Comb. Theory B
Raphael Yuster
1999 J jnl
Decomposing large graphs with small graphs of high density.
J. Graph Theory
Raphael Yuster
1999 J jnl
Graph Decomposition of Slim Graphs.
Graphs Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Graphs Having the Local Decomposition Property.
Ars Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Optimal factorizations of families of trees.
Discret. Math.
Raphael Yuster
1999 J jnl
Orthogonal Colorings of Graphs.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1999 J jnl
Orthogonal Decomposition and Packing of Complete Graphs.
J. Comb. Theory A
Yair Caro, Raphael Yuster
1999 J jnl
The uniformity space of hypergraphs and its applications.
Discret. Math.
Yair Caro, Raphael Yuster
1998 J jnl
Covering Graphs: The Covering Problem Solved.
J. Comb. Theory A
Yair Caro, Raphael Yuster
1998 J jnl
Linear coloring of graphs.
Discret. Math.
Raphael Yuster
1998 J jnl
The characterization of zero-sum (mod 2) bipartite Ramsey numbers.
J. Graph Theory
Yair Caro, Raphael Yuster
1998 J jnl
Tree decomposition of graphs.
Random Struct. Algorithms
Raphael Yuster
1997 J jnl
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
J. Comb. Theory B
Noga Alon, Yair Caro, Raphael Yuster
1997 J jnl
Efficient Covering Designs of the Complete Graph.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1997 J jnl
Finding Even Cycles Even Faster.
SIAM J. Discret. Math.
Raphael Yuster, Uri Zwick
1997 J jnl
Finding and Counting Given Length Cycles.
Algorithmica
Noga Alon, Raphael Yuster, Uri Zwick
1997 J jnl
Independent Transversals and Independent Coverings in Sparse Partite Graphs.
Comb. Probab. Comput.
Raphael Yuster
1997 J jnl
Independent transversals in r-partite graphs.
Discret. Math.
Raphael Yuster
1997 J jnl
On packing trees into complete bipartite graphs.
Discret. Math.
Raphael Yuster
1997 J jnl
Packing Graphs: The packing problem solved.
Electron. J. Comb.
Yair Caro, Raphael Yuster
1997 J jnl
Recognizing Global Occurrence of Local Properties.
J. Complex.
Yair Caro, Raphael Yuster
1996 J jnl
The number of edge colorings with no monochromatic triangle.
J. Graph Theory
Raphael Yuster
1995 J jnl
Color-Coding.
J. ACM
Noga Alon, Raphael Yuster, Uri Zwick
1995 J jnl
The 123 Theorem and Its Extensions.
J. Comb. Theory A
Noga Alon, Raphael Yuster
1994 J jnl
Color-Coding
Electron. Colloquium Comput. Complex.
Noga Alon, Raphael Yuster, Uri Zwick
1994 A* conf
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.
STOC
Noga Alon, Raphael Yuster, Uri Zwick
1994 A* conf
Finding Even Cycles Even Faster.
ICALP
Raphael Yuster, Uri Zwick
1994 A conf
Finding and Counting Given Length Cycles (Extended Abstract).
ESA
Noga Alon, Raphael Yuster, Uri Zwick
1994 J jnl
The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
1993 J jnl
Threshold Functions for H-factors.
Comb. Probab. Comput.
Noga Alon, Raphael Yuster
1992 J jnl
Almost
Graphs Comb.
Noga Alon, Raphael Yuster
1992 A* conf
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
FOCS
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster