Raphael Yuster

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 36

Top Venues

Electron. J. Comb.

Discret. Math.

J. Comb. Theory, Ser. B

CoRR

Publications

Raphael Yuster
Packing and Covering a Given Directed Graph in a Directed Graph. SIAM J. Discret. Math. 38 (1) (2024)
Raphael Yuster
Path-monochromatic bounded depth rooted trees in (random) tournaments. Discret. Math. 347 (6) (2024)
Raphael Yuster
Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs. Electron. J. Comb. 31 (1) (2024)
Maria Axenovich, Yair Caro, Raphael Yuster
Sum-distinguishing number of sparse hypergraphs. Eur. J. Comb. 112 (2023)
Raphael Yuster
The number of bounded-degree spanning trees. Random Struct. Algorithms 62 (3) (2023)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms 19 (1) (2023)
Raphael Yuster
Finding and counting small tournaments in large tournaments. CoRR (2023)
Raphael Yuster
-graphs. J. Comb. Theory, Ser. B 153 (2022)
Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory, Ser. B 157 (2022)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. SODA (2022)
Raphael Yuster
The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs. Electron. J. Comb. 29 (4) (2022)
Sagi Snir, Osnat Weissberg, Raphael Yuster
On the quartet distance given partial information. J. Graph Theory 100 (2) (2022)
Sagi Snir, Osnat Weissberg, Raphael Yuster
On the quartet distance given partial information. CoRR (2021)
Raphael Yuster
On Factors of Independent Transversals in $k$-Partite Graphs. Electron. J. Comb. 28 (4) (2021)
Safwat Nassar, Raphael Yuster
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. 35 (2) (2021)
Raphael Yuster
Paths with many shortcuts in tournaments. Discret. Math. 344 (1) (2021)
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs. CoRR (2020)
Yair Caro, Raphael Yuster
Induced subgraphs with many repeated degrees. Discret. Math. 343 (5) (2020)
Raphael Yuster
n algorithm for k-cycle in minor-closed graph families. CoRR (2020)
Raphael Yuster
-cycle in minor-closed graph families. Theor. Comput. Sci. 842 (2020)
Raphael Yuster
Perfect sequence covering arrays. Des. Codes Cryptogr. 88 (3) (2020)
Raphael Yuster
Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs. Electron. J. Comb. 27 (4) (2020)
Oren Weimann, Raphael Yuster
Incremental distance products via faulty shortest paths. Inf. Process. Lett. 161 (2020)
Safwat Nassar, Raphael Yuster
Acyclic subgraphs with high chromatic number. Eur. J. Comb. 75 (2019)
Raphael Yuster
Vector clique decompositions. SODA (2019)
Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster
The removal lemma for tournaments. J. Comb. Theory, Ser. B 136 (2019)
Maria Axenovich, Anika Kaufmann, Raphael Yuster
Clumsy Packings of Graphs. Electron. J. Comb. 26 (2) (2019)
Raphael Yuster
On the exact maximum induced density of almost all graphs and their inducibility. J. Comb. Theory, Ser. B 136 (2019)
Yair Caro, Raphael Yuster
The Effect of Local Majority on Global Majorityin Connected Graphs. Graphs Comb. 34 (6) (2018)
Raphael Yuster
On the Maximum Number of Spanning Copies of an Orientation in a Tournament. Comb. Probab. Comput. 26 (5) (2017)
Yair Caro, Raphael Yuster, Christina Zarb
Ramsey numbers for degree monotone paths. Discret. Math. 340 (2) (2017)
Raphael Yuster
A Ramsey type result for oriented trees. Eur. J. Comb. 60 (2017)
Raphael Yuster
On the longest path of a randomly weighted tournament. Discret. Appl. Math. 230 (2017)
Asaf Shapira, Raphael Yuster
Unavoidable tournaments. J. Comb. Theory, Ser. B 116 (2016)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms 12 (1) (2016)
Yair Caro, Raphael Yuster
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. Graphs Comb. 32 (1) (2016)
Islam Akaria, Raphael Yuster
Packing edge-disjoint triangles in regular and almost regular tournaments. Discret. Math. 338 (2) (2015)
Noga Alon, Sagi Snir, Raphael Yuster
On the Compatibility of Quartet Trees. SIAM J. Discret. Math. 28 (3) (2014)
Yair Caro, Asaf Shapira, Raphael Yuster
Forcing $k$-repetitions in Degree Sequences. Electron. J. Comb. 21 (1) (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525 (2014)
Noga Alon, Sagi Snir, Raphael Yuster
On the compatibility of quartet trees. SODA (2014)
Raphael Yuster
Edge-Disjoint Cliques in Graphs with High Minimum Degree. SIAM J. Discret. Math. 28 (2) (2014)
Keren Cohen, Raphael Yuster
On Minimum Witnesses for Boolean Matrix Multiplication. Algorithmica 69 (2) (2014)
Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Comb. Probab. Comput. 22 (6) (2013)
Raphael Yuster
Packing Triangles in Regular Tournaments. J. Graph Theory 74 (1) (2013)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time. ICALP (1) (2013)
Raphael Yuster
Edge-Disjoint Induced Subgraphs with Given Minimum Degree. Electron. J. Comb. 20 (1) (2013)
Oren Weimann, Raphael Yuster
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Trans. Algorithms 9 (2) (2013)
Raphael Yuster
Maximum Matching in Regular and Almost Regular Graphs. Algorithmica 66 (1) (2013)
Noga Alon, Raphael Yuster
Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60 (4) (2013)
Noga Alon, Raphael Yuster
The Turán number of sparse spanning graphs. J. Comb. Theory, Ser. B 103 (3) (2013)
Sagi Snir, Raphael Yuster
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. SIAM J. Comput. 41 (6) (2012)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM (2012)
Asaf Shapira, Raphael Yuster
The quasi-randomness of hypergraph cut properties. Random Struct. Algorithms 40 (1) (2012)
Raphael Yuster
Almost Exact Matchings. Algorithmica 63 (1-2) (2012)
Raphael Yuster
Approximate shortest paths in weighted graphs. J. Comput. Syst. Sci. 78 (2) (2012)
Raphael Yuster
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing. Comb. Probab. Comput. 21 (6) (2012)
Vsevolod F. Lev, Raphael Yuster
On the Size of Dissociated Bases. Electron. J. Comb. 18 (1) (2011)
Raphael Yuster
A shortest cycle for each vertex of a graph. Inf. Process. Lett. 111 (21-22) (2011)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21 (3) (2011)
Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) (2011)
Sagi Snir, Raphael Yuster
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. APPROX-RANDOM (2011)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time CoRR (2011)
Asaf Shapira, Raphael Yuster, Uri Zwick
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica 59 (4) (2011)
Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
On graphs and algebraic graphs that do not contain cycles of length 4. J. Graph Theory 68 (2) (2011)
Yair Caro, Douglas B. West, Raphael Yuster
Equitable Hypergraph Orientations. Electron. J. Comb. 18 (1) (2011)
Sagi Snir, Raphael Yuster
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. SIAM J. Discret. Math. 25 (4) (2011)
Yair Caro, Raphael Yuster
Colorful monochromatic connectivity. Discret. Math. 311 (16) (2011)
Raphael Yuster
Computing the diameter polynomially faster than APSP CoRR (2010)
Raphael Yuster
Generating a d-dimensional Linear Subspace Efficiently. SODA (2010)
Michael Krivelevich, Raphael Yuster
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63 (3) (2010)
Eldar Fischer, Oded Lachish, Raphael Yuster
Two-phase algorithms for the parametric shortest path problem CoRR (2010)
Virginia Vassilevska, Ryan Williams, Raphael Yuster
-subgraphs in real weighted graphs, with applications. ACM Trans. Algorithms 6 (3) (2010)
Asaf Shapira, Raphael Yuster
On the density of a graph and its blowup. J. Comb. Theory, Ser. B 100 (6) (2010)
Sagi Snir, Raphael Yuster
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. SODA (2010)
Asaf Shapira, Raphael Yuster
The effect of induced subgraphs on quasi-randomness. Random Struct. Algorithms 36 (1) (2010)
Yair Caro, Raphael Yuster
Large induced subgraphs with equated maximum degree. Discret. Math. 310 (4) (2010)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS (2010)
Raphael Yuster
Single source shortest paths in H-minor free graphs. Theor. Comput. Sci. 411 (34-36) (2010)
Raphael Yuster
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Comb. 30 (2) (2010)
Oren Weimann, Raphael Yuster
Computing the Girth of a Planar Graph in O(n logn) Time. SIAM J. Discret. Math. 24 (2) (2010)
Noga Alon, Raphael Yuster
Solving Linear Systems through Nested Dissection. FOCS (2010)
Oren Weimann, Raphael Yuster
Replacement Paths via Fast Matrix Multiplication. FOCS (2010)
Toufik Mansour, Chunwei Song, Raphael Yuster
A Comment on Ryser's Conjecture for Intersecting Hypergraphs. Graphs Comb. 25 (1) (2009)
Virginia Vassilevska, Ryan Williams, Raphael Yuster
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. Theory Comput. 5 (1) (2009)
Oren Weimann, Raphael Yuster
) Time. ICALP (1) (2009)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and Algorithms for Rainbow Connectivity. STACS (2009)
Yair Caro, Raphael Yuster
Large disjoint subgraphs with the same order and size. Eur. J. Comb. 30 (4) (2009)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and Algorithms for Rainbow Connectivity CoRR (2009)
Raphael Yuster
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. SODA (2009)
Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster
Approximation algorithms and hardness results for the clique packing problem. Discret. Appl. Math. 157 (7) (2009)
Asaf Shapira, Raphael Yuster
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. Electron. J. Comb. 16 (1) (2009)
Raphael Yuster
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. FOCS (2008)
Raphael Yuster
) time. Theor. Comput. Sci. 396 (1-3) (2008)
Raphael Yuster
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. APPROX-RANDOM (2008)
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
On Rainbow Connection. Electron. J. Comb. 15 (1) (2008)
Asaf Shapira, Raphael Yuster
The effect of induced subgraphs on quasi-randomness. SODA (2008)
Raphael Yuster
Disjoint Color-Avoiding Triangles. SIAM J. Discret. Math. 23 (1) (2008)
Raphael Yuster
Single source shortest paths in H-minor free graphs CoRR (2008)
Raphael Yuster
Almost Given Length Cycles in Digraphs. Graphs Comb. 24 (1) (2008)

Raphael Yuster.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Raphael Yuster