Theoretical Computer Science
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Games, Puzzles, and Computation
Games, Puzzles, and Computation
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Parameterized pursuit-evasion games
Theoretical Computer Science
Parameterized Complexity
Hi-index | 5.23 |
We consider DISJOINT ARROWS, a new bounded-length two-player partizan combinatorial game. In this game the two players, Alice and Bob, alternate in choosing vertices on a directed graph and no player is allowed to select a vertex previously selected. At each round Alice selects a vertex u and Bob has to reply choosing a new vertex in the out-neighborhood of u. The first player who cannot move loses. We prove that deciding whether Bob can endure k rounds when k is part of the input is a PSPACE-complete problem. Moreover we prove that the parameterized version of the problem is AW[*]-complete. Thus we provide a new member for the small set of problems known complete for the class AW[*].