My research interests
My research lies at the interface of graph theory, combinatorics, and algorithmic game theory, with a particular focus on positional games on graphs. Positional games are two-player games in which players alternately claim elements of a (hyper)graph in order to enforce a given property. They are closely related to graph theory, combinatorics, and complexity theory. Overall, this line of research aims at developing strategies in adversarial and competitive settings, and at modeling robustness against errors.
My research interests also span parameterized algorithms, reconfiguration problems, and meta-theorems for model checking.
Selected papers
-
Incidence, a Scoring Positional Game on Graphs
G. Bagan, Q. Deschamps, E. Duchêne, B. Durain, B. Effantin, V. Gledel, N. Oijid, A. Parreau (2024)
Discrete Mathematics, Vol. 348, Issue 8
Link -
On the complexity of Client-Waiter and Waiter-Client games
V. Gledel, N. Oijid, S. Tavenas, S. Thomassé (2025)
ICALP 2025, LIPIcs Vol.334
Link -
Bounded degree QBF and positional games
N. Oijid (2025)
CIAC 2025, Springer LNCS 15680
Link -
Fast winning strategies for the attacker in eternal domination
G. Bagan, N. Bousquet, N. Oijid, T. Pierron (2025)
WG 2024, Springer LNCS 14760
Link -
Avoidance games are PSPACE-complete
V. Gledel, N. Oijid (2023)
STACS 2023, LIPIcs Vol. 254
Link
Incoming talks
- March 2026: WALCOM 2026
- April 2026: P-GASE Meeting
Organising events
I have helped in the organisation of the following events:
Supervision
I have supervised the following internship:
- Perig Montfort (L3, 6 weeks): On the complexity of the Maker-Breaker happy vertex game.