Sciweavers

FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 2 months ago
The Complexity of Flood Filling Games
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 ...
David Arthur, Raphaël Clifford, Markus Jalsen...
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
14 years 2 months ago
Fighting Censorship with Algorithms
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...
Mohammad Mahdian
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 2 months ago
Mapping an Unfriendly Subway System
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...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
14 years 2 months ago
Christmas Gift Exchange Games
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...
Arpita Ghosh, Mohammad Mahdian
FUN
2010
Springer
240views Algorithms» more  FUN 2010»
14 years 2 months ago
Symmetric Monotone Venn Diagrams with Seven Curves
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...
Tao Cao, Khalegh Mamakani, Frank Ruskey
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
14 years 2 months ago
UNO Is Hard, Even for a Single Player
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...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
14 years 2 months ago
An Algorithmic Analysis of the Honey-Bee Game
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...
Rudolf Fleischer, Gerhard J. Woeginger
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
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...
Michal Forisek
DAS
2010
Springer
14 years 2 months ago
Detecting and recognizing tables in spreadsheets
Detecting tables in a spreadsheet is the first step needed to make spreadsheet documents accessible to individuals with visual disabilities. Techniques to enable aural presentati...
Iyad Abu Doush, Enrico Pontelli
CSR
2010
Springer
14 years 2 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning