| 2024 | AFT | Searcher Competition in Block Building. | Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov |
| 2023 | SODA | Small subgraphs with large average degree. | Oliver Janzer, Benny Sudakov, Istvn Tomon |
| 2020 | LATIN | Lower Bounds for Max-Cut via Semidefinite Programming. | Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan |
| 2018 | SODA | Submodular Minimization Under Congruency Constraints. | Martin Ngele, Benny Sudakov, Rico Zenklusen |
| 2016 | SODA | On the maximum quartet distance between phylogenetic trees. | Noga Alon, Humberto Naves, Benny Sudakov |
| 2012 | STOC | Nearly complete graphs decomposable into large induced matchings and their applications. | Noga Alon, Ankur Moitra, Benny Sudakov |
| 2010 | FOCS | All-Pairs Shortest Paths in O(n | Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick |
| 2006 | ICALP | Additive Approximation for Edge-Deletion Problems (Abstract). | Noga Alon, Asaf Shapira, Benny Sudakov |
| 2005 | FOCS | Additive Approximation for Edge-Deletion Problems. | Noga Alon, Asaf Shapira, Benny Sudakov |
| 2005 | STOC | Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
| 2002 | FOCS | Learning a Hidden Matching. | Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov |
| 2001 | SODA | Constructing worst case instances for semidefinite programming based approximation algorithms. | Noga Alon, Benny Sudakov, Uri Zwick |
| 2001 | SODA | Approximating coloring and maximum independent sets in 3-uniform hypergraphs. | Michael Krivelevich, Ram Nathaniel, Benny Sudakov |
| 1998 | ESA | Approximate Coloring of Uniform Hypergraphs (Extended Abstract). | Michael Krivelevich, Benny Sudakov |
| 1998 | SODA | Finding a Large Hidden Clique in a Random Graph. | Noga Alon, Michael Krivelevich, Benny Sudakov |