<h2>LIPIcs, Volume 100, FUN 2018</h2>
<ul>
<li>
<span class="authors">Hiro Ito, Stefano Leonardi, Linda Pagli, and Giuseppe Prencipe</span>
<span class="title">LIPIcs, Volume 100, FUN'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018">10.4230/LIPIcs.FUN.2018</a>
</li>
<li>
<span class="authors">Hiro Ito, Stefano Leonardi, Linda Pagli, and Giuseppe Prencipe</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.0">10.4230/LIPIcs.FUN.2018.0</a>
</li>
<li>
<span class="authors">Martín Farach-Colton</span>
<span class="title">Mind the Gap (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.1">10.4230/LIPIcs.FUN.2018.1</a>
</li>
<li>
<span class="authors">Kokichi Sugihara</span>
<span class="title">Evolution of Impossible Objects (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.2">10.4230/LIPIcs.FUN.2018.2</a>
</li>
<li>
<span class="authors">Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, and Mikhail Rudoy</span>
<span class="title">Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.3">10.4230/LIPIcs.FUN.2018.3</a>
</li>
<li>
<span class="authors">Matteo Almanza, Stefano Leucci, and Alessandro Panconesi</span>
<span class="title">Tracks from hell - when finding a proof may be easier than checking it</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.4">10.4230/LIPIcs.FUN.2018.4</a>
</li>
<li>
<span class="authors">Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, and Yota Otachi</span>
<span class="title">How Bad is the Freedom to Flood-It?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.5">10.4230/LIPIcs.FUN.2018.5</a>
</li>
<li>
<span class="authors">Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, and Dorian Mazauric</span>
<span class="title">How long does it take for all users in a social network to choose their communities?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.6">10.4230/LIPIcs.FUN.2018.6</a>
</li>
<li>
<span class="authors">Davide Bilò, Luciano Gualà, Stefano Leucci, and Neeldhara Misra</span>
<span class="title">On the Complexity of Two Dots for Narrow Boards and Few Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.7">10.4230/LIPIcs.FUN.2018.7</a>
</li>
<li>
<span class="authors">Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, and Mirko Rossi</span>
<span class="title">On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.8">10.4230/LIPIcs.FUN.2018.8</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender and Tom C. van der Zanden</span>
<span class="title">On the Exact Complexity of Polyomino Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.9">10.4230/LIPIcs.FUN.2018.9</a>
</li>
<li>
<span class="authors">Paolo Boldi and Sebastiano Vigna</span>
<span class="title">Kings, Name Days, Lazy Servants and Magic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.10">10.4230/LIPIcs.FUN.2018.10</a>
</li>
<li>
<span class="authors">Jeffrey Bosboom, Erik D. Demaine, and Mikhail Rudoy</span>
<span class="title">Computational Complexity of Generalized Push Fight</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.11">10.4230/LIPIcs.FUN.2018.11</a>
</li>
<li>
<span class="authors">Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, and Andreas Tönnis</span>
<span class="title">SUPERSET: A (Super)Natural Variant of the Card Game SET</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.12">10.4230/LIPIcs.FUN.2018.12</a>
</li>
<li>
<span class="authors">Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, and Pascal Lafourcade</span>
<span class="title">A Cryptographer's Conspiracy Santa</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.13">10.4230/LIPIcs.FUN.2018.13</a>
</li>
<li>
<span class="authors">Michael J. Coulombe and Jayson Lynch</span>
<span class="title">Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.14">10.4230/LIPIcs.FUN.2018.14</a>
</li>
<li>
<span class="authors">Guangqi Cui, John Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, and Sung Hyun Yoo</span>
<span class="title">A Muffin-Theorem Generator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.15">10.4230/LIPIcs.FUN.2018.15</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende</span>
<span class="title">God Save the Queen</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.16">10.4230/LIPIcs.FUN.2018.16</a>
</li>
<li>
<span class="authors">Ronald de Haan and Petra Wolf</span>
<span class="title">Restricted Power - Computational Complexity Results for Strategic Defense Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.17">10.4230/LIPIcs.FUN.2018.17</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Isaac Grosof, Jayson Lynch, and Mikhail Rudoy</span>
<span class="title">Computational Complexity of Motion Planning of a Robot through Simple Gadgets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.18">10.4230/LIPIcs.FUN.2018.18</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Joshua Lockhart, and Jayson Lynch</span>
<span class="title">The Computational Complexity of Portal and Other 3D Video Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.19">10.4230/LIPIcs.FUN.2018.19</a>
</li>
<li>
<span class="authors">David Eppstein</span>
<span class="title">Faster Evaluation of Subtraction Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.20">10.4230/LIPIcs.FUN.2018.20</a>
</li>
<li>
<span class="authors">David Eppstein</span>
<span class="title">Making Change in 2048</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.21">10.4230/LIPIcs.FUN.2018.21</a>
</li>
<li>
<span class="authors">Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby</span>
<span class="title">Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>
</li>
<li>
<span class="authors">Markus Holzer and Jan-Tobias Maurer</span>
<span class="title">Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.23">10.4230/LIPIcs.FUN.2018.23</a>
</li>
<li>
<span class="authors">Chuzo Iwamoto, Masato Haruishi, and Tatsuaki Ibusuki</span>
<span class="title">Herugolf and Makaro are NP-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.24">10.4230/LIPIcs.FUN.2018.24</a>
</li>
<li>
<span class="authors">Kei Kimura, Takuya Kamehashi, and Toshihiro Fujito</span>
<span class="title">The Fewest Clues Problem of Picross 3D</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.25">10.4230/LIPIcs.FUN.2018.25</a>
</li>
<li>
<span class="authors">Naoki Kitamura, Yuya Kawabata, and Taisuke Izumi</span>
<span class="title">Uniform Distribution On Pachinko</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.26">10.4230/LIPIcs.FUN.2018.26</a>
</li>
<li>
<span class="authors">Manuel Lafond</span>
<span class="title">The complexity of speedrunning video games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.27">10.4230/LIPIcs.FUN.2018.27</a>
</li>
<li>
<span class="authors">Valentin Polishchuk and Leonid Sedov</span>
<span class="title">Gender-Aware Facility Location in Multi-Gender World</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.28">10.4230/LIPIcs.FUN.2018.28</a>
</li>
<li>
<span class="authors">Tatsuya Sasaki, Takaaki Mizuki, and Hideaki Sone</span>
<span class="title">Card-Based Zero-Knowledge Proof for Sudoku</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.29">10.4230/LIPIcs.FUN.2018.29</a>
</li>
<li>
<span class="authors">Florian D. Schwahn and Clemens Thielen</span>
<span class="title">The Complexity of Escaping Labyrinths and Enchanted Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.30">10.4230/LIPIcs.FUN.2018.30</a>
</li>
<li>
<span class="authors">Kazumasa Shinagawa and Takaaki Mizuki</span>
<span class="title">Card-based Protocols Using Triangle Cards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.31">10.4230/LIPIcs.FUN.2018.31</a>
</li>
<li>
<span class="authors">Tami Tamir</span>
<span class="title">The Power of One Secret Agent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2018.32">10.4230/LIPIcs.FUN.2018.32</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