HTML Export for FUN 2022

Copy to Clipboard Download

<h2>LIPIcs, Volume 226, FUN 2022</h2>
<ul>
<li>
    <span class="authors">Pierre Fraigniaud and Yushi Uno</span>
    <span class="title">LIPIcs, Volume 226, FUN 2022, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022">10.4230/LIPIcs.FUN.2022</a>
</li>
<li>
    <span class="authors">Pierre Fraigniaud and Yushi Uno</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.0">10.4230/LIPIcs.FUN.2022.0</a>
</li>
<li>
    <span class="authors">Hugo A. Akitaya, Maarten Löffler, and Giovanni Viglietta</span>
    <span class="title">Pushing Blocks by Sweeping Lines</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.1">10.4230/LIPIcs.FUN.2022.1</a>
</li>
<li>
    <span class="authors">Miguel Ambrona</span>
    <span class="title">A Practical Algorithm for Chess Unwinnability</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.2">10.4230/LIPIcs.FUN.2022.2</a>
</li>
<li>
    <span class="authors">Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan Hendrickson, and Jayson Lynch</span>
    <span class="title">Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.3">10.4230/LIPIcs.FUN.2022.3</a>
</li>
<li>
    <span class="authors">Marcella Anselmo, Manuela Flores, and Maria Madonia</span>
    <span class="title">Fun Slot Machines and Transformations of Words Avoiding Factors</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.4">10.4230/LIPIcs.FUN.2022.4</a>
</li>
<li>
    <span class="authors">N.R. Aravind, Neeldhara Misra, and Harshil Mittal</span>
    <span class="title">Chess Is Hard Even for a Single Player</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.5">10.4230/LIPIcs.FUN.2022.5</a>
</li>
<li>
    <span class="authors">Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O&#039;Rourke, Ryuhei Uehara, Yushi Uno, and Aaron Williams</span>
    <span class="title">Rolling Polyhedra on Tessellations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.6">10.4230/LIPIcs.FUN.2022.6</a>
</li>
<li>
    <span class="authors">Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, and Anissa Lamani</span>
    <span class="title">Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.7">10.4230/LIPIcs.FUN.2022.7</a>
</li>
<li>
    <span class="authors">Gerth Stølting Brodal</span>
    <span class="title">Priority Queues with Decreasing Keys</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.8">10.4230/LIPIcs.FUN.2022.8</a>
</li>
<li>
    <span class="authors">Xavier Bultel</span>
    <span class="title">Zero-Knowledge Proof of Knowledge for Peg Solitaire</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.9">10.4230/LIPIcs.FUN.2022.9</a>
</li>
<li>
    <span class="authors">Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng</span>
    <span class="title">Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.10">10.4230/LIPIcs.FUN.2022.10</a>
</li>
<li>
    <span class="authors">Kyle W. Burke, Matthew Ferland, and Shang-Hua Teng</span>
    <span class="title">Quantum-Inspired Combinatorial Games: Algorithms and Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.11">10.4230/LIPIcs.FUN.2022.11</a>
</li>
<li>
    <span class="authors">Jean-Claude Bermond, Frédéric Havet, and Michel Cosnard</span>
    <span class="title">Grabbing Olives on Linear Pizzas and Pissaladières</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.12">10.4230/LIPIcs.FUN.2022.12</a>
</li>
<li>
    <span class="authors">Justin Dallant and John Iacono</span>
    <span class="title">How Fast Can We Play Tetris Greedily with Rectangular Pieces?</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.13">10.4230/LIPIcs.FUN.2022.13</a>
</li>
<li>
    <span class="authors">Henning Fernau, Carolina Haase, and Stefan Hoffmann</span>
    <span class="title">The Synchronization Game on Subclasses of Automata</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.14">10.4230/LIPIcs.FUN.2022.14</a>
</li>
<li>
    <span class="authors">Samuel D. Hand, Jessica Enright, and Kitty Meeks</span>
    <span class="title">Making Life More Confusing for Firefighters</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.15">10.4230/LIPIcs.FUN.2022.15</a>
</li>
<li>
    <span class="authors">Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, and Ryo Yoshinaka</span>
    <span class="title">Sorting Balls and Water: Equivalence and Computational Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.16">10.4230/LIPIcs.FUN.2022.16</a>
</li>
<li>
    <span class="authors">James Koppel and Yun William Yu</span>
    <span class="title">Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic Sports</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.17">10.4230/LIPIcs.FUN.2022.17</a>
</li>
<li>
    <span class="authors">Manuel Lafond</span>
    <span class="title">How Brokers Can Optimally Abuse Traders</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.18">10.4230/LIPIcs.FUN.2022.18</a>
</li>
<li>
    <span class="authors">Daniel Lokshtanov and Bernardo Subercaseaux</span>
    <span class="title">Wordle Is NP-Hard</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.19">10.4230/LIPIcs.FUN.2022.19</a>
</li>
<li>
    <span class="authors">Roey Magen and Moni Naor</span>
    <span class="title">Mirror Games Against an Open Book Player</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.20">10.4230/LIPIcs.FUN.2022.20</a>
</li>
<li>
    <span class="authors">Fabien Mathieu and Sébastien Tixeuil</span>
    <span class="title">Fun with FUN</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.21">10.4230/LIPIcs.FUN.2022.21</a>
</li>
<li>
    <span class="authors">Arturo Merino, Torsten Mütze, and Aaron Williams</span>
    <span class="title">All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.22">10.4230/LIPIcs.FUN.2022.22</a>
</li>
<li>
    <span class="authors">Ami Paz and Liat Peterfreund</span>
    <span class="title">Playing Guess Who with Your Kids</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.23">10.4230/LIPIcs.FUN.2022.23</a>
</li>
<li>
    <span class="authors">Suthee Ruangwises and Toshiya Itoh</span>
    <span class="title">How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2022.24">10.4230/LIPIcs.FUN.2022.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