Table of Contents

• Turing Completeness of GNU find: From mkdir-Assisted Loops to Standalone ComputationKeigo Oka. [doi]
• 77 Shades of GreyQuentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade 0001, Anissa Lamani. [doi]
• Weak Binary Search TreesTobias Lauer. [doi]
• A Demigod's Number for the Rubik's CubeArturo Merino, Bernardo Subercaseaux. [doi]
• When Locality Implies Globality: Card-Based ZKP Protocol for Shakashaka PuzzleDaiki Miyahara, Léo Robert, Pascal Lafourcade 0001, Shohei Kaneko. [doi]
• Playing President with Virtual Players: How to Play Multiple Cards of a KindDaiki Miyahara, Pascal Lafourcade 0001, Takaaki Mizuki, Kazumasa Shinagawa. [doi]
• The Careless Coupon Collector's ProblemEmilio Cruciani, Aditi Dudeja. [doi]
• A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic PuzzlesBrynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della H. Hendrickson, Tonan Kamata, Ryuhei Uehara. [doi]
• Finding Maximum and Minimum Size Matrices: The Algorithmic Complexity of Coding ChallengesAbdelrahman Abdelmonsef, Xingyu Dong, Daniel Prusa, Michael Wehar, Chen Xu. [doi]
• The Berlin Safe House Puzzle: Spycraft via Interval GraphsGennaro Cordasco, Luisa Gargano, Adele Anna Rescigno. [doi]
• On the Complexity of the Maker-Breaker Happy Vertex GameMathieu Hilaire, Perig Montfort, Nacim Oijid. [doi]
• Nemesis, an Escape Game in GraphsPierre Bergé, Antoine Dailly, Yan Gerard. [doi]
• Directed Grabbing Games or How to Politely Grab the Maximum Number of Olives in a ReceptionJean-Claude Bermond, Michel Cosnard, Frédéric Havet, Takako Kodate, Stéphane Pérennes. [doi]
• An Almost-Optimal Upper Bound on the Push Number of the Torus PuzzleMatteo Caporrella, Stefano Leucci 0001. [doi]
• Lozenge Tiling by Computing DistancesJean-Marie Favreau, Yan Gerard, Pascal Lafourcade 0001, Léo Robert. [doi]
• Sinks and Ladders: ARRIVAL and SSG with Two Vertices per LevelBernd Gärtner, Sebastian Haslebacher, Hung P. Hoang 0001. [doi]
• 1038 A10s Fit into One A0Noel Friedrich. [doi]
• Replacing Cops with ZombiesFengyi Liu, Avery Miller. [doi]
• An ASP-Completeness Framework for Dynasty PuzzlesKosuke Susukita. [doi]
• Pyramid Schemes for Eating M&Ms: Enumeration, Generation, and Gray CodesElizabeth J. Hartung, Brett Stevens, Aaron Williams 0001. [doi]
• Hive Is PSPACE-HardDaniël I. Andel, Benjamin G. Rin. [doi]
• Endgames in Fog of War ChessMatthias Gehnen, Julius Stannat. [doi]
• Tetris Is Hard with Just One Piece TypeMIT Hardness Group, Josh Brunner, Erik D. Demaine, Della H. Hendrickson, Jeffery Li. [doi]
• Card-Based ZKP Protocols for Connectivity-Based Puzzles: Extending to Tree Structures with Application to NurimeizuDaiki Miyahara, Pascal Lafourcade 0001, Maxime Puys. [doi]
• Permutation Match Puzzles: How Young Tanvi Learned About Computational ComplexityKshitij Gajjar, Neeldhara Misra. [doi]
• Spells for Quantum Programmers: Expressive High-Level Commands in QutesSimone Faro, Francesco Pio Marino, Gabriele Messina 0002. [doi]
• Man, These New York Times Games Are Hard! A Computational PerspectiveAlessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini, Daniele Muscillo, Alessandro Panconesi, Erasmo Tani. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Covering a Polyomino-Shaped Stain with Non-Overlapping Identical StickersKeigo Oka, Naoki Inaba, Akira Iino. [doi]
• Solving Small Rubik's Cubes as Slowly as PossibleJenny Quan, Noah Kim, Bernardo Subercaseaux, John Mackey. [doi]
• Sorting Magazines and BoxesGabriele Fici, Manal Mohamed 0001, Jakub Radoszewski. [doi]
• MIDTERM Is a Deterministic Technique to Exit Recursive MazesCharles Bouillaguet, Orel Cosseron. [doi]
• Token Positional GamesGuillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalacki, Nacim Oijid. [doi]
• Finding Shortest Walks in Kuru Kuru KururinMickaël Laurent, Maher Mallem. [doi]
• Ferry Cover with Connectivity ConstraintsNiranjan Balachandran, Ankita Dargad, Urban Larsson, Neeldhara Misra, Umesh Shankar. [doi]
• The Closed Hull Game and the Closed Interval GameSamuel N. Araújo, Fabrício Benevides, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio. [doi]
• Hexasort - the Complexity of Stacking Colors on GraphsLinus Klocker, Simon Dominik Fink. [doi]
• Price of Locality in Permutation Mastermind: Are TikTok Influencers Chaotic Enough?Bernardo Subercaseaux. [doi]
• Computational Complexity of Swish Is SolvedTakashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki 0001, Ryuhei Uehara, Yutaro Yamaguchi 0001. [doi]
• Completing the Complexity Classification of 2-Solo Chess: Knights and Kings Are HardKolja Kühn, Wendy Yi. [doi]
• The Quaternary Gray Code and Ziggu PuzzlesMadeleine Goertz, Aaron Williams 0001. [doi]