אודות
Extremal Graph Theory Probabilistic Methods in Combinatorics Combinatorial Algorithms
פרסומים
- Simultaneous separation in bounded degree trees, Snir, S. & Yuster, R., 15 Jul 2026, In: Discrete Applied Mathematics. 387, p. 160-171 12 p.
- Inducibility in H-free graphs and inducibility of Turán graphs, Yuster, R., May 2026, In: Journal of Combinatorial Theory. Series B. 178, p. 1-26 26 p.
- Acyclic subgraphs of digraphs with high chromatic number, Yuster, R., Mar 2026, In: European Journal of Combinatorics. 133, 104323.
- Maintaining a Kingdom in a Tournament, Weimann, O. & Yuster, R., 2026, SOFSEM 2026: Theory and Practice of Computer Science - 51st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2026, Proceedings. Kozik, J. & Wolff, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 347-360 14 p. (Lecture Notes in Computer Science; vol. 16448 LNCS).
- On Tournament Inversion, Yuster, R., Sep 2025, In: Journal of Graph Theory. 110, 1, p. 82-91 10 p.
- Finding and counting small tournaments in large tournaments, Yuster, R., 12 Jan 2025, In: Theoretical Computer Science. 1024, 114911.
- On the Minimum Density of Monotone Subwords, Yuster, R., 2025, In: Electronic Journal of Combinatorics. 32, 1, P1.47.
- Flip colouring of graphs, Caro, Y., Lauri, J., Mifsud, X., Yuster, R. & Zarb, C., Dec 2024, In: Graphs and Combinatorics. 40, 6, 106.
- Path-monochromatic bounded depth rooted trees in (random) tournaments, Yuster, R., Jun 2024, In: Discrete Mathematics. 347, 6, 114022.
- Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs, Yuster, R., 2024, In: Electronic Journal of Combinatorics. 31, 1, P1.67.
- PACKING AND COVERING A GIVEN DIRECTED GRAPH IN A DIRECTED GRAPH, Yuster, R., 2024, In: SIAM Journal on Discrete Mathematics. 38, 1, p. 43-54 12 p.
- Sum-distinguishing number of sparse hypergraphs, Axenovich, M., Caro, Y. & Yuster, R., Aug 2023, In: European Journal of Combinatorics. 112, 103712.
- The number of bounded-degree spanning trees, Yuster, R., May 2023, In: Random Structures and Algorithms. 62, 3, p. 737-757 21 p.
- Counting Homomorphic Cycles in Degenerate Graphs, Gishboliner, L., Levanzov, Y., Shapira, A. & Yuster, R., 20 Feb 2023, In: ACM Transactions on Algorithms. 19, 1, 2.
- Ramsey number of 1-subdivisions of transitive tournaments, Draganić, N., Munhá Correia, D., Sudakov, B. & Yuster, R., Nov 2022, In: Journal of Combinatorial Theory. Series B. 157, p. 176-183 8 p.
- Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs, Yuster, R., Mar 2022, In: Journal of Combinatorial Theory. Series B. 153, p. 195-222 28 p.
- Counting Homomorphic Cycles in Degenerate Graphs, Gishboliner, L., Levanzov, Y., Shapira, A. & Yuster, R., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 417-430 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs, Yuster, R., 2022, In: Electronic Journal of Combinatorics. 29, 4, P4.45.
- Perfect and nearly perfect separation dimension of complete and random graphs, Yuster, R., Nov 2021, In: Journal of Combinatorial Designs. 29, 11, p. 786-805 20 p.
- Dominant tournament families, Yuster, R., 2021, In: Journal of Combinatorics. 12, 2, p. 269-282 14 p.
- On factors of independent transversals in k-partite graphs, Yuster, R., 2021, In: Electronic Journal of Combinatorics. 28, 4, P4.23.
- All feedback ARC sets of a random turn tournament have [n/k] - k + 1 disjoint k-cliques (and this is tight), Nassar, S. & Yuster, R., 2021, In: SIAM Journal on Discrete Mathematics. 35, 2, p. 1460-1477 18 p.
- On the quartet distance given partial information, Snir, S., Weissberg, O. & Yuster, R., 2021, In: Journal of Graph Theory. 100, 2, p. 252-269 18 p.
- Packing without some pieces, Yuster, R., 2019, In: Journal of Combinatorics. 10, 1, p. 1-25 25 p.
- On Zero-Sum and Almost Zero-Sum Subgraphs Over, Caro, Y. & Yuster, R., 2016, In: Graphs and Combinatorics. 32, 1, p. 49-63 15 p.
- Color Coding, Yuster-Yaron, R., Alon, N. & Zwick, U., 2016, Encyclopedia of Algorithms. p. 335-338 4 p.
- Color Coding, Alon, N., Yuster, R. & Zwick, U., 1 Jan 2016, Encyclopedia of Algorithms, Second Edition. Springer New York, p. 335-338 4 p.
- Almost exact matchings, Yuster, R., Jun 2012, In: Algorithmica. 63, 1-2, p. 39-50 12 p.
- H-packing of k-chromatic graphs, Yuster, R., 2012, In: Moscow Journal of Combinatorics and Number Theory. 2, 1, p. 73-88 16 p.
- All-pairs bottleneck paths in vertex weighted graphs, Shapira, A., Yuster, R. & Zwick, U., Apr 2011, In: Algorithmica. 59, 4, p. 621-633 13 p.
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree, Krivelevich, M. & Yuster, R., Mar 2010, In: Journal of Graph Theory. 63, 3, p. 185-191 7 p.
- Generating a d-dimensional linear subspace efficiently, Yuster, R., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 467-470 4 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
- Two-phase algorithms for the parametric shortest path problem, Chakraborty, S., Fischer, E., Lachish, O. & Yuster, R., 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 167-178 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).
- All pairs bottleneck paths and max-min matrix products in truly subcubic time, Vassilevska, V., Williams, R. & Yuster-Yaron, R., 2009, In: Theory of Computing. 5, p. 173–189
- On rainbow connection, Caro, Y., Lev, A., Roditty, Y., Tuza, Z. & Yuster, R., 18 Apr 2008, In: Electronic Journal of Combinatorics. 15, 1 R, R57.
- Almost given length cycles in digraphs, Yuster, R., Feb 2008, In: Graphs and Combinatorics. 24, 1, p. 59-65 7 p.
- Packing cliques in graphs with independence number 2, Yuster, R., Sep 2007, In: Combinatorics Probability and Computing. 16, 5, p. 805-817 13 p.
- Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover, Alon, N. & Yustcr, R., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 175-186 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).
- Maximum matching in graphs with an excluded minor, Yuster, R. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 108-117 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).
- Almost exact matchings, Yuster, R., 2007, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, p. 286-295 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).
- Connected odd dominating sets in graphs, Caro, Y., Klostermeyer, W. F. & Yuster-Yaron, R., 2005, In: Discussiones Mathematicae - Graph Theory. 25, p. 225–239
- Integer and fractional packing of families of graphs, Yuster, R., Jan 2005, In: Random Structures and Algorithms. 26, 1-2, p. 110-118 9 p.
- Second neighborhood via first neigh borhood in digraph, Chen, G., Shen, J. & Yuster-Yaron, R., 2003, In: Annals of Combinatorics. 7., p. 15–20
- The Decomposition Threshold for Bipartite Graphs with Minimum Degree One, Yuster, R., Sep 2002, In: Random Structures and Algorithms. 21, 2, p. 121-134 14 p.
- Orthogonal H-decompositions, Caro, Y. & Yuster-Yaron, R., 2001, In: Bulletin of the Institute of Combinatorics and its Applications. 33, p. 42–48
- Zero-sum ascending waves, Bialostocki, A., Bialostocki, G., Caro, Y. & Yuster-Yaron, R., 2000, In: Journal of Combinatorial Mathematics and Combinatorial Computing. 32, p. 103–114
- Decomposing large graphs with small graphs of high density, Yuster, R., Sep 1999, In: Journal of Graph Theory. 32, 1, p. 27-40 14 p.
- Finding and Counting Given Length Cycles, Alon, N., Yuster, R. & Zwick, U., Mar 1997, In: Algorithmica. 17, 3, p. 209-223 15 p.
- Packing graphs: The packing problem solved, Caro, Y. & Yuster, R., 1997, In: Electronic Journal of Combinatorics. 4, 1, p. XI-XII
- Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs, Alon, N., Yuster, R. & Zwick, U., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 326-335 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).