Qualitative Tree Languages. - Arnaud Carayol; Axel Haddad; Olivier Serre (LICS, 2011)

IO vs OI in Higher-Order Recursion Schemes - Axel Haddad (FICS, 2012)

Model Checking and Functional Program Transformations. - Axel Haddad (FSTTCS, 2013)

Randomization in Automata on Infinite Trees. - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2014)

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (CONCUR, 2015)

Simple Priced Timed Games are not That Simple. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (FSTTCS, 2015)

Quantitative Games under Failures. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege; Guillermo A. Pérez 001; Gabriel Renault (FSTTCS, 2015)

Counting Branches in Trees Using Games. - Arnaud Carayol; Axel Haddad; Olivier Serre (CoRR, 2015)

Simple strategies for Banach-Mazur games and sets of probability 1. - Thomas Brihaye; Axel Haddad; Quentin Menet (Inf. Comput., 2015)

Erratum for "Randomization in Automata on Infinite Trees". - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2015)

Efficient Energy Distribution in a Smart Grid using Multi-Player Games. - Thomas Brihaye; Amit Kumar Dhar; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Cassting/SynCoP, 2016)

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Acta Informatica, 2017)

One-Clock Priced Timed Games with Arbitrary Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (CoRR, 2020)

One-Clock Priced Timed Games with Negative Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (Log. Methods Comput. Sci., 2022)