Generalising the achromatic number to Zaslavsky's colourings of signed graphs. - Julien Bensmail; François Dross; Nacim Oijid; Éric Sopena (Theor. Comput. Sci., 2022)

Avoidance Games Are PSPACE-Complete. - Valentin Gledel; Nacim Oijid (STACS, 2023)

On the Parameterized Complexity of Relaxations of Clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (CoRR, 2023)

The Maker-Breaker Largest Connected Subgraph game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid (Theor. Comput. Sci., 2023)

Fast Winning Strategies for the Attacker in Eternal Domination. - Guillaume Bagan; Nicolas Bousquet 001; Nacim Oijid; Théo Pierron (WG, 2024)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. - Kyle Burke; Antoine Dailly; Nacim Oijid (CoRR, 2024)

The Maker-Maker domination game in forests. - Éric Duchêne; Arthur Dumas; Nacim Oijid; Aline Parreau; Eric Rémila (Discret. Appl. Math., 2024)

On the parameterized complexity of non-hereditary relaxations of clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (Theor. Comput. Sci., 2024)

Complexité des jeux positionnels sur les graphes. (Complexity of positional games on graphs). - Nacim Oijid (2024)

Bipartite instances of INFLUENCE. - Éric Duchêne; Nacim Oijid; Aline Parreau (Theor. Comput. Sci., 2024)

Bounded Degree QBF and Positional Games. - Nacim Oijid (CIAC (2), 2025)

On the Complexity of Client-Waiter and Waiter-Client Games. - Valentin Gledel; Nacim Oijid; Sébastien Tavenas; Stéphan Thomassé (ICALP, 2025)

Complexity of Maker-Breaker games on edge sets of graphs. - Éric Duchêne; Valentin Gledel; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Appl. Math., 2025)

Poset positional games. - Guillaume Bagan; Éric Duchêne; Florian Galliot; Valentin Gledel; Mirjana Mikalacki; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Math., 2025)