Accepted Papers

• Weak Binary Search Trees — Tobias Lauer.

• The Closed Hull Game and the Closed Interval Game — Tobias Lauer, Samuel Araujo, Fabricio Benevides, Nicolas Martins, Nicolas Nisse, Rudini Sampaio.

• Man, these New York Times games are hard! A computational perspective — Alessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini, Daniele Muscillo, Alessandro Panconesi, Erasmo Tani.

• Tetris is Hard with Just One Piece Type — MIT Hardness Group, Josh Brunner, Erik Demaine, Della Hendrickson, Jeffery Li.

• Hive is PSPACE-Hard — Benjamin G. Rin, Daniël Andel.

• Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard — Kolja Kühn, Wendy Yi.

• Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers — Keigo Oka, Naoki Inaba, Akira Iino.

• Lozenge Tilings by Computing Distances — Yan Gerard, Jean-Marie Favreau, Pascal Lafourcade, Léo Robert.

• Nemesis, an Escape Game in Graphs — Yan Gerard, Pierre Bergé, Antoine Dailly.

• On the complexity of the Maker-Breaker happy vertex game — Mathieu Hilaire, Perig Montfort, Nacim Oijid.

• Finding Shortest Walks in Kuru Kuru Kururin — Mickaël Laurent, Maher Mallem.

• MIDTERM Is a Deterministic Technique to Exit Recursive Mazes — Charles Bouillaguet, Orel Cosseron.

• 1038 A10s fit into one A0 — Friedrich Noel.

• Turing Completeness of GNU find: From mkdir-assisted Loops to Standalone Computation — Keigo Oka.

• Directed grabbing games or how to politely grab the maximum number of olives in a reception — Jean-Claude Bermond, Michel Cosnard, Frédéric Havet, Takako, Kodate, Stéphane Perennes.

• Hexasort- The Complexity of Stacking Colors on Graphs — Linus Klocker, Simon Dominik Fink.

• An ASP-Completeness Framework for Dynasty Puzzles — Kosuke Susukita.

• Sorting Some Home Stuff Intuitively — Gabriele Fici, Manal Mohamed, Jakub Radoszewski.

• An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle — Matteo Caporrella, Stefano Leucci.

• Spells for Quantum Programmers: Expressive High-Level Commands in Qutes — Simone Faro, Francesco Pio Marino, Gabriele Messina.

• A Bookworm Climbs Up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles — Brynmor Chapman, Lily Chung, Erik D. Demaine, Della Hendrickson, Yota Irino, Tonan Kamata, Ryuhei Uehara.

• When Locality Implies Globality: Card-based ZKP Protocol for Shakashaka Puzzle — Daiki Miyahara, Léo Robert, Pascal Lafourcade, Shohei Kaneko.

• The Careless Coupon Collector’s Problem — Emilio Cruciani, Aditi Dudeja.

• Playing President with Virtual Players: How to Play Multiple Cards of a Kind — Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki, Kazmasa Shinagawa.

• Fog of War Chess — Matthias Gehnen, Julius Stannat.

• Finding Maximum and Minimum Size Matrices: The Algorithmic Complexity of Coding Challenges — Abdelrahman Abdelmonsef, Xingyu Dong, Daniel Průša, Michael Wehar, Chen Xu.

• Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level — Bernd Gärtner, Sebastian Haslebacher, Hung Hoang.

• 77 Shades of Grey — Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani.

• Token positional games — Guillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalački, Nacim Oijid.

• Replacing Cops with Zombies — Avery Miller, Fengyi Liu.

• A Demigod’s Number for the Rubik’s Cube — Arturo Merino, Bernardo Subercaseaux.

• Pyramid Schemes for Eating M&Ms: Enumeration, Generation, and Gray Codes — Liz Hartung, Brett Stevens, Aaron Williams.

• The Quaternary Gray Code and how it can be used to solve Ziggurat and other Ziggu Puzzles — Madeleine Goertz, Aaron Williams,

• Solving Rubik’s Cubes as Slowly as Possible — Jenny Quan, Bernardo Subercaseaux, Noah Kim, John Mackey.

• Locality in Permutation Mastermind: Are TikTok influencers Chaotic Enough? — Bernardo Subercaseaux.

• Ferry Cover with Connectivity Constraints — Neeldhara Misra, Urban Larsson, Umesh Shankar, Niranjan Balachandran, Ankita Dargad.

• Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity — Neeldhara Misra, Kshitij Gajjar.

• Computational Complexity of Swish Is Solved — Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi.

• Card-Based ZKP Protocols for Connectivity-Based Puzzles: Extending to Tree Structures with Application to Nurimeizu — Daiki Miyahara, Pascal Lafourcade, Maxime Puys.

• The Berlin Safe House Puzzle: Spycraft via Interval Graphs — Luisa Gargano, Gennaro Cordasco, Adele Anna Rescigno.