Publications
Published
- G. Bagan, N. Bousquet, Nacim Oijid, T. Pierron . Fast winning strategies for the attacker in eternal domination. To be published in WG, 2024.
- G. Bagan, Q. Deschamps , E. Duchêne, B. Durain, B. Effantin, V. Gledel, N. Oijid, A. Parreau. Incidence, a Scoring Positional Game on Graphs . Discrete Mathematics, Volume 348, Issue 8, 2024.
- A. Baril, A. Castillon, N. Oijid. On the Parameterized Complexity of Relaxations of Clique . Theoretical Computer Science, Volume 1003, 2024.
- G. Bagan, E. Duchêne, F. Mc Inerney , F. Galliot, M. Mikalački , N. Oijid, A. Parreau, M. Stojaković . Poset Positional Games. LIPIcs, FUN 2024, Volume 291, n°12, 2024.
- E. Duchêne, A. Dumas, N. Oijid, A. Parreau, E. Rémila The Maker-Maker domination game in forests. Discrete Applied Mathematics, Volume 348, 2024.
- E. Duchêne, N. Oijid, A. Parreau. Bipartite instances of INFLUENCE. Theoretical Computer Science, Volume 982, 2023.
- V. Gledel, N. Oijid. Avoidance games are PSPACE-complete . LIPIcs, STACS 2023, Volume 254, n°40.
- J. Bensmail , F. Fioravantes, F. Mc Inerney , N. Nisse , N. Oijid. The Maker-Breaker Largest Connected Subgraph Game. Theoretical Computer Science, Volume 943, 2023.
- J. Bensmail , F. Dross , N. Oijid, É. Sopena. Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theoretical Computer Science, Volume 923, 2022.
Submitted
- P. Aboulker , N. Oijid, R. Petit, M. Rocton and C. Simon. Computing the degreewidth of a digraph is hard. 2024.
- V. Gledel , N. Oijid, S. Tavenas and S. Thomassé. On the complexity of Client-Waiter and Waiter-Client games. 2024.
- K. Burke , A. Dailly and N. Oijid. Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. 2024.
- E. Duchêne, V. Gledel, F. Mc Inerney , N. Nisse , N. Oijid, A. Parreau, M. Stojaković. Complexity of Maker-Breaker Games on Edge Sets of Graphs. 2023.
Talks
Past