| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2026 | An ASP-Completeness Framework for Dynasty Puzzles. | Kosuke Susukita |
| 2026 | Price of Locality in Permutation Mastermind: Are TikTok Influencers Chaotic Enough? | Bernardo Subercaseaux |
| 2026 | Solving Small Rubik's Cubes as Slowly as Possible. | Jenny Quan, Noah Kim, Bernardo Subercaseaux, John Mackey |
| 2026 | Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers. | Keigo Oka, Naoki Inaba, Akira Iino |
| 2026 | Turing Completeness of GNU find: From mkdir-Assisted Loops to Standalone Computation. | Keigo Oka |
| 2026 | When Locality Implies Globality: Card-Based ZKP Protocol for Shakashaka Puzzle. | Daiki Miyahara, Lo Robert, Pascal Lafourcade, Shohei Kaneko |
| 2026 | Card-Based ZKP Protocols for Connectivity-Based Puzzles: Extending to Tree Structures with Application to Nurimeizu. | Daiki Miyahara, Pascal Lafourcade, Maxime Puys |
| 2026 | Playing President with Virtual Players: How to Play Multiple Cards of a Kind. | Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki, Kazumasa Shinagawa |
| 2026 | A Demigod's Number for the Rubik's Cube. | Arturo Merino, Bernardo Subercaseaux |
| 2026 | Replacing Cops with Zombies. | Fengyi Liu, Avery Miller |
| 2026 | Finding Shortest Walks in Kuru Kuru Kururin. | Mickal Laurent, Maher Mallem |
| 2026 | Weak Binary Search Trees. | Tobias Lauer |
| 2026 | Completing the Complexity Classification of 2-Solo Chess: Knights and Kings Are Hard. | Kolja Khn, Wendy Yi |
| 2026 | Hexasort - the Complexity of Stacking Colors on Graphs. | Linus Klocker, Simon Dominik Fink |
| 2026 | Computational Complexity of Swish Is Solved. | Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi |
| 2026 | On the Complexity of the Maker-Breaker Happy Vertex Game. | Mathieu Hilaire, Perig Montfort, Nacim Oijid |
| 2026 | Pyramid Schemes for Eating M&Ms: Enumeration, Generation, and Gray Codes. | Elizabeth J. Hartung, Brett Stevens, Aaron Williams |
| 2026 | Tetris Is Hard with Just One Piece Type. | MIT Hardness Group, Josh Brunner, Erik D. Demaine, Della H. Hendrickson, Jeffery Li |
| 2026 | The Quaternary Gray Code and Ziggu Puzzles. | Madeleine Goertz, Aaron Williams |
| 2026 | Endgames in Fog of War Chess. | Matthias Gehnen, Julius Stannat |
| 2026 | Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level. | Bernd Grtner, Sebastian Haslebacher, Hung P. Hoang |
| 2026 | Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity. | Kshitij Gajjar, Neeldhara Misra |
| 2026 | 1038 A10s Fit into One A0. | Noel Friedrich |
| 2026 | Sorting Magazines and Boxes. | Gabriele Fici, Manal Mohamed, Jakub Radoszewski |