Abstract is missing.
- Fun with Olympiad in AlgorithmicsRoberto Grossi, Alessio Orlandi, Giuseppe Ottaviano. 1-2 [doi]
- The FUNnest Talks That belong to FUN (Abstract)Prabhakar Raghavan. 3 [doi]
- Fun with GamesPaul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou. 4-15 [doi]
- Do We Need a Stack to Erase a Component in a Binary Image?Tetsuo Asano. 16-27 [doi]
- Kaboozle Is NP-complete, Even in a StripTetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara. 28-36 [doi]
- A Hat TrickOren Ben-Zwi, Guy Wolfovitz. 37-40 [doi]
- Fun at a Department Store: Data Mining Meets Switching TheoryAnna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli. 41-52 [doi]
- Using Cell Phone Keyboards Is (::::NP::::/mathcal{NP}) HardPeter Boothe. 53-67 [doi]
- Urban HitchhikingMarco Bressan 0002, Enoch Peserico. 68-76 [doi]
- A Fun Application of Compact Data Structures to Indexing Geographic DataNieves R. Brisaboa, Miguel Rodríguez Luaces, Gonzalo Navarro, Diego Seco. 77-88 [doi]
- On Table Arrangements, Scrabble Freaks, and Jumbled Pattern MatchingPeter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták. 89-101 [doi]
- Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to NonogramYu-Feng Chien, Wing-Kai Hon. 102-112 [doi]
- A Better Bouncer s AlgorithmFerdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch. 113-120 [doi]
- Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration ProblemNathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. 121-132 [doi]
- UNO Is Hard, Even for a Single PlayerErik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno. 133-144 [doi]
- Leveling-Up in Heroes of Might and Magic IIIDimitrios I. Diochnos. 145-155 [doi]
- The Magic of a Number SystemAmr Elmasry, Claus Jensen, Jyrki Katajainen. 156-165 [doi]
- Bit-(Parallelism):::2:::: Getting to the Next Level of ParallelismDomenico Cantone, Simone Faro, Emanuele Giaquinta. 166-177 [doi]
- An Algorithmic Analysis of the Honey-Bee GameRudolf Fleischer, Gerhard J. Woeginger. 178-189 [doi]
- Mapping an Unfriendly Subway SystemPaola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro. 190-201 [doi]
- Cracking Bank PINs by Playing MastermindRiccardo Focardi, Flaminia L. Luccio. 202-213 [doi]
- Computational Complexity of Two-Dimensional Platform GamesMichal Forisek. 214-227 [doi]
- Christmas Gift Exchange GamesArpita Ghosh, Mohammad Mahdian. 228-236 [doi]
- Return of the Boss Problem: Competing Online against a Non-adaptive AdversaryMagnús M. Halldórsson, Hadas Shachnai. 237-248 [doi]
- Managing Change in the Era of the iPhonePatrick Healy. 249-259 [doi]
- The Computational Complexity of RaceTrackMarkus Holzer, Pierre McKenzie. 260-271 [doi]
- Simple Wriggling Is Hard Unless You Are a Fat HippoIrina Kostitsyna, Valentin Polishchuk. 272-283 [doi]
- The Urinal ProblemEvangelos Kranakis, Danny Krizanc. 284-295 [doi]
- Fighting Censorship with AlgorithmsMohammad Mahdian. 296-306 [doi]
- The Complexity of Flood Filling GamesDavid Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach. 307-318 [doi]
- The Computational Complexity of the Kakuro Puzzle, RevisitedOliver Ruepp, Markus Holzer. 319-330 [doi]
- Symmetric Monotone Venn Diagrams with Seven CurvesTao Cao, Khalegh Mamakani, Frank Ruskey. 331-342 [doi]
- The Feline Josephus ProblemFrank Ruskey, Aaron Williams. 343-354 [doi]
- Scheduling with Bully Selfish JobsTami Tamir. 355-367 [doi]
- O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked ListAaron Williams. 368-379 [doi]