Tuesday 7th June

21:00 Welcome Reception

Wednesday 8th June

08:45 – 09:00 Welcome 
09:00 – 10:00 Invited talk 1:
Craig S. Kaplan
Pack, cover, surround: computer-generated tilings in art and design”
10:00 – 10:30 Coffee break
10:30 – 11:30 Session 1

  • Matteo Almanza, Stefano Leucci and Alessandro Panconesi. Trainyard is NP­-Hard
  • Luciano Gualà, Stefano Leucci, Emanuele Natale and Roberto Tauraso. Large Solitaire-­Army Maneuvers
  • Takashi Horiyama, Ryuhei Uehara and Haruo Hosoya. Convex Configurations on Nana-­kin-san Puzzle
11:30 – 11:45  Short break
11:45 – 12:45 Session 2

  • Jessica Enright and John Faben. Building a better mouse maze
  • Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse and Stéphane Pérennes. Spy-­Game on graphs
  • Giovanni Viglietta, Paola Flocchini, Nicola Santoro, Giuseppe Prencipe and Giuseppe Antonio Di Luna. A Rupestrian Algorithm
12:45 – 14:15 Lunch
14:15 – 15:35 Session 3

  • Stefan Neumann and Andreas Wiese. This House Proves That Debating Is Harder Than Soccer
  • Michael A. Bender, Samuel McCauley , Bertrand Simon, Shikha Singh and Frédéric Vivien. Resource Optimization for Program Committee Members: A Subreview Article
  • Davide Bacciu, Vincenzo Gervasi and Giuseppe Prencipe. LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?
  • Francesco Cambi, Pierluigi Crescenzi and Linda Pagli. Analyzing and Comparing On­-Line News Sources via (Two-Layer) Incremental Clustering

Thursday 9th June

09:00 – 10:00 Invited talk 2:
Stefan Langerman
Tilings and Unfoldings”
10:00 – 10:30 Coffee break
10:30 – 11:30 Session 4

  • Marzio De Biasi and Tim Ophelders. The Complexity of Snake
  • Xavier Bultel, Jannik Dreier, Jean­-Guillaume Dumas and Pascal Lafourcade. Physical Zero-Knowledge Proofs for Akari, Kakuro, KenKen and Takuzu
  • Giovanni Viglietta, Erik D. Demaine and Aaron Williams. Super Mario Bros. is Harder/Easier than We Thought
11:30 – 11:45  Short break
11:45 – 12:45 Session 5

  • Hiro Ito and Takahiro Ueda. How to solve the cake­-cutting problem in sublinear time
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
12:45 – 14:15 Lunch
14:15 – 15:15 Session 6

  • Stefan Langerman and Yushi Uno. Threes!, Fives, 1024!, and 2048 are Hard
  • Ahmed Abdelrazek, Aditya Acharya and Philip Dasler. 2048 Without New Tiles Is Still Hard
  • Neeldhara Misra. Two Dots is NP-­complete
16:00 Tour

Friday 10th June

09:00 – 10:00 Invited talk 3:
Chris Maslanka
Questions & Questings: A Life in Puzzles”
10:00 – 10:30 Coffee break
10:30 – 11:30 Session 7

  • Fabrizio Luccio. An Arithmetic for Rooted Trees
  • Jérémy Barbay. Bouncing Towers move faster than Hanoi Towers, but still require exponential time
  • Felix Herter and Günter Rote. Loopless Gray Code Enumeration and the Tower of Bucharest
11:30 – 11:45  Short break
11:45 – 12:45 Session 8

  • 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
  • Michael Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder and Thomas Stüber. Algorithms and Insights for RaceTrack
  • Erik D. Demaine, Fermi Ma, Erik Waingarten, Ariel Schvartzman and Scott Aaronson. The Fewest Clues Problem
12:45 – 14:15 Lunch