Nacim Oijid

Publications

Pré-publication, Document de travail (8)

On the complexity of the Maker-Breaker happy vertex game Mathieu Hilaire,Perig Montfort,Nacim Oijid 2026 Pré-publication, Document de travail hal-05455419v1
A two-player version of the assignment problem Florian Galliot,Nacim Oijid,Jonas Sénizergues 2026 Pré-publication, Document de travail hal-05492254v1
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs Clara Marcille,Nacim Oijid 2026 Pré-publication, Document de travail hal-05492257v1
Computing the degreewidth of a digraph is hard Pierre Aboulker,Nacim Oijid,Robin Petit,Mathis Rocton,Christopher-Lloyd Simon 2026 Pré-publication, Document de travail hal-05529314v1
Exact number of flips required to sort a burnt stack of pancakes Nacim Oijid,Gerold Jäger 2026 Pré-publication, Document de travail hal-05461632v1
On the parameterized complexity of the Maker-Breaker domination game Guillaume Bagan,Mathieu Hilaire,Nacim Oijid,Aline Parreau 2026 Pré-publication, Document de travail hal-05457457v1
On the Complexity of Vertex-Splitting Into an Interval Graph ⋆ Faisal N. Abu-Khzam,Dipayan Chakraborty,Lucas Isenmann,Nacim Oijid 2026 Pré-publication, Document de travail hal-05529402v1
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles Kyle Burke,Antoine Dailly,Nacim Oijid 2024 Pré-publication, Document de travail hal-04495881v2

Communication dans un congrès (3)

Graph Irregularity via Edge Deletions Julien Bensmail,Noémie Catherinot,Foivos Fioravantes,Clara Marcille,Nacim Oijid WALCOM 2026 - 20th International Conference and Workshops on Algorithms and Computation, Mar 2026, Perugia, Italy. pp.353-367, ⟨10.1007/978-981-95-7127-7_24⟩ Communication dans un congrès hal-05548898v1
On the complexity of Client-Waiter and Waiter-Client games Valentin Gledel,Nacim Oijid,Sébastien Tavenas,Stéphan Thomassé International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.89⟩ Communication dans un congrès hal-04643212v1
Une version Maker-Breaker du jeu du plus grand sous-graphe connexe Julien Bensmail,Foivos Fioravantes,Fionn Mc Inerney,Nicolas Nisse,Nacim Oijid AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France Communication dans un congrès hal-03648321v1

Article dans une revue (9)

Fast winning strategies for the attacker in eternal domination Guillaume Bagan,Nicolas Bousquet,Nacim Oijid,Théo Pierron Graph-Theoretic Concepts in Computer Science WG 2024, 2025, Lecture Notes in Computer Science, 14760, pp.21-34. ⟨10.1007/978-3-031-75409-8_2⟩ Article dans une revue hal-04501118v1
Complexity of Maker-Breaker Games on Edge Sets of Graphs Eric Duchêne,Valentin Gledel,Fionn Mc Inerney,Nicolas Nisse,Nacim Oijidet al. Discrete Applied Mathematics, 2025, 361, pp.502-522. ⟨10.1016/j.dam.2024.11.012⟩ Article dans une revue hal-03993275v1
Incidence, a Scoring Positional Game on Graphs Guillaume Bagan,Quentin Deschamps,Eric Duchêne,Bastien Durain,Brice Effantinet al. Discrete Mathematics, In press, 347 (8), pp.113570. ⟨10.1016/j.disc.2023.113570⟩ Article dans une revue hal-03837646v1
Poset Positional Games Guillaume Bagan,Eric Duchêne,Florian Galliot,Valentin Gledel,Mirjana Mikalačkiet al. Discrete Mathematics, 2024, 12th International Conference on Fun with Algorithms (FUN 2024) (291), pp.114455. ⟨10.4230/LIPIcs.FUN.2024.2⟩ Article dans une revue hal-04543617v1
Avoidance games are PSPACE-Complete. Valentin Gledel,Nacim Oijid Leibniz International Proceedings in Informatics , 2023, 254 (40), pp.34:1--34:19. ⟨10.4230/LIPIcs.STACS.2023.34⟩ Article dans une revue hal-03787958v2
The Maker-Maker domination game in forests Eric Duchêne,Arthur Dumas,Nacim Oijid,Aline Parreau,Eric Rémila Discrete Applied Mathematics, 2023, 254, pp.34:1--34:19. ⟨10.1016/j.dam.2024.01.023⟩ Article dans une revue hal-04123172v1
The Maker-Breaker Largest Connected Subgraph Game Julien Bensmail,Foivos Fioravantes,Fionn Mc Inerney,Nicolas Nisse,Nacim Oijid Theoretical Computer Science, 2023, 943, pp.102-120. ⟨10.1016/j.tcs.2022.12.014⟩ Article dans une revue hal-03993562v1
Generalising the achromatic number to Zaslavsky's colourings of signed graphs Julien Bensmail,François Dross,Nacim Oijid,Éric Sopena Theoretical Computer Science, 2022, 923, pp.196-221. ⟨10.1016/j.tcs.2022.05.009⟩ Article dans une revue hal-03355826v2
Bipartite instances of INFLUENCE Eric Duchêne,Nacim Oijid,Aline Parreau Theoretical Computer Science, 2022, 982, pp.114274. ⟨10.1016/j.tcs.2023.114274⟩ Article dans une revue hal-03694758v1

Rapport (1)

On the parameterized complexity of non-hereditary relaxations of clique Ambroise Baril,Antoine Castillon,Nacim Oijid Liris; Loria; CRIStAL. 2023 Rapport (rapport de recherche) hal-04036849v1