Nacim Oijid

Team(s)	GOAL
Institution	Autre
Location	Nautibus (Université Lyon1)
Email	nacim.oijid at liris.cnrs.fr

Personal page	Nacim Oijid
Thesis	Complexity of positional games on graphs (click to view details)

Publications LIRIS pour Nacim Oijid (11)

Guillaume Bagan, Nicolas Bousquet, Nacim Oijid & Théo Pierron (2024). "Fast winning strategies for the attacker in eternal domination". ArXiv : 2401.10584. HAL : hal-04501118. .
Kyle Burke, Antoine Dailly & Nacim Oijid (2024). "Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles". HAL : hal-04495881. .

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse & Nacim Oijid (2023). "The Maker-Breaker Largest Connected Subgraph Game". Theoretical Computer Science, vol. 943, pp. 102-120. doi : 10.1016/j.tcs.2022.12.014. HAL : hal-03993562. .
Guillaume Bagan, Quentin Deschamps, Eric Duchêne, Bastien Durain, Brice Effantin, Valentin Gledel, Nacim Oijid & Aline Parreau (2023). "Incidence, a Scoring Positional Game on Graphs". Discrete Mathematics, p. 113570. doi : 10.1016/j.disc.2023.113570. ArXiv : 2211.01083. HAL : hal-03837646. .
Valentin Gledel & Nacim Oijid (2023). "Avoidance games are PSPACE-Complete.". Leibniz International Proceedings in Informatics, vol. 254, #40, 34:1-34:19. doi : 10.4230/LIPIcs.STACS.2023.34. ArXiv : 2209.11698. HAL : hal-03787958. .

Eric Duchêne, Arthur Dumas, Nacim Oijid, Aline Parreau & Eric Rémila (2023). "The Maker-Maker domination game in forests". Symposium on Theoretical Aspects of Computer Science (STACS), 9 mars 2023, Hambourg (Germany) (Germany), 34:1-34:19. doi : 10.1016/j.dam.2024.01.023. ArXiv : 2306.05728. HAL : hal-04123172. .

Ambroise Baril, Antoine Castillon & Nacim Oijid (2023). "On the parameterized complexity of non-hereditary relaxations of clique". Research report. doi : 10.48550/arXiv.2303.10490. ArXiv : 2303.10490. HAL : hal-04036849. .
Eric Duchene, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau & Miloš Stojaković (2023). "Complexity of Maker-Breaker Games on Edge Sets of Graphs". Research report. HAL : hal-03993275. .

Eric Duchêne, Nacim Oijid & Aline Parreau (2022). "Bipartite instances of INFLUENCE". Theoretical Computer Science, vol. 982, p. 114274. doi : 10.1016/j.tcs.2023.114274. ArXiv : 2206.06118. HAL : hal-03694758. .
Julien Bensmail, François Dross, Nacim Oijid & Éric Sopena (2022). "Generalising the achromatic number to Zaslavsky's colourings of signed graphs". Theoretical Computer Science, vol. 923, pp. 196-221. doi : 10.1016/j.tcs.2022.05.009. ArXiv : 2109.13627. HAL : hal-03355826. .

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse & Nacim Oijid (2022). "Une version Maker-Breaker du jeu du plus grand sous-graphe connexe". AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 3 juin 2022, Saint-Rémy-Lès-Chevreuse (France). HAL : hal-03648321. .