<h2>LIPIcs, Volume 157, FUN 2021</h2>
<ul>
<li>
<span class="authors">Martin Farach-Colton, Giuseppe Prencipe, and Ryuhei Uehara</span>
<span class="title">LIPIcs, Volume 157, FUN 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021">10.4230/LIPIcs.FUN.2021</a>
</li>
<li>
<span class="authors">Martin Farach-Colton, Giuseppe Prencipe, and Ryuhei Uehara</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.0">10.4230/LIPIcs.FUN.2021.0</a>
</li>
<li>
<span class="authors">Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, and Jayson Lynch</span>
<span class="title">Tatamibari Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.1">10.4230/LIPIcs.FUN.2021.1</a>
</li>
<li>
<span class="authors">Aris Anagnostopoulos, Aristides Gionis, and Nikos Parotsidis</span>
<span class="title">Collaborative Procrastination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.2">10.4230/LIPIcs.FUN.2021.2</a>
</li>
<li>
<span class="authors">Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yenhenii Diomidov, Dylan Hendrickson, and Jayson Lynch</span>
<span class="title">Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.3">10.4230/LIPIcs.FUN.2021.3</a>
</li>
<li>
<span class="authors">Juan Jose Besa, Timothy Johnson, Nil Mamano, and Martha C. Osegueda</span>
<span class="title">Taming the Knight’s Tour: Minimizing Turns and Crossings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.4">10.4230/LIPIcs.FUN.2021.4</a>
</li>
<li>
<span class="authors">Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, and Giacomo Scornavacca</span>
<span class="title">Cutting Bamboo down to Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.5">10.4230/LIPIcs.FUN.2021.5</a>
</li>
<li>
<span class="authors">Quentin Bramas, Pascal Lafourcade, and Stéphane Devismes</span>
<span class="title">Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.6">10.4230/LIPIcs.FUN.2021.6</a>
</li>
<li>
<span class="authors">Josh Brunner, Lily Chung, Erik D. Demaine, Dylan Hendrickson, Adam Hesterberg, Adam Suhl, and Avi Zeff</span>
<span class="title">1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.7">10.4230/LIPIcs.FUN.2021.7</a>
</li>
<li>
<span class="authors">Josh Brunner and Julian Wellman</span>
<span class="title">An Optimal Algorithm for Online Freeze-Tag</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.8">10.4230/LIPIcs.FUN.2021.8</a>
</li>
<li>
<span class="authors">Alex Churchill, Stella Biderman, and Austin Herrick</span>
<span class="title">Magic: The Gathering Is Turing Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.9">10.4230/LIPIcs.FUN.2021.9</a>
</li>
<li>
<span class="authors">Trevor Clokie, Thomas F. Lidbetter, Antonio J. Molina Lovett, Jeffrey Shallit, and Leon Witzman</span>
<span class="title">Computational Fun with Sturdy and Flimsy Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.10">10.4230/LIPIcs.FUN.2021.10</a>
</li>
<li>
<span class="authors">Loïc Crombez, Guilherme D. da Fonseca, and Yan Gerard</span>
<span class="title">Efficient Algorithms for Battleship</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.11">10.4230/LIPIcs.FUN.2021.11</a>
</li>
<li>
<span class="authors">Ross Dempsey and Charles Guinn</span>
<span class="title">A Phase Transition in Minesweeper</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.12">10.4230/LIPIcs.FUN.2021.12</a>
</li>
<li>
<span class="authors">David Eppstein, Daniel Frishberg, and William Maxwell</span>
<span class="title">On the Treewidth of Hanoi Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.13">10.4230/LIPIcs.FUN.2021.13</a>
</li>
<li>
<span class="authors">Fabian Frei, Peter Rossmanith, and David Wehner</span>
<span class="title">An Open Pouring Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.14">10.4230/LIPIcs.FUN.2021.14</a>
</li>
<li>
<span class="authors">Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, and Remco J. A. Surtel</span>
<span class="title">Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.15">10.4230/LIPIcs.FUN.2021.15</a>
</li>
<li>
<span class="authors">Tomasz Idziaszek</span>
<span class="title">Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.16">10.4230/LIPIcs.FUN.2021.16</a>
</li>
<li>
<span class="authors">Alexander Koch and Stefan Walzer</span>
<span class="title">Foundations for Actively Secure Card-Based Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.17">10.4230/LIPIcs.FUN.2021.17</a>
</li>
<li>
<span class="authors">Eryk Kopczyński</span>
<span class="title">Hyperbolic Minesweeper Is in P</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.18">10.4230/LIPIcs.FUN.2021.18</a>
</li>
<li>
<span class="authors">William Kuszmaul</span>
<span class="title">Train Tracks with Gaps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.19">10.4230/LIPIcs.FUN.2021.19</a>
</li>
<li>
<span class="authors">Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, and Hideaki Sone</span>
<span class="title">Card-Based ZKP Protocols for Takuzu and Juosan</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.20">10.4230/LIPIcs.FUN.2021.20</a>
</li>
<li>
<span class="authors">Gennaro Cordasco, Luisa Gargano, and Adele A. Rescigno</span>
<span class="title">Speeding up Networks Mining via Neighborhood Diversity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.21">10.4230/LIPIcs.FUN.2021.21</a>
</li>
<li>
<span class="authors">Suthee Ruangwises and Toshiya Itoh</span>
<span class="title">Physical Zero-Knowledge Proof for Numberlink</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.22">10.4230/LIPIcs.FUN.2021.22</a>
</li>
<li>
<span class="authors">Jérémy Barbay and Bernardo Subercaseaux</span>
<span class="title">The Computational Complexity of Evil Hangman</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.23">10.4230/LIPIcs.FUN.2021.23</a>
</li>
<li>
<span class="authors">Qian M. Zhou, Aiden Calvert, and Maxwell Young</span>
<span class="title">Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2021.24">10.4230/LIPIcs.FUN.2021.24</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing