## Accepted papers

*Do We Need a Stack to Erase a Component in a Binary Image?,*Tetsuo Asano*Kaboozle is NP-complete, even in a Strip Form ,*Tetsuo Asano, Erik Demaine, Martin Demaine, Ryuhei Uehara*A hat trick,*Oren Ben-Zwi, Guy Wolfovitz*Fun at a Department Store: Data Mining Meets Switching Theory,*Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli*Using Cell Phone Keyboards is (NP) Hard,*Peter Boothe*Urban Hitchhiking,*Marco Bressan, Enoch Peserico*A Fun Application of Compact Data Structures to Indexing Geographic,*Nieves R. Brisaboa, Miguel R. Luaces, Gonzalo Navarro, Diego Seco*On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching,*Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Liptak*Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram,*Yu-Feng Chien, Wing Kai Hon*A Better Bouncer’s Algorithm,*Ferdinando Cicalese, Travis Gagie, Anthony Macula, Martin Milanic, Eberhard Triesch*Tradeoffs in process strategy games with application in the WDM reconguration problem,*Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse*UNO is hard, even for a single player,*Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno*Leveling-Up in Heroes of Might and Magic III,*Dimitrios I. Diochnos*The Magic of a Number System,*Amr Elmasry, Claus Jensen, Jyrki Katajainen*Bit-(Parallelism)2: Getting to the N ext Level of Parallelism,*Simone Faro, Domenico Cantone, Emanuele Giaquinta*An algorithmic analysis of the Honey-Bee game,*Rudolf Fleischer, Gerhard J. Woeginger*Mapping an Unfriendly Subway System,*Paola Flocchini, Matthew Kellett, Peter Mason, Nicola Santoro*Cracking bank PINs by playing Mastermind,*Riccardo Focardi, Flaminia Luccio*Computational complexity of two-dimensional platform games,*Michal Forisek*Christmas Gift Exchange Games,*Arpita Ghosh, Mohammad Mahdian*Return of the Boss Problem: The Untold Story,*Magnus Halldorsson, Hadas Shachnai*Managing Change in the Era of the iPhone,*Patrick Healy*The Computational Complexity of RACETRACK,*Markus Holzer, Pierre McKenzie*Simple Slithering is Hard unless You Are a Fat Hippo,*Irina Kostitsyna, Valentin Polishchuk*The Urinal Problem,*Evangelos Kranakis, Danny Krizanc*Fighting Censorship with Algorithms,*Mohammad Mahdian*The Complexity of Flood Filling Games,*Ashley Montanaro, David Arthur, Raphael Clifford, Markus Jalsenius, Benjamin Sach*The Computational Complexity of the Puzzle Revisited,*Oliver Ruepp, Markus Holzer*Symmetric Monotone Venn Diagrams with Seven Curves,*Frank Ruskey, Khalegh Mamakani*The Feline Josephus Problem,*Frank Ruskey, Aaron Williams*Scheduling with Bully Selfish Jobs,*Tami Tamir*Unsorting by Prefix-Reversals using Boustrophedon Linked Lists,*Aaron Williams