<h2>LIPIcs, Volume 49, FUN 2016</h2>
<ul>
<li>
<span class="authors">Erik D. Demaine and Fabrizio Grandoni</span>
<span class="title">LIPIcs, Volume 49, FUN'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016">10.4230/LIPIcs.FUN.2016</a>
</li>
<li>
<span class="authors">Erik D. Demaine and Fabrizio Grandoni</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.0">10.4230/LIPIcs.FUN.2016.0</a>
</li>
<li>
<span class="authors">Ahmed Abdelkader, Aditya Acharya, and Philip Dasler</span>
<span class="title">2048 Without New Tiles Is Still Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.1">10.4230/LIPIcs.FUN.2016.1</a>
</li>
<li>
<span class="authors">Matteo Almanza, Stefano Leucci, and Alessandro Panconesi</span>
<span class="title">Trainyard is NP-hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.2">10.4230/LIPIcs.FUN.2016.2</a>
</li>
<li>
<span class="authors">Davide Bacciu, Vincenzo Gervasi, and Giuseppe Prencipe</span>
<span class="title">LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.3">10.4230/LIPIcs.FUN.2016.3</a>
</li>
<li>
<span class="authors">Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, and Yushi Uno</span>
<span class="title">Hanabi is NP-complete, Even for Cheaters who Look at Their Cards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.4">10.4230/LIPIcs.FUN.2016.4</a>
</li>
<li>
<span class="authors">Jérémy Barbay</span>
<span class="title">Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.5">10.4230/LIPIcs.FUN.2016.5</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, and Thomas Stüber</span>
<span class="title">Algorithms and Insights for RaceTrack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.6">10.4230/LIPIcs.FUN.2016.6</a>
</li>
<li>
<span class="authors">Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, and Frédéric Vivien</span>
<span class="title">Resource Optimization for Program Committee Members: A Subreview Article</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.7">10.4230/LIPIcs.FUN.2016.7</a>
</li>
<li>
<span class="authors">Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, and Pascal Lafourcade</span>
<span class="title">Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.8">10.4230/LIPIcs.FUN.2016.8</a>
</li>
<li>
<span class="authors">Francesco Cambi, Pierluigi Crescenzi, and Linda Pagli</span>
<span class="title">Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.9">10.4230/LIPIcs.FUN.2016.9</a>
</li>
<li>
<span class="authors">Nathann Cohen, Mathieu Hilaire, Nícolas A. Martins, Nicolas Nisse, and Stéphane Pérennes</span>
<span class="title">Spy-Game on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.10">10.4230/LIPIcs.FUN.2016.10</a>
</li>
<li>
<span class="authors">Marzio De Biasi and Tim Ophelders</span>
<span class="title">The Complexity of Snake</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.11">10.4230/LIPIcs.FUN.2016.11</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, and Scott Aaronson</span>
<span class="title">The Fewest Clues Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.12">10.4230/LIPIcs.FUN.2016.12</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Giovanni Viglietta, and Aaron Williams</span>
<span class="title">Super Mario Bros. is Harder/Easier Than We Thought</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.13">10.4230/LIPIcs.FUN.2016.13</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta</span>
<span class="title">A Rupestrian Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.14">10.4230/LIPIcs.FUN.2016.14</a>
</li>
<li>
<span class="authors">Jessica Enright and John D. Faben</span>
<span class="title">Building a Better Mouse Maze</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.15">10.4230/LIPIcs.FUN.2016.15</a>
</li>
<li>
<span class="authors">William Evans, Mereke van Garderen, Maarten Löffler, and Valentin Polishchuk</span>
<span class="title">Recognizing a DOG is Hard, But Not When It is Thin and Unit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.16">10.4230/LIPIcs.FUN.2016.16</a>
</li>
<li>
<span class="authors">Rudolf Fleischer</span>
<span class="title">Counting Circles Without Computing Them</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.17">10.4230/LIPIcs.FUN.2016.17</a>
</li>
<li>
<span class="authors">Luciano Gualà, Stefano Leucci, Emanuele Natale, and Roberto Tauraso</span>
<span class="title">Large Peg-Army Maneuvers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.18">10.4230/LIPIcs.FUN.2016.18</a>
</li>
<li>
<span class="authors">Felix Herter and Günter Rote</span>
<span class="title">Loopless Gray Code Enumeration and the Tower of Bucharest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.19">10.4230/LIPIcs.FUN.2016.19</a>
</li>
<li>
<span class="authors">Takashi Horiyama, Ryuhei Uehara, and Haruo Hosoya</span>
<span class="title">Convex Configurations on Nana-kin-san Puzzle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.20">10.4230/LIPIcs.FUN.2016.20</a>
</li>
<li>
<span class="authors">Hiro Ito and Takahiro Ueda</span>
<span class="title">How to Solve the Cake-Cutting Problem in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.21">10.4230/LIPIcs.FUN.2016.21</a>
</li>
<li>
<span class="authors">Stefan Langerman and Yushi Uno</span>
<span class="title">Threes!, Fives, 1024!, and 2048 are Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.22">10.4230/LIPIcs.FUN.2016.22</a>
</li>
<li>
<span class="authors">Fabrizio Luccio</span>
<span class="title">An Arithmetic for Rooted Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.23">10.4230/LIPIcs.FUN.2016.23</a>
</li>
<li>
<span class="authors">Neeldhara Misra</span>
<span class="title">Two Dots is NP-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.24">10.4230/LIPIcs.FUN.2016.24</a>
</li>
<li>
<span class="authors">Stefan Neumann and Andreas Wiese</span>
<span class="title">This House Proves That Debating is Harder Than Soccer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FUN.2016.25">10.4230/LIPIcs.FUN.2016.25</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