Nacim Oijid
Former LIRIS member since: 2024-09-30
| Quality | PhD student |
| Team(s) | GOAL |
| Institution | Autre |
| Personal page | https://nacim-oijid.fr |
| Thesis | Complexity of positional games on graphs (click to view details) |
Publications (IdHAL : nacim-oijid)
Publications LIRIS pour Nacim Oijid (8)
- 2025 (2)
- Journals (1)
- International journals with peer review (1)
- Guillaume Bagan, Nicolas Bousquet, Nacim Oijid & Théo Pierron (2025). "Fast winning strategies for the attacker in eternal domination". Graph-Theoretic Concepts in Computer Science WG 2024, vol. 14760, pp. 21-34. doi : 10.1007/978-3-031-75409-8_2. ArXiv : 2401.10584. HAL : hal-04501118.
. 
- Conferences (1)
- International conferences with peer review (1)
- Valentin Gledel, Nacim Oijid, Sébastien Tavenas & Stéphan Thomassé (2025). "On the complexity of Client-Waiter and Waiter-Client games". International Colloquium on Automata, Languages, and Programming (ICALP), 11 juillet 2025, Aarhus (Denmark). doi : 10.4230/LIPIcs.ICALP.2025.89. ArXiv : 2407.06777. HAL : hal-04643212. .
- 2024 (1)
- Journals (1)
- International journals with peer review (1)
- Guillaume Bagan, Eric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalački, Nacim Oijid, Aline Parreau & Miloš Stojaković (2024). "Poset Positional Games". Discrete Mathematics, vol. 12th International Conference on Fun with Algorithms FUN 2024, #291, p. 114455. doi : 10.4230/LIPIcs.FUN.2024.2. ArXiv : 2404.07700. HAL : hal-04543617. .
- 2023 (3)
- Journals (2)
- International journals with peer review (2)
- Eric Duchêne, Arthur Dumas, Nacim Oijid, Aline Parreau & Eric Rémila (2023). "The Maker-Maker domination game in forests". Discrete Applied Mathematics, vol. 254, 34:1-34:19. doi : 10.1016/j.dam.2024.01.023. ArXiv : 2306.05728. HAL : hal-04123172. .
- 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. .
- Reports (1)
- Research reports/tecnical reports (1)
- 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. .
- 2022 (2)
- Journals (1)
- International journals with peer review (1)
- 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. .
- Conferences (1)
- National conferences with peer review (1)
- 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. .
Publications hors LIRIS
Publications hors LIRIS pour Nacim Oijid (6)
- 2026 (5)
- Conferences (1)
- International conferences with peer review (1)
- Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille & Nacim Oijid (2026). "Graph Irregularity via Edge Deletions". WALCOM 2026 - 20th International Conference and Workshops on Algorithms and Computation, 6 mars 2026, Perugia (Italy), pp. 353-367. doi : 10.1007/978-981-95-7127-7_24. HAL : hal-05548898. .
- Others (4)
- Clara Marcille & Nacim Oijid (2026). "An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs". ArXiv : 2602.03288. HAL : hal-05492257. .
- Florian Galliot, Nacim Oijid & Jonas Sénizergues (2026). "A two-player version of the assignment problem". ArXiv : 2602.02628. HAL : hal-05492254. .
- Guillaume Bagan, Mathieu Hilaire, Nacim Oijid & Aline Parreau (2026). "On the parameterized complexity of the Maker-Breaker domination game". ArXiv : 2601.08562. HAL : hal-05457457. .
- Mathieu Hilaire, Perig Montfort & Nacim Oijid (2026). "On the complexity of the Maker-Breaker happy vertex game". ArXiv : 2601.07673. HAL : hal-05455419. .
- 2024 (1)
- Others (1)
- Kyle Burke, Antoine Dailly & Nacim Oijid (2024). "Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles". HAL : hal-04495881. .