default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th FUN 2016: La Maddalena, Italy
- Erik D. Demaine, Fabrizio Grandoni:
8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy. LIPIcs 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-005-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Ahmed Abdelkader, Aditya Acharya, Philip Dasler
:
2048 Without New Tiles Is Still Hard. 1:1-1:14 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-hard. 2:1-2:14 - Davide Bacciu, Vincenzo Gervasi, Giuseppe Prencipe:
LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?. 3:1-3:15 - Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. 4:1-4:17 - Jérémy Barbay:
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time. 5:1-5:20 - Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber:
Algorithms and Insights for RaceTrack. 6:1-6:14 - Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frédéric Vivien:
Resource Optimization for Program Committee Members: A Subreview Article. 7:1-7:20 - Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. 8:1-8:20 - Francesco Cambi, Pierluigi Crescenzi, Linda Pagli:
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. 9:1-9:14 - Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. 10:1-10:16 - Marzio De Biasi, Tim Ophelders:
The Complexity of Snake. 11:1-11:13 - Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The Fewest Clues Problem. 12:1-12:12 - Erik D. Demaine, Giovanni Viglietta, Aaron Williams:
Super Mario Bros. is Harder/Easier Than We Thought. 13:1-13:14 - Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
A Rupestrian Algorithm. 14:1-14:20 - Jessica A. Enright, John D. Faben:
Building a Better Mouse Maze. 15:1-15:12 - William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk:
Recognizing a DOG is Hard, But Not When It is Thin and Unit. 16:1-16:12 - Rudolf Fleischer:
Counting Circles Without Computing Them. 17:1-17:7 - Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. 18:1-18:15 - Felix Herter, Günter Rote:
Loopless Gray Code Enumeration and the Tower of Bucharest. 19:1-19:19 - Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya:
Convex Configurations on Nana-kin-san Puzzle. 20:1-20:14 - Hiro Ito, Takahiro Ueda:
How to Solve the Cake-Cutting Problem in Sublinear Time. 21:1-21:15 - Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. 22:1-22:14 - Fabrizio Luccio:
An Arithmetic for Rooted Trees. 23:1-23:14 - Neeldhara Misra:
Two Dots is NP-complete. 24:1-24:12 - Stefan Neumann, Andreas Wiese:
This House Proves That Debating is Harder Than Soccer. 25:1-25:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
