Nacim Oijid

30 papers A* 1A 1B 3Misc 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A two-player version of the assignment problem.
CoRR
Florian Galliot, Nacim Oijid, Jonas Sénizergues
2026 J jnl
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs.
CoRR
Nacim Oijid, Clara Marcille
2026 B conf
Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-Kayles.
WALCOM
Kyle Burke, Antoine Dailly, Nacim Oijid
2026 J jnl
Exact number of flips required to sort a burnt stack of pancakes.
CoRR
Gerold Jäger, Nacim Oijid
2026 B conf
Graph Irregularity via Edge Deletions.
WALCOM
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid
2026 J jnl
On the Complexity of Vertex-Splitting Into an Interval Graph.
CoRR
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid
2026 J jnl
On the complexity of the Maker-Breaker happy vertex game.
CoRR
Mathieu Hilaire, Perig Montfort, Nacim Oijid
2026 J jnl
On the parameterized complexity of the Maker-Breaker domination game.
CoRR
Guillaume Bagan, Mathieu Hilaire, Nacim Oijid, Aline Parreau
2026 J jnl
Token positional games.
CoRR
Guillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalacki, Nacim Oijid
2025 — conf
Bounded Degree QBF and Positional Games.
CIAC (2)
Nacim Oijid
2025 J jnl
Complexity of Maker-Breaker games on edge sets of graphs.
Discret. Appl. Math.
Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic
2025 J jnl
Graph Irregularity via Edge Deletions.
CoRR
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid
2025 A* conf
On the Complexity of Client-Waiter and Waiter-Client Games.
ICALP
Valentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé
2025 J jnl
Poset positional games.
Discret. Math.
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2024 J jnl
Bipartite instances of INFLUENCE.
Theor. Comput. Sci.
Éric Duchêne, Nacim Oijid, Aline Parreau
2024 J jnl
Bounded degree QBF and positional games.
CoRR
Nacim Oijid
2024 J jnl
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles.
CoRR
Kyle Burke, Antoine Dailly, Nacim Oijid
2024 — —
Complexité des jeux positionnels sur les graphes. (Complexity of positional games on graphs).
Nacim Oijid
2024 B conf
Fast Winning Strategies for the Attacker in Eternal Domination.
WG
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024 J jnl
Fast winning strategies for the attacker in eternal domination.
CoRR
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
2024 J jnl
On the parameterized complexity of non-hereditary relaxations of clique.
Theor. Comput. Sci.
Ambroise Baril, Antoine Castillon, Nacim Oijid
2024 Misc conf
Poset Positional Games.
FUN
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2024 J jnl
Poset Positional Games.
CoRR
Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic
2024 J jnl
The Maker-Maker domination game in forests.
Discret. Appl. Math.
Éric Duchêne, Arthur Dumas, Nacim Oijid, Aline Parreau, Eric Rémila
2023 A conf
Avoidance Games Are PSPACE-Complete.
STACS
Valentin Gledel, Nacim Oijid
2023 J jnl
Complexity of Maker-Breaker Games on Edge Sets of Graphs.
CoRR
Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic
2023 J jnl
On the Parameterized Complexity of Relaxations of Clique.
CoRR
Ambroise Baril, Antoine Castillon, Nacim Oijid
2023 J jnl
The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid
2022 J jnl
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Theor. Comput. Sci.
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
2021 J jnl
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
CoRR
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena