| 2026 | ICALP | Gray Codes with Constant Delay and Constant Auxiliary Space. | Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikal Monet, Yann Strozecki |
| 2023 | STACS | Geometric Amortization of Enumeration Algorithms. | Florent Capelli, Yann Strozecki |
| 2021 | MFCS | A Generic Strategy Improvement Method for Simple Stochastic Games. | David Auger, Xavier Badin de Montjoye, Yann Strozecki |
| 2019 | STACS | Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. | David Auger, Pierre Coucheney, Yann Strozecki |
| 2016 | STACS | Efficient Enumeration of Solutions Produced by Closure Operations. | Arnaud Mary, Yann Strozecki |
| 2014 | TAMC | Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. | David Auger, Pierre Coucheney, Yann Strozecki |
| 2013 | ISSAC | Factoring bivariate lacunary polynomials without heights. | Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki |
| 2012 | ICTAC | Approximate Verification and Enumeration Problems. | Sylvain Peyronnet, Michel de Rougemont, Yann Strozecki |
| 2011 | CSL | Enumeration Complexity of Logical Query Problems with Second-order Variables. | Arnaud Durand, Yann Strozecki |
| 2011 | WALCOM | The Complexity of Acyclic Subhypergraph Problems. | David Duris, Yann Strozecki |
| 2010 | ICIP | From patches to pixels in Non-Local methods: Weighted-average reprojection. | Joseph Salmon, Yann Strozecki |
| 2010 | MFCS | Enumeration of the Monomials of a Polynomial and Related Complexity Classes. | Yann Strozecki |