| 2024 | ICFEM | Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. | Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Rgine Laleau |
| 2021 | CONCUR | Arena-Independent Finite-Memory Determinacy in Stochastic Games. | Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove |
| 2020 | CONCUR | Games Where You Can Play Optimally with Arena-Independent Finite Memory. | Patricia Bouyer, Stphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove |
| 2019 | CONCUR | Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. | Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour |
| 2018 | CONCUR | The Complexity of Rational Synthesis for Concurrent Games. | Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard |
| 2014 | CONCUR | Probabilistic Robust Timed Games. | Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur |
| 2014 | FOSSACS | Perfect-Information Stochastic Mean-Payoff Parity Games. | Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj |
| 2014 | MFCS | Two Recursively Inseparable Problems for Probabilistic Automata. | Nathanal Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj |
| 2014 | SOFSEM | Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes. | Hugo Gimbert, Youssouf Oualhadj |
| 2012 | LICS | Deciding the Value 1 Problem for Probabilistic Leaktight Automata. | Nathanal Fijalkow, Hugo Gimbert, Youssouf Oualhadj |
| 2010 | ICALP | Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. | Hugo Gimbert, Youssouf Oualhadj |