1 citations · 1 across the 5 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CC2022★ 1 cited
Avoider-Enforcer Game is NP-hard
Tillmann Miltzow, Miloš Stojaković
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforc…
cs.GT2022
On strong avoiding games
Miloš Stojaković, Jelena Stratijev
Given an increasing graph property , the strong Avoider-Avoider game is played on the edge set of a complete graph. Two players, Red and Blue, take turns in claimi…
math.CO2022
The Constructor-Blocker Game
Balázs Patkós, Miloš Stojaković, Máté Vizer
We study the following game version of the generalized graph Turán problem. For two fixed graphs and , two players, Constructor and Blocker, alternately claim unclaimed edge…