Nacim Oijid

According to our database, Nacim Oijid authored at least 22 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

A two-player version of the assignment problem.

Florian Galliot, Nacim Oijid, Jonas Sénizergues

CoRR, February, 2026

Exact number of flips required to sort a burnt stack of pancakes.

Gerold Jäger, Nacim Oijid

CoRR, January, 2026

On the parameterized complexity of the Maker-Breaker domination game.

Guillaume Bagan, Mathieu Hilaire, Nacim Oijid, Aline Parreau

CoRR, January, 2026

Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-Kayles.

Kyle Burke, Antoine Dailly, Nacim Oijid

Proceedings of the WALCOM: Algorithms and Computation, 2026

Graph Irregularity via Edge Deletions.

Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid

Proceedings of the WALCOM: Algorithms and Computation, 2026

An Algorithm for Monitoring Edge-Geodetic Sets in Chordal Graphs.

Clara Marcille, Nacim Oijid

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

On the Complexity of Vertex-Splitting into an Interval Graph.

Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

On the Complexity of the Maker-Breaker Happy Vertex Game.

Mathieu Hilaire, Perig Montfort, Nacim Oijid

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

Token Positional Games.

Guillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalacki, Nacim Oijid

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025

Complexity of Maker-Breaker games on edge sets of graphs.

Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic

Discret. Appl. Math., 2025

On the Complexity of Client-Waiter and Waiter-Client Games.

Valentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Bounded Degree QBF and Positional Games.

Nacim Oijid

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Bipartite instances of INFLUENCE.

Éric Duchêne, Nacim Oijid, Aline Parreau

Theor. Comput. Sci., January, 2024

Complexité des jeux positionnels sur les graphes. (Complexity of positional games on graphs).

Nacim Oijid

PhD thesis, 2024

On the parameterized complexity of non-hereditary relaxations of clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

Theor. Comput. Sci., 2024

The Maker-Maker domination game in forests.

Éric Duchêne, Arthur Dumas, Nacim Oijid, Aline Parreau, Eric Rémila

Discret. Appl. Math., 2024

Fast Winning Strategies for the Attacker in Eternal Domination.

Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Poset Positional Games.

Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

The Maker-Breaker Largest Connected Subgraph game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid

Theor. Comput. Sci., 2023

On the Parameterized Complexity of Relaxations of Clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

CoRR, 2023

Avoidance Games Are PSPACE-Complete.

Valentin Gledel, Nacim Oijid

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Generalising the achromatic number to Zaslavsky's colourings of signed graphs.

Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena

Theor. Comput. Sci., 2022