| 2026 | IPCO | Linear Programming Hierarchies Collapse Under Symmetry. | Yuri Faenza, Victor Verdugo, Jos Verschae, Matas Villagra |
| 2025 | ICALP | Scarf's Algorithm on Arborescence Hypergraphs. | Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman |
| 2025 | IPCO | Non-distributive Lattices, Stable Matchings, and Linear Optimization. | Christopher En, Yuri Faenza |
| 2024 | IPCO | Two-Stage Stochastic Stable Matching. | Yuri Faenza, Ayoub Foussoul, Chengyue He |
| 2024 | IPCO | Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. | Yuri Faenza, Cliff Stein, Jia Wan |
| 2022 | IPCO | The Simultaneous Semi-random Model for TSP. | Eric Balkanski, Yuri Faenza, Mathieu Kubik |
| 2021 | IPCO | Affinely Representable Lattices, Stable Matchings, and Choice Functions. | Yuri Faenza, Xuan Zhang |
| 2020 | ICML | Reinforcement Learning for Integer Programming: Learning to Cut. | Yunhao Tang, Shipra Agrawal, Yuri Faenza |
| 2020 | SODA | Quasi-popular Matchings, Optimality, and Extended Formulations. | Yuri Faenza, Telikepalli Kavitha |
| 2019 | IPCO | Extended Formulations from Communication Protocols in Output-Efficient Time. | Manuel Aprile, Yuri Faenza |
| 2019 | SODA | Popular Matchings and Limits to Tractability. | Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang |
| 2017 | WG | Extension Complexity of Stable Set Polytopes of Bipartite Graphs. | Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia |
| 2015 | ESA | Enumeration of 2-Level Polytopes. | Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich |
| 2015 | SODA | On largest volume simplices and sub-determinants. | Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer |
| 2014 | IPCO | Reverse Split Rank. | Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza |
| 2013 | IPCO | Reverse Chvtal-Gomory Rank. | Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe |
| 2012 | SODA | Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer |
| 2011 | SODA | An algorithmic decomposition of claw-free graphs leading to an O(n | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer |