Nacim Oijid
Publications
Publications
|
|
On the complexity of the Maker-Breaker happy vertex game2026 |
|
|
A two-player version of the assignment problem2026 |
|
|
Computing the degreewidth of a digraph is hard2026 |
|
|
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs2026 |
|
|
Exact number of flips required to sort a burnt stack of pancakes2026 |
|
|
On the parameterized complexity of the Maker-Breaker domination game2026 |
|
|
On the Complexity of Vertex-Splitting Into an Interval Graph ⋆2026 |
|
|
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles2024 |
|
|
Graph Irregularity via Edge DeletionsWALCOM 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⟩ |
|
|
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⟩ |
|
|
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 |
|
|
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⟩ |
|
|
Complexity of Maker-Breaker Games on Edge Sets of GraphsDiscrete Applied Mathematics, 2025, 361, pp.502-522. ⟨10.1016/j.dam.2024.11.012⟩ |
|
|
Incidence, a Scoring Positional Game on GraphsDiscrete Mathematics, In press, 347 (8), pp.113570. ⟨10.1016/j.disc.2023.113570⟩ |
|
|
Poset Positional GamesDiscrete Mathematics, 2024, 12th International Conference on Fun with Algorithms (FUN 2024) (291), pp.114455. ⟨10.4230/LIPIcs.FUN.2024.2⟩ |
|
|
Avoidance games are PSPACE-Complete.Leibniz International Proceedings in Informatics , 2023, 254 (40), pp.34:1--34:19. ⟨10.4230/LIPIcs.STACS.2023.34⟩ |
|
|
The Maker-Maker domination game in forestsDiscrete Applied Mathematics, 2023, 254, pp.34:1--34:19. ⟨10.1016/j.dam.2024.01.023⟩ |
|
|
The Maker-Breaker Largest Connected Subgraph GameTheoretical Computer Science, 2023, 943, pp.102-120. ⟨10.1016/j.tcs.2022.12.014⟩ |
|
|
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⟩ |
|
|
Bipartite instances of INFLUENCETheoretical Computer Science, 2022, 982, pp.114274. ⟨10.1016/j.tcs.2023.114274⟩ |
|
|
On the parameterized complexity of non-hereditary relaxations of cliqueLiris; Loria; CRIStAL. 2023 |