×

8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. (English) Zbl 1351.68013

LIPIcs – Leibniz International Proceedings in Informatics 49. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). 25 articles, not consecutively paged, electronic only, open access (2016).

Show indexed articles as search result.

The articles of mathematical interest will be reviewed individually. For the preceding conference see [Zbl 1305.68022].
Indexed articles:
Abdelkader, Ahmed; Acharya, Aditya; Dasler, Philip, 2048 without new tiles is still hard, Article 1, 14 p. [Zbl 1369.68223]
Almanza, Matteo; Leucci, Stefano; Panconesi, Alessandro, Trainyard is NP-hard, Article 2, 14 p. [Zbl 1369.68225]
Baffier, Jean-Francois; Chiu, Man-Kwun; Diez, Yago; Korman, Matias; Mitsou, Valia; Van Renssen, André; Roeloffzen, Marcel; Uno, Yushi, Hanabi is NP-complete, even for cheaters who look at their cards, Article 4, 17 p. [Zbl 1369.68228]
Barbay, Jérémy, Selenite towers move faster than Hanoï towers, but still require exponential time, Article 5, 20 p. [Zbl 1369.68231]
Bekos, Michael A.; Bruckdorfer, Till; Förster, Henry; Kaufmann, Michael; Poschenrieder, Simon; Stüber, Thomas, Algorithms and insights for RaceTrack, Article 6, 14 p. [Zbl 1369.68232]
Bender, Michael A.; McCauley, Samuel; Simon, Bertrand; Singh, Shikha; Vivien, Frédéric, Resource optimization for program committee members: a subreview article, Article 7, 20 p. [Zbl 1369.91104]
Bultel, Xavier; Dreier, Jannik; Dumas, Jean-Guillaume; Lafourcade, Pascal, Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen, Article 8, 20 p. [Zbl 1369.91037]
Cohen, Nathann; Hilaire, Mathieu; Martins, Nícolas A.; Nisse, Nicolas; Pérennes, Stéphane, Spy-game on graphs, Article 10, 16 p. [Zbl 1369.91034]
De Biasi, Marzio; Ophelders, Tim, The complexity of Snake, Article 11, 13 p. [Zbl 1369.68235]
Demaine, Erik D.; Ma, Fermi; Schvartzman, Ariel; Waingarten, Erik; Aaronson, Scott, The fewest clues problem, Article 12, 12 p. [Zbl 1369.68236]
Demaine, Erik D.; Viglietta, Giovanni; Williams, Aaron, Super Mario Bros. is harder/easier than we thought, Article 13, 14 p. [Zbl 1369.68237]
Di Luna, Giuseppe A.; Flocchini, Paola; Prencipe, Giuseppe; Santoro, Nicola; Viglietta, Giovanni, A rupestrian algorithm, Article 14, 20 p. [Zbl 1369.68343]
Enright, Jessica; Faben, John D., Building a better Mouse Maze, Article 15, 12 p. [Zbl 1369.68306]
Evans, William; Van Garderen, Mereke; Löffler, Maarten; Polishchuk, Valentin, Recognizing a DOG is hard, but not when it is thin and unit, Article 16, 12 p. [Zbl 1369.68269]
Fleischer, Rudolf, Counting circles without computing them, Article 17, 7 p. [Zbl 1369.68266]
Gualà, Luciano; Leucci, Stefano; Natale, Emanuele; Tauraso, Roberto, Large peg-army maneuvers, Article 18, 15 p. [Zbl 1369.68242]
Herter, Felix; Rote, Günter, Loopless Gray code enumeration and the Tower of Bucharest, Article 19, 19 p. [Zbl 1369.68267]
Horiyama, Takashi; Uehara, Ryuhei; Hosoya, Haruo, Convex configurations on Nana-kin-san puzzle, Article 20, 14 p. [Zbl 1369.68342]
Ito, Hiro; Ueda, Takahiro, How to solve the cake-cutting problem in sublinear time, Article 21, 15 p. [Zbl 1369.91106]
Langerman, Stefan; Uno, Yushi, Threes!, Fives, 1024!, and 2048 are hard, Article 22, 14 p. [Zbl 1369.68243]
Luccio, Fabrizio, An arithmetic for rooted trees, Article 23, 14 p. [Zbl 1368.05024]
Misra, Neeldhara, Two Dots is NP-complete, Article 24, 12 p. [Zbl 1369.68218]
Neumann, Stefan; Wiese, Andreas, This house proves that debating is harder than soccer, Article 25, 14 p. [Zbl 1369.68245]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDFBibTeX XMLCite
Full Text: Link Link