@Proceedings{demaine_et_al:LIPIcs.FUN.2016,
  title =	{{LIPIcs, Volume 49, FUN'16, Complete Volume}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016},
  URN =		{urn:nbn:de:0030-drops-60579},
  doi =		{10.4230/LIPIcs.FUN.2016},
  annote =	{Keywords: Nonnumerical Algorithms and Problems, Discrete Mathematics, Complexity Measures and Classes}
}
@InProceedings{demaine_et_al:LIPIcs.FUN.2016.0,
  author =	{Demaine, Erik D. and Grandoni, Fabrizio},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{0:i--0:xvi},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.0},
  URN =		{urn:nbn:de:0030-drops-58624},
  doi =		{10.4230/LIPIcs.FUN.2016.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abdelkader_et_al:LIPIcs.FUN.2016.1,
  author =	{Abdelkader, Ahmed and Acharya, Aditya and Dasler, Philip},
  title =	{{2048 Without New Tiles Is Still Hard}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{1:1--1:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.1},
  URN =		{urn:nbn:de:0030-drops-58858},
  doi =		{10.4230/LIPIcs.FUN.2016.1},
  annote =	{Keywords: Complexity of Games, 2048}
}
@InProceedings{almanza_et_al:LIPIcs.FUN.2016.2,
  author =	{Almanza, Matteo and Leucci, Stefano and Panconesi, Alessandro},
  title =	{{Trainyard is NP-hard}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{2:1--2:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.2},
  URN =		{urn:nbn:de:0030-drops-58796},
  doi =		{10.4230/LIPIcs.FUN.2016.2},
  annote =	{Keywords: Complexity of Games, Trainyard}
}
@InProceedings{bacciu_et_al:LIPIcs.FUN.2016.3,
  author =	{Bacciu, Davide and Gervasi, Vincenzo and Prencipe, Giuseppe},
  title =	{{LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{3:1--3:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.3},
  URN =		{urn:nbn:de:0030-drops-58823},
  doi =		{10.4230/LIPIcs.FUN.2016.3},
  annote =	{Keywords: deep learning, recurrent neural networks, dimensionality reduction algorithms}
}
@InProceedings{baffier_et_al:LIPIcs.FUN.2016.4,
  author =	{Baffier, Jean-Francois and Chiu, Man-Kwun and Diez, Yago and Korman, Matias and Mitsou, Valia and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Uno, Yushi},
  title =	{{Hanabi is NP-complete, Even for Cheaters who Look at Their Cards}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{4:1--4:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.4},
  URN =		{urn:nbn:de:0030-drops-58644},
  doi =		{10.4230/LIPIcs.FUN.2016.4},
  annote =	{Keywords: algorithmic combinatorial game theory, sorting}
}
@InProceedings{barbay:LIPIcs.FUN.2016.5,
  author =	{Barbay, J\'{e}r\'{e}my},
  title =	{{Selenite Towers Move Faster Than Hano\"{i} Towers, But Still Require Exponential Time}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{5:1--5:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.5},
  URN =		{urn:nbn:de:0030-drops-58729},
  doi =		{10.4230/LIPIcs.FUN.2016.5},
  annote =	{Keywords: Br\"{a}hma tower, Disk Pile, Hanoi Tower, Levitating Tower, Recursivity}
}
@InProceedings{bekos_et_al:LIPIcs.FUN.2016.6,
  author =	{Bekos, Michael A. and Bruckdorfer, Till and F\"{o}rster, Henry and Kaufmann, Michael and Poschenrieder, Simon and St\"{u}ber, Thomas},
  title =	{{Algorithms and Insights for RaceTrack}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{6:1--6:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.6},
  URN =		{urn:nbn:de:0030-drops-58818},
  doi =		{10.4230/LIPIcs.FUN.2016.6},
  annote =	{Keywords: Racetrack, State-graph, complexity}
}
@InProceedings{bender_et_al:LIPIcs.FUN.2016.7,
  author =	{Bender, Michael A. and McCauley, Samuel and Simon, Bertrand and Singh, Shikha and Vivien, Fr\'{e}d\'{e}ric},
  title =	{{Resource Optimization for Program Committee Members: A Subreview Article}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{7:1--7:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.7},
  URN =		{urn:nbn:de:0030-drops-58872},
  doi =		{10.4230/LIPIcs.FUN.2016.7},
  annote =	{Keywords: Scheduling, Delegation, Subreviews}
}
@InProceedings{bultel_et_al:LIPIcs.FUN.2016.8,
  author =	{Bultel, Xavier and Dreier, Jannik and Dumas, Jean-Guillaume and Lafourcade, Pascal},
  title =	{{Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and  KenKen}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{8:1--8:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.8},
  URN =		{urn:nbn:de:0030-drops-58693},
  doi =		{10.4230/LIPIcs.FUN.2016.8},
  annote =	{Keywords: Physical Cryptography, ZKP, Games, Akari, Kakuro, KenKen, Takuzu}
}
@InProceedings{cambi_et_al:LIPIcs.FUN.2016.9,
  author =	{Cambi, Francesco and Crescenzi, Pierluigi and Pagli, Linda},
  title =	{{Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{9:1--9:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.9},
  URN =		{urn:nbn:de:0030-drops-58777},
  doi =		{10.4230/LIPIcs.FUN.2016.9},
  annote =	{Keywords: text mining, incremental clustering, on-line news}
}
@InProceedings{cohen_et_al:LIPIcs.FUN.2016.10,
  author =	{Cohen, Nathann and Hilaire, Mathieu and Martins, N{\'\i}colas A. and Nisse, Nicolas and P\'{e}rennes, St\'{e}phane},
  title =	{{Spy-Game on Graphs}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{10:1--10:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.10},
  URN =		{urn:nbn:de:0030-drops-58782},
  doi =		{10.4230/LIPIcs.FUN.2016.10},
  annote =	{Keywords: graph, two-player games, cops and robber games, complexity}
}
@InProceedings{debiasi_et_al:LIPIcs.FUN.2016.11,
  author =	{De Biasi, Marzio and Ophelders, Tim},
  title =	{{The Complexity of Snake}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{11:1--11:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.11},
  URN =		{urn:nbn:de:0030-drops-58841},
  doi =		{10.4230/LIPIcs.FUN.2016.11},
  annote =	{Keywords: Games, Puzzles, Motion Planning, Nondeterministic Constraint Logic, PSPACE}
}
@InProceedings{demaine_et_al:LIPIcs.FUN.2016.12,
  author =	{Demaine, Erik D. and Ma, Fermi and Schvartzman, Ariel and Waingarten, Erik and Aaronson, Scott},
  title =	{{The Fewest Clues Problem}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{12:1--12:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.12},
  URN =		{urn:nbn:de:0030-drops-58654},
  doi =		{10.4230/LIPIcs.FUN.2016.12},
  annote =	{Keywords: computational complexity, pencil-and-paper puzzles, hardness reductions}
}
@InProceedings{demaine_et_al:LIPIcs.FUN.2016.13,
  author =	{Demaine, Erik D. and Viglietta, Giovanni and Williams, Aaron},
  title =	{{Super Mario Bros. is Harder/Easier Than We Thought}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{13:1--13:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.13},
  URN =		{urn:nbn:de:0030-drops-58802},
  doi =		{10.4230/LIPIcs.FUN.2016.13},
  annote =	{Keywords: video games, computational complexity, PSPACE}
}
@InProceedings{diluna_et_al:LIPIcs.FUN.2016.14,
  author =	{Di Luna, Giuseppe A. and Flocchini, Paola and Prencipe, Giuseppe and Santoro, Nicola and Viglietta, Giovanni},
  title =	{{A Rupestrian Algorithm}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{14:1--14:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.14},
  URN =		{urn:nbn:de:0030-drops-58751},
  doi =		{10.4230/LIPIcs.FUN.2016.14},
  annote =	{Keywords: mobile finite-state machines, self-healing distributed algorithms}
}
@InProceedings{enright_et_al:LIPIcs.FUN.2016.15,
  author =	{Enright, Jessica and Faben, John D.},
  title =	{{Building a Better Mouse Maze}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{15:1--15:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.15},
  URN =		{urn:nbn:de:0030-drops-58743},
  doi =		{10.4230/LIPIcs.FUN.2016.15},
  annote =	{Keywords: graph, evolutionary, genetic algorithm, traversal}
}
@InProceedings{evans_et_al:LIPIcs.FUN.2016.16,
  author =	{Evans, William and van Garderen, Mereke and L\"{o}ffler, Maarten and Polishchuk, Valentin},
  title =	{{Recognizing a DOG is Hard, But Not When It is Thin and Unit}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{16:1--16:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.16},
  URN =		{urn:nbn:de:0030-drops-58671},
  doi =		{10.4230/LIPIcs.FUN.2016.16},
  annote =	{Keywords: graph drawing, planar graphs, disk intersection graphs}
}
@InProceedings{fleischer:LIPIcs.FUN.2016.17,
  author =	{Fleischer, Rudolf},
  title =	{{Counting Circles Without Computing Them}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{17:1--17:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.17},
  URN =		{urn:nbn:de:0030-drops-58767},
  doi =		{10.4230/LIPIcs.FUN.2016.17},
  annote =	{Keywords: lines arrangement, triangle, circumcircle, inscribed angle theorem}
}
@InProceedings{guala_et_al:LIPIcs.FUN.2016.18,
  author =	{Gual\`{a}, Luciano and Leucci, Stefano and Natale, Emanuele and Tauraso, Roberto},
  title =	{{Large Peg-Army Maneuvers}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{18:1--18:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.18},
  URN =		{urn:nbn:de:0030-drops-58709},
  doi =		{10.4230/LIPIcs.FUN.2016.18},
  annote =	{Keywords: Complexity of Games, Solitaire Army}
}
@InProceedings{herter_et_al:LIPIcs.FUN.2016.19,
  author =	{Herter, Felix and Rote, G\"{u}nter},
  title =	{{Loopless Gray Code Enumeration and the Tower of Bucharest}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{19:1--19:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.19},
  URN =		{urn:nbn:de:0030-drops-58863},
  doi =		{10.4230/LIPIcs.FUN.2016.19},
  annote =	{Keywords: Tower of Hanoi, Gray code, enumeration, loopless generation}
}
@InProceedings{horiyama_et_al:LIPIcs.FUN.2016.20,
  author =	{Horiyama, Takashi and Uehara, Ryuhei and Hosoya, Haruo},
  title =	{{Convex Configurations on Nana-kin-san Puzzle}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{20:1--20:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.20},
  URN =		{urn:nbn:de:0030-drops-58730},
  doi =		{10.4230/LIPIcs.FUN.2016.20},
  annote =	{Keywords: silhouette puzzles, nana-kin-san puzzle, enumeration algorithm, convex polygon}
}
@InProceedings{ito_et_al:LIPIcs.FUN.2016.21,
  author =	{Ito, Hiro and Ueda, Takahiro},
  title =	{{How to Solve the Cake-Cutting Problem in Sublinear Time}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{21:1--21:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.21},
  URN =		{urn:nbn:de:0030-drops-58639},
  doi =		{10.4230/LIPIcs.FUN.2016.21},
  annote =	{Keywords: sublinear-time algorithms, cake-cutting problem, simple fair, preassign, approximation}
}
@InProceedings{langerman_et_al:LIPIcs.FUN.2016.22,
  author =	{Langerman, Stefan and Uno, Yushi},
  title =	{{Threes!, Fives, 1024!, and 2048 are Hard}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{22:1--22:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.22},
  URN =		{urn:nbn:de:0030-drops-58661},
  doi =		{10.4230/LIPIcs.FUN.2016.22},
  annote =	{Keywords: algorithmic combinatorial game theory}
}
@InProceedings{luccio:LIPIcs.FUN.2016.23,
  author =	{Luccio, Fabrizio},
  title =	{{An Arithmetic for Rooted Trees}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{23:1--23:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.23},
  URN =		{urn:nbn:de:0030-drops-58687},
  doi =		{10.4230/LIPIcs.FUN.2016.23},
  annote =	{Keywords: Arithmetic, Rooted tree, Prime tree, Tree equation}
}
@InProceedings{misra:LIPIcs.FUN.2016.24,
  author =	{Misra, Neeldhara},
  title =	{{Two Dots is NP-complete}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{24:1--24:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.24},
  URN =		{urn:nbn:de:0030-drops-58831},
  doi =		{10.4230/LIPIcs.FUN.2016.24},
  annote =	{Keywords: combinatorial game theory, NP-complete, perfect information, puzzle}
}
@InProceedings{neumann_et_al:LIPIcs.FUN.2016.25,
  author =	{Neumann, Stefan and Wiese, Andreas},
  title =	{{This House Proves That Debating is Harder Than Soccer}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{25:1--25:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Demaine, Erik D. and Grandoni, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.25},
  URN =		{urn:nbn:de:0030-drops-58716},
  doi =		{10.4230/LIPIcs.FUN.2016.25},
  annote =	{Keywords: complexity, elimination games, soccer, debating}
}