- Ahmed Abdelrazek, Aditya Acharya and Philip Dasler.
2048 Without New Tiles Is Still Hard
- Matteo Almanza, Stefano Leucci and Alessandro Panconesi.
Trainyard is NP-Hard
- Davide Bacciu, Vincenzo Gervasi and Giuseppe Prencipe.
LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?
- 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
- Jérémy Barbay.
Bouncing Towers move faster than Hanoi Towers, but still require exponential time
- Michael Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder and Thomas Stüber.
Algorithms and Insights for RaceTrack
- Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh and Frédéric Vivien.
Resource Optimization for Program Committee Members: A Subreview Article
- Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas and Pascal Lafourcade.
Physical Zero-Knowledge Proofs for Akari, Kakuro, KenKen and Takuzu
- Francesco Cambi, Pierluigi Crescenzi and Linda Pagli.
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering
- Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse and Stéphane Pérennes.
Spy-Game on graphs
- Marzio De Biasi and Tim Ophelders.
The Complexity of Snake
- Erik D. Demaine, Fermi Ma, Erik Waingarten, Ariel Schvartzman, and Scott Aaronson.
The Fewest Clues Problem.
- Erik D. Demaine, Giovanni Viglietta and Aaron Williams.
Super Mario Bros. is Harder/Easier than We Thought
- Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro and Giovanni Viglietta.
A Rupestrian Algorithm
- Jessica Enright and John Faben.
Building a better mouse maze
- William Evans, Mereke van Garderen, Maarten Loffler and Valentin Polishchuk.
Recognizing a DOG is Hard but not when it is Thin and Unit
- Rudolf Fleischer.
Counting Circles Without Computing Them
- Luciano Gualà, Stefano Leucci, Emanuele Natale and Roberto Tauraso.
Large Solitaire-Army Maneuvers
- Felix Herter and Günter Rote.
Loopless Gray Code Enumeration and the Tower of Bucharest
- Takashi Horiyama, Ryuhei Uehara and Haruo Hosoya.
Convex Configurations on Nana-kin-san Puzzle
- Hiro Ito and Takahiro Ueda.
How to solve the cake-cutting problem in sublinear time
- Stefan Langerman and Yushi Uno.
Threes!, Fives, 1024!, and 2048 are Hard
- Fabrizio Luccio.
An Arithmetic for Rooted Trees
- Neeldhara Misra.
Two Dots is NP-complete
- Stefan Neumann and Andreas Wiese.
This House Proves That Debating Is Harder Than Soccer