Nacim Oijid
15
Documents
Publications
Publications
|
|
On the complexity of the Maker-Breaker happy vertex game2026
Pré-publication, Document de travail
hal-05455419
v1
|
|
|
On the parameterized complexity of the Maker-Breaker domination game2026
Pré-publication, Document de travail
hal-05457457
v1
|
|
|
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles2024
Pré-publication, Document de travail
hal-04495881
v2
|
|
|
Complexity of Maker-Breaker Games on Edge Sets of GraphsDiscrete Applied Mathematics, 2025, 361, pp.502-522. ⟨10.1016/j.dam.2024.11.012⟩
Article dans une revue
hal-03993275
v1
|
|
|
Fast winning strategies for the attacker in eternal dominationGraph-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-04501118
v1
|
|
|
Poset Positional GamesDiscrete 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-04543617
v1
|
|
|
Incidence, a Scoring Positional Game on GraphsDiscrete Mathematics, In press, 347 (8), pp.113570. ⟨10.1016/j.disc.2023.113570⟩
Article dans une revue
hal-03837646
v1
|
|
|
Avoidance games are PSPACE-Complete.Leibniz International Proceedings in Informatics , 2023, 254 (40), pp.34:1--34:19. ⟨10.4230/LIPIcs.STACS.2023.34⟩
Article dans une revue
hal-03787958
v2
|
|
|
The Maker-Maker domination game in forestsDiscrete Applied Mathematics, 2023, 254, pp.34:1--34:19. ⟨10.1016/j.dam.2024.01.023⟩
Article dans une revue
hal-04123172
v1
|
|
|
The Maker-Breaker Largest Connected Subgraph GameTheoretical Computer Science, 2023, 943, pp.102-120. ⟨10.1016/j.tcs.2022.12.014⟩
Article dans une revue
hal-03993562
v1
|
|
|
Bipartite instances of INFLUENCETheoretical Computer Science, 2022, 982, pp.114274. ⟨10.1016/j.tcs.2023.114274⟩
Article dans une revue
hal-03694758
v1
|
|
|
Generalising the achromatic number to Zaslavsky's colourings of signed graphsTheoretical Computer Science, 2022, 923, pp.196-221. ⟨10.1016/j.tcs.2022.05.009⟩
Article dans une revue
hal-03355826
v2
|
|
|
On the complexity of Client-Waiter and Waiter-Client gamesInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.89⟩
Communication dans un congrès
hal-04643212
v1
|
|
|
Une version Maker-Breaker du jeu du plus grand sous-graphe connexeAlgoTel 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-03648321
v1
|
|
|
On the parameterized complexity of non-hereditary relaxations of cliqueLiris; Loria; CRIStAL. 2023
Rapport
(rapport de recherche)
hal-04036849
v1
|
Chargement...
Chargement...