LIPIcs, Volume 157, FUN 2021

• Martin Farach-Colton, Giuseppe Prencipe, and Ryuhei Uehara LIPIcs, Volume 157, FUN 2021, Complete Volume 10.4230/LIPIcs.FUN.2021
• Martin Farach-Colton, Giuseppe Prencipe, and Ryuhei Uehara Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FUN.2021.0
• Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, and Jayson Lynch Tatamibari Is NP-Complete 10.4230/LIPIcs.FUN.2021.1
• Aris Anagnostopoulos, Aristides Gionis, and Nikos Parotsidis Collaborative Procrastination 10.4230/LIPIcs.FUN.2021.2
• Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yenhenii Diomidov, Dylan Hendrickson, and Jayson Lynch Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets 10.4230/LIPIcs.FUN.2021.3
• Juan Jose Besa, Timothy Johnson, Nil Mamano, and Martha C. Osegueda Taming the Knight’s Tour: Minimizing Turns and Crossings 10.4230/LIPIcs.FUN.2021.4
• Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, and Giacomo Scornavacca Cutting Bamboo down to Size 10.4230/LIPIcs.FUN.2021.5
• Quentin Bramas, Pascal Lafourcade, and Stéphane Devismes Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots 10.4230/LIPIcs.FUN.2021.6
• Josh Brunner, Lily Chung, Erik D. Demaine, Dylan Hendrickson, Adam Hesterberg, Adam Suhl, and Avi Zeff 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete 10.4230/LIPIcs.FUN.2021.7
• Josh Brunner and Julian Wellman An Optimal Algorithm for Online Freeze-Tag 10.4230/LIPIcs.FUN.2021.8
• Alex Churchill, Stella Biderman, and Austin Herrick Magic: The Gathering Is Turing Complete 10.4230/LIPIcs.FUN.2021.9
• Trevor Clokie, Thomas F. Lidbetter, Antonio J. Molina Lovett, Jeffrey Shallit, and Leon Witzman Computational Fun with Sturdy and Flimsy Numbers 10.4230/LIPIcs.FUN.2021.10
• Loïc Crombez, Guilherme D. da Fonseca, and Yan Gerard Efficient Algorithms for Battleship 10.4230/LIPIcs.FUN.2021.11
• Ross Dempsey and Charles Guinn A Phase Transition in Minesweeper 10.4230/LIPIcs.FUN.2021.12
• David Eppstein, Daniel Frishberg, and William Maxwell On the Treewidth of Hanoi Graphs 10.4230/LIPIcs.FUN.2021.13
• Fabian Frei, Peter Rossmanith, and David Wehner An Open Pouring Problem 10.4230/LIPIcs.FUN.2021.14
• Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, and Remco J. A. Surtel Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard 10.4230/LIPIcs.FUN.2021.15
• Tomasz Idziaszek Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation 10.4230/LIPIcs.FUN.2021.16
• Alexander Koch and Stefan Walzer Foundations for Actively Secure Card-Based Cryptography 10.4230/LIPIcs.FUN.2021.17
• Eryk Kopczyński Hyperbolic Minesweeper Is in P 10.4230/LIPIcs.FUN.2021.18
• William Kuszmaul Train Tracks with Gaps 10.4230/LIPIcs.FUN.2021.19
• Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, and Hideaki Sone Card-Based ZKP Protocols for Takuzu and Juosan 10.4230/LIPIcs.FUN.2021.20
• Gennaro Cordasco, Luisa Gargano, and Adele A. Rescigno Speeding up Networks Mining via Neighborhood Diversity 10.4230/LIPIcs.FUN.2021.21
• Suthee Ruangwises and Toshiya Itoh Physical Zero-Knowledge Proof for Numberlink 10.4230/LIPIcs.FUN.2021.22
• Jérémy Barbay and Bernardo Subercaseaux The Computational Complexity of Evil Hangman 10.4230/LIPIcs.FUN.2021.23
• Qian M. Zhou, Aiden Calvert, and Maxwell Young Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds 10.4230/LIPIcs.FUN.2021.24