Abstract is missing.
- How to Solve the Cake-Cutting Problem in Sublinear TimeHiro Ito, Takahiro Ueda. [doi]
- A Rupestrian AlgorithmGiuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta. [doi]
- Two Dots is NP-completeNeeldhara Misra. [doi]
- Loopless Gray Code Enumeration and the Tower of BucharestFelix Herter, Günter Rote. [doi]
- Trainyard is NP-hardMatteo Almanza, Stefano Leucci 0001, Alessandro Panconesi. [doi]
- Threes!, Fives, 1024!, and 2048 are HardStefan Langerman, Yushi Uno. [doi]
- Recognizing a DOG is Hard, But Not When It is Thin and UnitWilliam S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk. [doi]
- 2048 Without New Tiles Is Still HardAhmed Abdelkader, Aditya Acharya, Philip Dasler. [doi]
- Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential TimeJérémy Barbay. [doi]
- Building a Better Mouse MazeJessica Enright, John D. Faben. [doi]
- Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKenXavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- An Arithmetic for Rooted TreesFabrizio Luccio. [doi]
- LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?Davide Bacciu, Vincenzo Gervasi, Giuseppe Prencipe. [doi]
- Spy-Game on GraphsNathann Cohen, Mathieu Hilaire, Nícolas A. Martins, Nicolas Nisse, Stéphane Pérennes. [doi]
- The Fewest Clues ProblemErik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson. [doi]
- Counting Circles Without Computing ThemRudolf Fleischer. [doi]
- The Complexity of SnakeMarzio De Biasi, Tim Ophelders. [doi]
- Resource Optimization for Program Committee Members: A Subreview ArticleMichael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh 0002, Frédéric Vivien. [doi]
- Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental ClusteringFrancesco Cambi, Pierluigi Crescenzi, Linda Pagli. [doi]
- Hanabi is NP-complete, Even for Cheaters who Look at Their CardsJean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno. [doi]
- This House Proves That Debating is Harder Than SoccerStefan Neumann 0003, Andreas Wiese. [doi]
- Convex Configurations on Nana-kin-san PuzzleTakashi Horiyama, Ryuhei Uehara, Haruo Hosoya. [doi]
- Algorithms and Insights for RaceTrackMichael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann 0001, Simon Poschenrieder, Thomas Stüber. [doi]
- Super Mario Bros. is Harder/Easier Than We ThoughtErik D. Demaine, Giovanni Viglietta, Aaron Williams. [doi]
- Large Peg-Army ManeuversLuciano Gualà, Stefano Leucci 0001, Emanuele Natale, Roberto Tauraso. [doi]