Nacim Oijid

Available identifiers

zbMath Open oijid.nacimMaRDI QIDQ2672622

List of research outcomes

Publication	Date of Publication	Type
Complexity of maker-breaker games on edge sets of graphs	2025-01-06	Paper
Avoidance games are PSPACE-complete	2024-10-08	Paper
On the parameterized complexity of non-hereditary relaxations of clique	2024-06-04	Paper
The maker-maker domination game in forests	2024-03-27	Paper
Bipartite instances of INFLUENCE	2024-02-23	Paper
The maker-breaker largest connected subgraph game	2023-01-05	Paper
Incidence, a Scoring Positional Game on Graphs	2022-11-02	Paper
Avoidance games are PSPACE-Complete	2022-09-23	Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs	2022-06-13	Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs	2021-09-28	Paper
Fast winning strategies for the attacker in eternal domination	N/A	Paper
The Maker-Breaker Largest Connected Subgraph Game	N/A	Paper
Poset Positional Games	N/A	Paper
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles	N/A	Paper

Research outcomes over time

This page was built for person: Nacim Oijid