FUN 2016 June 8−10, 2016 - La Maddalena, Italy

8th International Conference on Fun with Algorithms (FUN 2016)



Erik D. Demaine and Fabrizio Grandoni (Eds.)
ISBN 978-3-95977-005-7, LIPICS Vol. 49 ISSN 1868-8969
Additional Information
License
Conference Website
Complete volume (PDF, 22 MB)
Search Publication Server


Authors
  • Aaronson, Scott
  • Abdelkader, Ahmed
  • Acharya, Aditya
  • Almanza, Matteo
  • Bacciu, Davide
  • Baffier, Jean-Francois
  • Barbay, Jérémy
  • Bekos, Michael A.
  • Bender, Michael A.
  • Bruckdorfer, Till
  • Bultel, Xavier
  • Cambi, Francesco
  • Chiu, Man-Kwun
  • Cohen, Nathann
  • Crescenzi, Pierluigi
  • Dasler, Philip
  • De Biasi, Marzio
  • Demaine, Erik D.
  • Diez, Yago
  • Di Luna, Giuseppe A.
  • Dreier, Jannik
  • Dumas, Jean-Guillaume
  • Enright, Jessica
  • Evans, William
  • Förster, Henry
  • Faben, John D.
  • Fleischer, Rudolf
  • Flocchini, Paola
  • Gervasi, Vincenzo
  • Grandoni, Fabrizio
  • Gualà, Luciano
  • Herter, Felix
  • Hilaire, Mathieu
  • Horiyama, Takashi
  • Hosoya, Haruo
  • Ito, Hiro
  • Kaufmann, Michael
  • Korman, Matias
  • Löffler, Maarten
  • Lafourcade, Pascal
  • Langerman, Stefan
  • Leucci, Stefano
  • Luccio, Fabrizio
  • Ma, Fermi
  • Martins, Nícolas A.
  • McCauley, Samuel
  • Misra, Neeldhara
  • Mitsou, Valia
  • Natale, Emanuele
  • Neumann, Stefan
  • Nisse, Nicolas
  • Ophelders, Tim
  • Pérennes, Stéphane
  • Pagli, Linda
  • Panconesi, Alessandro
  • Polishchuk, Valentin
  • Poschenrieder, Simon
  • Prencipe, Giuseppe
  • Roeloffzen, Marcel
  • Rote, Günter
  • Santoro, Nicola
  • Schvartzman, Ariel
  • Simon, Bertrand
  • Singh, Shikha
  • Stüber, Thomas
  • Tauraso, Roberto
  • Ueda, Takahiro
  • Uehara, Ryuhei
  • Uno, Yushi
  • van Garderen, Mereke
  • van Renssen, André
  • Viglietta, Giovanni
  • Vivien, Frédéric
  • Waingarten, Erik
  • Wiese, Andreas
  • Williams, Aaron

  •   
    Front Matter, Table of Contents, Preface, Conference Organization
    Authors: Demaine, Erik D. ; Grandoni, Fabrizio

    Abstract | Document (310 KB) | BibTeX

    2048 Without New Tiles Is Still Hard
    Authors: Abdelkader, Ahmed ; Acharya, Aditya ; Dasler, Philip

    Abstract | Document (2,738 KB) | BibTeX

    Trainyard is NP-hard
    Authors: Almanza, Matteo ; Leucci, Stefano ; Panconesi, Alessandro

    Abstract | Document (2,445 KB) | BibTeX

    LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?
    Authors: Bacciu, Davide ; Gervasi, Vincenzo ; Prencipe, Giuseppe

    Abstract | Document (1,426 KB) | BibTeX

    Hanabi is NP-complete, Even for Cheaters who Look at Their Cards
    Authors: Baffier, Jean-Francois ; Chiu, Man-Kwun ; Diez, Yago ; Korman, Matias ; Mitsou, Valia ; van Renssen, André ; Roeloffzen, Marcel ; Uno, Yushi

    Abstract | Document (559 KB) | BibTeX

    Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
    Authors: Barbay, Jérémy

    Abstract | Document (635 KB) | BibTeX

    Algorithms and Insights for RaceTrack
    Authors: Bekos, Michael A. ; Bruckdorfer, Till ; Förster, Henry ; Kaufmann, Michael ; Poschenrieder, Simon ; Stüber, Thomas

    Abstract | Document (862 KB) | BibTeX

    Resource Optimization for Program Committee Members: A Subreview Article
    Authors: Bender, Michael A. ; McCauley, Samuel ; Simon, Bertrand ; Singh, Shikha ; Vivien, Frédéric

    Abstract | Document (566 KB) | BibTeX

    Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen
    Authors: Bultel, Xavier ; Dreier, Jannik ; Dumas, Jean-Guillaume ; Lafourcade, Pascal

    Abstract | Document (598 KB) | BibTeX

    Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering
    Authors: Cambi, Francesco ; Crescenzi, Pierluigi ; Pagli, Linda

    Abstract | Document (2,582 KB) | BibTeX

    Spy-Game on Graphs
    Authors: Cohen, Nathann ; Hilaire, Mathieu ; Martins, Nícolas A. ; Nisse, Nicolas ; Pérennes, Stéphane

    Abstract | Document (483 KB) | BibTeX

    The Complexity of Snake
    Authors: De Biasi, Marzio ; Ophelders, Tim

    Abstract | Document (637 KB) | BibTeX

    The Fewest Clues Problem
    Authors: Demaine, Erik D. ; Ma, Fermi ; Schvartzman, Ariel ; Waingarten, Erik ; Aaronson, Scott

    Abstract | Document (583 KB) | BibTeX

    Super Mario Bros. is Harder/Easier Than We Thought
    Authors: Demaine, Erik D. ; Viglietta, Giovanni ; Williams, Aaron

    Abstract | Document (559 KB) | BibTeX

    A Rupestrian Algorithm
    Authors: Di Luna, Giuseppe A. ; Flocchini, Paola ; Prencipe, Giuseppe ; Santoro, Nicola ; Viglietta, Giovanni

    Abstract | Document (959 KB) | BibTeX

    Building a Better Mouse Maze
    Authors: Enright, Jessica ; Faben, John D.

    Abstract | Document (530 KB) | BibTeX

    Recognizing a DOG is Hard, But Not When It is Thin and Unit
    Authors: Evans, William ; van Garderen, Mereke ; Löffler, Maarten ; Polishchuk, Valentin

    Abstract | Document (576 KB) | BibTeX

    Counting Circles Without Computing Them
    Authors: Fleischer, Rudolf

    Abstract | Document (402 KB) | BibTeX

    Large Peg-Army Maneuvers
    Authors: Gualà, Luciano ; Leucci, Stefano ; Natale, Emanuele ; Tauraso, Roberto

    Abstract | Document (673 KB) | BibTeX

    Loopless Gray Code Enumeration and the Tower of Bucharest
    Authors: Herter, Felix ; Rote, Günter

    Abstract | Document (1,109 KB) | BibTeX

    Convex Configurations on Nana-kin-san Puzzle
    Authors: Horiyama, Takashi ; Uehara, Ryuhei ; Hosoya, Haruo

    Abstract | Document (829 KB) | BibTeX

    How to Solve the Cake-Cutting Problem in Sublinear Time
    Authors: Ito, Hiro ; Ueda, Takahiro

    Abstract | Document (1,642 KB) | BibTeX

    Threes!, Fives, 1024!, and 2048 are Hard
    Authors: Langerman, Stefan ; Uno, Yushi

    Abstract | Document (927 KB) | BibTeX

    An Arithmetic for Rooted Trees
    Authors: Luccio, Fabrizio

    Abstract | Document (570 KB) | BibTeX

    Two Dots is NP-complete
    Authors: Misra, Neeldhara

    Abstract | Document (713 KB) | BibTeX

    This House Proves That Debating is Harder Than Soccer
    Authors: Neumann, Stefan ; Wiese, Andreas

    Abstract | Document (529 KB) | BibTeX

      




    DROPS-Home | Fulltext Search | Imprint Published by LZI