| 2026 | SOFSEM | Maintaining a Kingdom in a Tournament. | Oren Weimann, Raphael Yuster |
| 2022 | SODA | Counting Homomorphic Cycles in Degenerate Graphs. | Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster |
| 2019 | SODA | Vector clique decompositions. | Raphael Yuster |
| 2014 | SODA | On the compatibility of quartet trees. | Noga Alon, Sagi Snir, Raphael Yuster |
| 2013 | ICALP | Approximating the Diameter of Planar Graphs in Near Linear Time. | Oren Weimann, Raphael Yuster |
| 2012 | CPM | Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. | Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster |
| 2011 | ICALP | Distance Oracles for Vertex-Labeled Graphs. | Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster |
| 2010 | FOCS | Solving Linear Systems through Nested Dissection. | Noga Alon, Raphael Yuster |
| 2010 | FOCS | Replacement Paths via Fast Matrix Multiplication. | Oren Weimann, Raphael Yuster |
| 2010 | SODA | Reconstructing Approximate Phylogenetic Trees from Quartet Samples. | Sagi Snir, Raphael Yuster |
| 2010 | SODA | Generating a d-dimensional Linear Subspace Efficiently. | Raphael Yuster |
| 2010 | STACS | Two-phase Algorithms for the Parametric Shortest Path Problem. | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster |
| 2009 | ICALP | Computing the Girth of a Planar Graph in | Oren Weimann, Raphael Yuster |
| 2009 | SODA | Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. | Raphael Yuster |
| 2009 | STACS | Hardness and Algorithms for Rainbow Connectivity. | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
| 2008 | FOCS | Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. | Raphael Yuster |
| 2008 | SODA | The effect of induced subgraphs on quasi-randomness. | Asaf Shapira, Raphael Yuster |
| 2007 | ESA | Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. | Noga Alon, Raphael Yuster |
| 2007 | SODA | All-pairs bottleneck paths in vertex weighted graphs. | Asaf Shapira, Raphael Yuster, Uri Zwick |
| 2007 | SODA | Maximum matching in graphs with an excluded minor. | Raphael Yuster, Uri Zwick |
| 2007 | STOC | All-pairs bottleneck paths for general graphs in truly sub-cubic time. | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
| 2006 | ICALP | Finding the Smallest | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
| 2005 | FOCS | Answering distance queries in directed graphs using fast matrix multiplication. | Raphael Yuster, Uri Zwick |
| 2005 | SODA | Approximation algorithms for cycle packing problems. | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
| 2004 | ESA | Fast Sparse Matrix Multiplication. | Raphael Yuster, Uri Zwick |
| 2004 | MFCS | Packing Directed Cycles Efficiently. | Zeev Nutov, Raphael Yuster |
| 2004 | SODA | Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. | Raphael Yuster, Uri Zwick |
| 1994 | ESA | Finding and Counting Given Length Cycles (Extended Abstract). | Noga Alon, Raphael Yuster, Uri Zwick |
| 1994 | ICALP | Finding Even Cycles Even Faster. | Raphael Yuster, Uri Zwick |
| 1994 | STOC | Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. | Noga Alon, Raphael Yuster, Uri Zwick |
| 1992 | FOCS | The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) | Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rdl, Raphael Yuster |