Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaphael Yuster
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j145]Raphael Yuster:
Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs. Electron. J. Comb. 31(1) (2024)- [j144]Raphael Yuster:
Path-monochromatic bounded depth rooted trees in (random) tournaments. Discret. Math. 347(6): 114022 (2024) - [j143]Raphael Yuster:
Packing and Covering a Given Directed Graph in a Directed Graph. SIAM J. Discret. Math. 38(1): 43-54 (2024) - 2023
- [j142]Maria Axenovich, Yair Caro, Raphael Yuster:
Sum-distinguishing number of sparse hypergraphs. Eur. J. Comb. 112: 103712 (2023) - [j141]Raphael Yuster:
The number of bounded-degree spanning trees. Random Struct. Algorithms 62(3): 737-757 (2023) - [j140]Lior Gishboliner
, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms 19(1): 2:1-2:22 (2023) - [i11]Raphael Yuster:
Finding and counting small tournaments in large tournaments. CoRR abs/2312.01419 (2023) - 2022
- [j139]Raphael Yuster:
The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs. Electron. J. Comb. 29(4) (2022) - [j138]Raphael Yuster:
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs. J. Comb. Theory B 153: 195-222 (2022) - [j137]Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster:
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory B 157: 176-183 (2022) - [j136]Sagi Snir, Osnat Weissberg, Raphael Yuster:
On the quartet distance given partial information. J. Graph Theory 100(2): 252-269 (2022) - [c34]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. SODA 2022: 417-430 - 2021
- [j135]Raphael Yuster:
On Factors of Independent Transversals in $k$-Partite Graphs. Electron. J. Comb. 28(4) (2021) - [j134]Raphael Yuster:
Paths with many shortcuts in tournaments. Discret. Math. 344(1): 112168 (2021) - [j133]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): 1460-1477 (2021) - [i10]Sagi Snir, Osnat Weissberg, Raphael Yuster:
On the quartet distance given partial information. CoRR abs/2111.13101 (2021) - 2020
- [j132]Raphael Yuster:
Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs. Electron. J. Comb. 27(4): 4 (2020) - [j131]Raphael Yuster:
Perfect sequence covering arrays. Des. Codes Cryptogr. 88(3): 585-593 (2020) - [j130]Yair Caro, Raphael Yuster:
Induced subgraphs with many repeated degrees. Discret. Math. 343(5): 111828 (2020) - [j129]Oren Weimann, Raphael Yuster:
Incremental distance products via faulty shortest paths. Inf. Process. Lett. 161: 105977 (2020) - [j128]Raphael Yuster:
A 2O(k)n algorithm for k-cycle in minor-closed graph families. Theor. Comput. Sci. 842: 74-85 (2020) - [i9]Raphael Yuster:
A 2O(k)n algorithm for k-cycle in minor-closed graph families. CoRR abs/2008.03131 (2020) - [i8]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. CoRR abs/2011.05957 (2020)
2010 – 2019
- 2019
- [j127]Maria Axenovich, Anika Kaufmann, Raphael Yuster:
Clumsy Packings of Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j126]Safwat Nassar, Raphael Yuster:
Acyclic subgraphs with high chromatic number. Eur. J. Comb. 75: 11-18 (2019) - [j125]Raphael Yuster:
On the exact maximum induced density of almost all graphs and their inducibility. J. Comb. Theory B 136: 81-109 (2019) - [j124]Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster:
The removal lemma for tournaments. J. Comb. Theory B 136: 110-134 (2019) - [c33]Raphael Yuster:
Vector clique decompositions. SODA 2019: 1221-1238 - 2018
- [j123]Yair Caro, Raphael Yuster:
The Effect of Local Majority on Global Majorityin Connected Graphs. Graphs Comb. 34(6): 1469-1487 (2018) - 2017
- [j122]Raphael Yuster:
On the Maximum Number of Spanning Copies of an Orientation in a Tournament. Comb. Probab. Comput. 26(5): 775-796 (2017) - [j121]Raphael Yuster:
On the longest path of a randomly weighted tournament. Discret. Appl. Math. 230: 121-132 (2017) - [j120]Yair Caro, Raphael Yuster, Christina Zarb:
Ramsey numbers for degree monotone paths. Discret. Math. 340(2): 124-131 (2017) - [j119]Raphael Yuster:
A Ramsey type result for oriented trees. Eur. J. Comb. 60: 1-9 (2017) - 2016
- [j118]Yair Caro, Raphael Yuster:
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. Graphs Comb. 32(1): 49-63 (2016) - [j117]Asaf Shapira, Raphael Yuster:
Unavoidable tournaments. J. Comb. Theory B 116: 191-207 (2016) - [j116]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms 12(1): 12:1-12:13 (2016) - [r2]Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. Encyclopedia of Algorithms 2016: 335-338 - 2015
- [j115]Islam Akaria, Raphael Yuster:
Packing edge-disjoint triangles in regular and almost regular tournaments. Discret. Math. 338(2): 217-228 (2015) - 2014
- [j114]Keren Cohen, Raphael Yuster:
On Minimum Witnesses for Boolean Matrix Multiplication. Algorithmica 69(2): 431-442 (2014) - [j113]Yair Caro, Asaf Shapira, Raphael Yuster:
Forcing $k$-repetitions in Degree Sequences. Electron. J. Comb. 21(1): 1 (2014) - [j112]Raphael Yuster:
Edge-Disjoint Cliques in Graphs with High Minimum Degree. SIAM J. Discret. Math. 28(2): 893-910 (2014) - [j111]Noga Alon, Sagi Snir, Raphael Yuster:
On the Compatibility of Quartet Trees. SIAM J. Discret. Math. 28(3): 1493-1507 (2014) - [j110]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525: 130-137 (2014) - [c32]Noga Alon, Sagi Snir, Raphael Yuster:
On the compatibility of quartet trees. SODA 2014: 535-545 - 2013
- [j109]Raphael Yuster:
Maximum Matching in Regular and Almost Regular Graphs. Algorithmica 66(1): 87-92 (2013) - [j108]Raphael Yuster:
Edge-Disjoint Induced Subgraphs with Given Minimum Degree. Electron. J. Comb. 20(1): 53 (2013) - [j107]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): 859-873 (2013) - [j106]Noga Alon, Raphael Yuster:
Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4): 25:1-25:18 (2013) - [j105]Noga Alon, Raphael Yuster:
The Turán number of sparse spanning graphs. J. Comb. Theory B 103(3): 337-343 (2013) - [j104]Raphael Yuster:
Packing Triangles in Regular Tournaments. J. Graph Theory 74(1): 58-66 (2013) - [j103]Oren Weimann, Raphael Yuster:
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Trans. Algorithms 9(2): 14:1-14:13 (2013) - [c31]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. ICALP (1) 2013: 828-839 - 2012
- [j102]Raphael Yuster:
Almost Exact Matchings. Algorithmica 63(1-2): 39-50 (2012) - [j101]Raphael Yuster:
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing. Comb. Probab. Comput. 21(6): 952-962 (2012) - [j100]Raphael Yuster:
Approximate shortest paths in weighted graphs. J. Comput. Syst. Sci. 78(2): 632-637 (2012) - [j99]Asaf Shapira, Raphael Yuster:
The quasi-randomness of hypergraph cut properties. Random Struct. Algorithms 40(1): 105-131 (2012) - [j98]Sagi Snir, Raphael Yuster:
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. SIAM J. Comput. 41(6): 1466-1480 (2012) - [c30]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: 149-158 - 2011
- [j97]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. Algorithmica 59(4): 621-633 (2011) - [j96]Yair Caro, Douglas B. West, Raphael Yuster:
Equitable Hypergraph Orientations. Electron. J. Comb. 18(1) (2011) - [j95]Vsevolod F. Lev, Raphael Yuster:
On the Size of Dissociated Bases. Electron. J. Comb. 18(1) (2011) - [j94]Yair Caro, Raphael Yuster:
Colorful monochromatic connectivity. Discret. Math. 311(16): 1786-1792 (2011) - [j93]Raphael Yuster:
A shortest cycle for each vertex of a graph. Inf. Process. Lett. 111(21-22): 1057-1061 (2011) - [j92]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) - [j91]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): 91-102 (2011) - [j90]Sagi Snir, Raphael Yuster:
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. SIAM J. Discret. Math. 25(4): 1722-1736 (2011) - [c29]Sagi Snir, Raphael Yuster:
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. APPROX-RANDOM 2011: 339-350 - [c28]Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster:
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501 - [i7]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. CoRR abs/1112.1116 (2011) - 2010
- [j89]Raphael Yuster:
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Comb. 30(2): 239-246 (2010) - [j88]Yair Caro, Raphael Yuster:
Large induced subgraphs with equated maximum degree. Discret. Math. 310(4): 742-747 (2010) - [j87]Asaf Shapira, Raphael Yuster:
On the density of a graph and its blowup. J. Comb. Theory B 100(6): 704-719 (2010) - [j86]Michael Krivelevich, Raphael Yuster:
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3): 185-191 (2010) - [j85]Asaf Shapira, Raphael Yuster:
The effect of induced subgraphs on quasi-randomness. Random Struct. Algorithms 36(1): 90-109 (2010) - [j84]Oren Weimann, Raphael Yuster:
Computing the Girth of a Planar Graph in O(n logn) Time. SIAM J. Discret. Math. 24(2): 609-616 (2010) - [j83]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications. ACM Trans. Algorithms 6(3): 44:1-44:23 (2010) - [j82]Raphael Yuster:
Single source shortest paths in H-minor free graphs. Theor. Comput. Sci. 411(34-36): 3042-3047 (2010) - [c27]Noga Alon, Raphael Yuster:
Solving Linear Systems through Nested Dissection. FOCS 2010: 225-234 - [c26]Oren Weimann, Raphael Yuster:
Replacement Paths via Fast Matrix Multiplication. FOCS 2010: 655-662 - [c25]Raphael Yuster:
Generating a d-dimensional Linear Subspace Efficiently. SODA 2010: 467-470 - [c24]Sagi Snir, Raphael Yuster:
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. SODA 2010: 1035-1044 - [c23]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS 2010: 167-178 - [i6]Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase algorithms for the parametric shortest path problem. CoRR abs/1001.3749 (2010) - [i5]Raphael Yuster:
Computing the diameter polynomially faster than APSP. CoRR abs/1011.6181 (2010)
2000 – 2009
- 2009
- [j81]Asaf Shapira, Raphael Yuster:
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. Electron. J. Comb. 16(1) (2009) - [j80]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): 1396-1406 (2009) - [j79]Yair Caro, Raphael Yuster:
Large disjoint subgraphs with the same order and size. Eur. J. Comb. 30(4): 813-821 (2009) - [j78]Toufik Mansour, Chunwei Song, Raphael Yuster:
A Comment on Ryser's Conjecture for Intersecting Hypergraphs. Graphs Comb. 25(1): 101-109 (2009) - [j77]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. Theory Comput. 5(1): 173-189 (2009) - [c22]Oren Weimann, Raphael Yuster:
Computing the Girth of a Planar Graph in O(n logn) Time. ICALP (1) 2009: 764-773 - [c21]Raphael Yuster:
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. SODA 2009: 950-957 - [c20]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 - [i4]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. CoRR abs/0902.1255 (2009) - 2008
- [j76]Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008) - [j75]Raphael Yuster:
Almost Given Length Cycles in Digraphs. Graphs Comb. 24(1): 59-65 (2008) - [j74]Raphael Yuster:
Disjoint Color-Avoiding Triangles. SIAM J. Discret. Math. 23(1): 195-204 (2008) - [j73]Raphael Yuster:
All-pairs disjoint paths from a common ancestor in O~(ninfinit) time. Theor. Comput. Sci. 396(1-3): 145-150 (2008) - [c19]Raphael Yuster:
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. APPROX-RANDOM 2008: 596-601 - [c18]Raphael Yuster:
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. FOCS 2008: 137-145 - [c17]Asaf Shapira, Raphael Yuster:
The effect of induced subgraphs on quasi-randomness. SODA 2008: 789-798 - [r1]Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. Encyclopedia of Algorithms 2008 - [i3]Raphael Yuster:
Single source shortest paths in H-minor free graphs. CoRR abs/0809.2970 (2008) - 2007
- [j72]Raphael Yuster:
Packing Cliques in Graphs with Independence Number 2. Comb. Probab. Comput. 16(5): 805-817 (2007) - [j71]Raphael Yuster:
Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1(1): 12-26 (2007) - [j70]Zeev Nutov, Raphael Yuster:
Packing directed cycles efficiently. Discret. Appl. Math. 155(2): 82-91 (2007) - [j69]Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster:
Approximation algorithms and hardness results for the clique packing problem. Electron. Notes Discret. Math. 29: 397-401 (2007) - [j68]Dror Fidler, Raphael Yuster:
Remarks on the second neighborhood problem. J. Graph Theory 55(3): 208-220 (2007) - [j67]Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4): 48 (2007) - [c16]Raphael Yuster:
Almost Exact Matchings. APPROX-RANDOM 2007: 286-295 - [c15]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 - [c14]Raphael Yuster, Uri Zwick:
Maximum matching in graphs with an excluded minor. SODA 2007: 108-117 - [c13]Asaf Shapira, Raphael Yuster, Uri Zwick:
All-pairs bottleneck paths in vertex weighted graphs. SODA 2007: 978-985 - [c12]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
All-pairs bottleneck paths for general graphs in truly sub-cubic time. STOC 2007: 585-589 - 2006
- [j66]Noga Alon, Raphael Yuster:
The Number Of Orientations Having No Fixed Tournament. Comb. 26(1): 1-16 (2006) - [j65]Raphael Yuster:
Rainbow H-factors. Electron. J. Comb. 13(1) (2006) - [j64]Raphael Yuster:
Decomposing oriented graphs into transitive tournaments. Discret. Math. 306(1): 166-170 (2006) - [j63]Raphael Yuster:
Finding and counting cliques and independent sets in r-uniform hypergraphs. Inf. Process. Lett. 99(4): 130-134 (2006) - [j62]Raphael Yuster:
Mean Ramsey-Turán numbers. J. Graph Theory 53(2): 126-134 (2006) - [j61]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) - [c11]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. ICALP (1) 2006: 262-273 - [i2]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications. CoRR abs/cs/0609009 (2006) - 2005
- [j60]Yair Caro, William Klostermeyer, Raphael Yuster:
Connected odd dominating sets in graphs. Discuss. Math. Graph Theory 25(3): 225-239 (2005) - [j59]Noga Alon, Raphael Yuster:
On a Hypergraph Matching Problem. Graphs Comb. 21(4): 377-384 (2005) - [j58]Raphael Yuster:
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions. J. Comb. Theory B 95(1): 1-11 (2005) - [j57]Raphael Yuster:
Integer and fractional packing of families of graphs. Random Struct. Algorithms 26(1-2): 110-118 (2005) - [j56]Raphael Yuster, Uri Zwick:
Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1): 2-13 (2005) - [c10]Raphael Yuster:
Fractional Decompositions of Dense Hypergraphs. APPROX-RANDOM 2005: 482-493 - [c9]Raphael Yuster, Uri Zwick:
Answering distance queries in directed graphs using fast matrix multiplication. FOCS 2005: 389-396 - [c8]