9 citations · 11 across the 17 of their papers we have counts for
7 papers · 1 filter
Bounded degree QBF and positional games
Nacim Oijid
The study of SAT and its variants has provided numerous NP-complete problems, from which most NP-hardness results were derived. Due to the NP-hardness of SAT, adding constraints to…
Computing the degreewidth of a digraph is hard
Pierre Aboulker, Nacim Oijid, Robin Petit +2
Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order.…
On the complexity of Client-Waiter and Waiter-Client games
Valentin Gledel, Nacim Oijid, Sébastien Tavenas +1
Positional games were introduced by Hales and Jewett in 1963, and their study became more popular after Erdos and Selfridge's first result on their connection to Ramsey theory and…
Poset Positional Games
Guillaume Bagan, Eric Duchêne, Florian Galliot +5
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset…
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
Kyle Burke, Antoine Dailly, Nacim Oijid
Arc-Kayles is a game where two players alternate removing two adjacent vertices until no move is left, the winner being the player who played the last move. Introduced in 1978, its…
The Maker-Breaker Largest Connected Subgraph Game
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney +2
Given a graph and , we introduce the following game played in . Each round, Alice colours an uncoloured vertex of red, and then Bob colours one blue (i…
Fast winning strategies for the attacker in eternal domination
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid +1
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurrin…