Fun with Algorithms [electronic resource] : 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings / edited by Paolo Boldi, Luisa Gargano.

Fun with Olympiad in Algorithmics -- The FUNnest Talks That belong to FUN (Abstract) -- Fun with Games -- Do We Need a Stack to Erase a Component in a Binary Image? -- Kaboozle Is NP-complete, Even in a Strip -- A Hat Trick -- Fun at a Department Store: Data Mining Meets Switching Theory -- Using Cell Phone Keyboards Is ( ) Hard -- Urban Hitchhiking -- A Fun Application of Compact Data Structures to Indexing Geographic Data -- On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching -- Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram -- A Better Bouncer’s Algorithm -- Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem -- UNO Is Hard, Even for a Single Player -- Leveling-Up in Heroes of Might and Magic III -- The Magic of a Number System -- Bit-(Parallelism)2: Getting to the Next Level of Parallelism -- An Algorithmic Analysis of the Honey-Bee Game -- Mapping an Unfriendly Subway System -- Cracking Bank PINs by Playing Mastermind -- Computational Complexity of Two-Dimensional Platform Games -- Christmas Gift Exchange Games -- Return of the Boss Problem: Competing Online against a Non-adaptive Adversary -- Managing Change in the Era of the iPhone -- The Computational Complexity of RaceTrack -- Simple Wriggling Is Hard Unless You Are a Fat Hippo -- The Urinal Problem -- Fighting Censorship with Algorithms -- The Complexity of Flood Filling Games -- The Computational Complexity of the Kakuro Puzzle, Revisited -- Symmetric Monotone Venn Diagrams with Seven Curves -- The Feline Josephus Problem -- Scheduling with Bully Selfish Jobs -- O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List.