LIPIcs, Volume 49, FUN 2016

• Erik D. Demaine and Fabrizio Grandoni LIPIcs, Volume 49, FUN'16, Complete Volume 10.4230/LIPIcs.FUN.2016
• Erik D. Demaine and Fabrizio Grandoni Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FUN.2016.0
• Ahmed Abdelkader, Aditya Acharya, and Philip Dasler 2048 Without New Tiles Is Still Hard 10.4230/LIPIcs.FUN.2016.1
• Matteo Almanza, Stefano Leucci, and Alessandro Panconesi Trainyard is NP-hard 10.4230/LIPIcs.FUN.2016.2
• Davide Bacciu, Vincenzo Gervasi, and Giuseppe Prencipe LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh? 10.4230/LIPIcs.FUN.2016.3
• Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, and Yushi Uno Hanabi is NP-complete, Even for Cheaters who Look at Their Cards 10.4230/LIPIcs.FUN.2016.4
• Jérémy Barbay Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time 10.4230/LIPIcs.FUN.2016.5
• Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, and Thomas Stüber Algorithms and Insights for RaceTrack 10.4230/LIPIcs.FUN.2016.6
• Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, and Frédéric Vivien Resource Optimization for Program Committee Members: A Subreview Article 10.4230/LIPIcs.FUN.2016.7
• Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, and Pascal Lafourcade Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen 10.4230/LIPIcs.FUN.2016.8
• Francesco Cambi, Pierluigi Crescenzi, and Linda Pagli Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering 10.4230/LIPIcs.FUN.2016.9
• Nathann Cohen, Mathieu Hilaire, Nícolas A. Martins, Nicolas Nisse, and Stéphane Pérennes Spy-Game on Graphs 10.4230/LIPIcs.FUN.2016.10
• Marzio De Biasi and Tim Ophelders The Complexity of Snake 10.4230/LIPIcs.FUN.2016.11
• Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, and Scott Aaronson The Fewest Clues Problem 10.4230/LIPIcs.FUN.2016.12
• Erik D. Demaine, Giovanni Viglietta, and Aaron Williams Super Mario Bros. is Harder/Easier Than We Thought 10.4230/LIPIcs.FUN.2016.13
• Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta A Rupestrian Algorithm 10.4230/LIPIcs.FUN.2016.14
• Jessica Enright and John D. Faben Building a Better Mouse Maze 10.4230/LIPIcs.FUN.2016.15
• William Evans, Mereke van Garderen, Maarten Löffler, and Valentin Polishchuk Recognizing a DOG is Hard, But Not When It is Thin and Unit 10.4230/LIPIcs.FUN.2016.16
• Rudolf Fleischer Counting Circles Without Computing Them 10.4230/LIPIcs.FUN.2016.17
• Luciano Gualà, Stefano Leucci, Emanuele Natale, and Roberto Tauraso Large Peg-Army Maneuvers 10.4230/LIPIcs.FUN.2016.18
• Felix Herter and Günter Rote Loopless Gray Code Enumeration and the Tower of Bucharest 10.4230/LIPIcs.FUN.2016.19
• Takashi Horiyama, Ryuhei Uehara, and Haruo Hosoya Convex Configurations on Nana-kin-san Puzzle 10.4230/LIPIcs.FUN.2016.20
• Hiro Ito and Takahiro Ueda How to Solve the Cake-Cutting Problem in Sublinear Time 10.4230/LIPIcs.FUN.2016.21
• Stefan Langerman and Yushi Uno Threes!, Fives, 1024!, and 2048 are Hard 10.4230/LIPIcs.FUN.2016.22
• Fabrizio Luccio An Arithmetic for Rooted Trees 10.4230/LIPIcs.FUN.2016.23
• Neeldhara Misra Two Dots is NP-complete 10.4230/LIPIcs.FUN.2016.24
• Stefan Neumann and Andreas Wiese This House Proves That Debating is Harder Than Soccer 10.4230/LIPIcs.FUN.2016.25