Abstract is missing.
- A Phase Transition in MinesweeperRoss Dempsey, Charles Guinn. [doi]
- Computational Fun with Sturdy and Flimsy NumbersTrevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman. [doi]
- Taming the Knight's Tour: Minimizing Turns and CrossingsJuan José Besa Vial, Timothy Johnson, Nil Mamano, Martha C. Osegueda. [doi]
- Hyperbolic Minesweeper Is in PEryk Kopczynski. [doi]
- Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-HardThomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, Remco J. A. Surtel. [doi]
- Tatamibari Is NP-CompleteAviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch. [doi]
- Physical Zero-Knowledge Proof for NumberlinkSuthee Ruangwises, Toshiya Itoh. [doi]
- 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-CompleteJosh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff. [doi]
- An Open Pouring ProblemFabian Frei, Peter Rossmanith, David Wehner. [doi]
- The Computational Complexity of Evil HangmanJérémy Barbay, Bernardo Subercaseaux. [doi]
- Card-Based ZKP Protocols for Takuzu and JuosanDaiki Miyahara, Léo Robert, Pascal Lafourcade 0001, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone. [doi]
- Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff BoundsQian M. Zhou, Aiden Calvert, Maxwell Young. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Magic: The Gathering Is Turing CompleteAlex Churchill, Stella Biderman, Austin Herrick. [doi]
- Finding Water on Poleless Using Melomaniac Myopic Chameleon RobotsQuentin Bramas, Pascal Lafourcade 0001, Stéphane Devismes. [doi]
- Efficient Algorithms for BattleshipLoïc Crombez, Guilherme Dias da Fonseca, Yan Gerard. [doi]
- An Optimal Algorithm for Online Freeze-TagJosh Brunner, Julian Wellman. [doi]
- Foundations for Actively Secure Card-Based CryptographyAlexander Koch 0001, Stefan Walzer. [doi]
- Cutting Bamboo down to SizeDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Giacomo Scornavacca. [doi]
- On the Treewidth of Hanoi GraphsDavid Eppstein, Daniel Frishberg, William Maxwell. [doi]
- Collaborative ProcrastinationAris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis. [doi]
- Speeding up Networks Mining via Neighborhood DiversityGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. [doi]
- Train Tracks with GapsWilliam Kuszmaul. [doi]
- Efficient Algorithm for Multiplication of Numbers in Zeckendorf RepresentationTomasz Idziaszek. [doi]
- Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door GadgetsJoshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. [doi]