FUN
2010
Springer
13 years 9 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
FUN
2010
Springer
13 years 9 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, ac...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
An n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2n possible intersections of the interiors and exteriors of the curves forms a connected no...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...