@Proceedings{ito_et_al:LIPIcs.FUN.2018,
title = {{LIPIcs, Volume 100, FUN'18, Complete Volume}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018},
URN = {urn:nbn:de:0030-drops-89311},
doi = {10.4230/LIPIcs.FUN.2018},
annote = {Keywords: Theory of computation, Complexity classes, Algorithm design techniques, Computability, Approximation algorithms analysis, Mathematics of computing}
}
@InProceedings{ito_et_al:LIPIcs.FUN.2018.0,
author = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {0:i--0:xi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.0},
URN = {urn:nbn:de:0030-drops-87914},
doi = {10.4230/LIPIcs.FUN.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{farachcolton:LIPIcs.FUN.2018.1,
author = {Farach-Colton, Mart{\'\i}n},
title = {{Mind the Gap}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.1},
URN = {urn:nbn:de:0030-drops-87924},
doi = {10.4230/LIPIcs.FUN.2018.1},
annote = {Keywords: library sort, Italian island, packed memory arrays, weight balanced trees, Italians know how to throw a conference}
}
@InProceedings{sugihara:LIPIcs.FUN.2018.2,
author = {Sugihara, Kokichi},
title = {{Evolution of Impossible Objects}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {2:1--2:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.2},
URN = {urn:nbn:de:0030-drops-87939},
doi = {10.4230/LIPIcs.FUN.2018.2},
annote = {Keywords: Ambiguous cylinder, anomalous picture, impossible motion, impossible object, optical illusion}
}
@InProceedings{abel_et_al:LIPIcs.FUN.2018.3,
author = {Abel, Zachary and Bosboom, Jeffrey and Demaine, Erik D. and Hamilton, Linus and Hesterberg, Adam and Kopinsky, Justin and Lynch, Jayson and Rudoy, Mikhail},
title = {{Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {3:1--3:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.3},
URN = {urn:nbn:de:0030-drops-87944},
doi = {10.4230/LIPIcs.FUN.2018.3},
annote = {Keywords: video games, puzzles, hardness}
}
@InProceedings{almanza_et_al:LIPIcs.FUN.2018.4,
author = {Almanza, Matteo and Leucci, Stefano and Panconesi, Alessandro},
title = {{Tracks from hell - when finding a proof may be easier than checking it}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.4},
URN = {urn:nbn:de:0030-drops-87954},
doi = {10.4230/LIPIcs.FUN.2018.4},
annote = {Keywords: puzzle games, solitaire games, Trainyard, verification}
}
@InProceedings{belmonte_et_al:LIPIcs.FUN.2018.5,
author = {Belmonte, R\'{e}my and Khosravian Ghadikolaei, Mehdi and Kiyomi, Masashi and Lampis, Michael and Otachi, Yota},
title = {{How Bad is the Freedom to Flood-It?}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.5},
URN = {urn:nbn:de:0030-drops-87961},
doi = {10.4230/LIPIcs.FUN.2018.5},
annote = {Keywords: flood-filling game, parameterized complexity}
}
@InProceedings{bermond_et_al:LIPIcs.FUN.2018.6,
author = {Bermond, Jean-Claude and Chaintreau, Augustin and Ducoffe, Guillaume and Mazauric, Dorian},
title = {{How long does it take for all users in a social network to choose their communities?}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {6:1--6:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.6},
URN = {urn:nbn:de:0030-drops-87972},
doi = {10.4230/LIPIcs.FUN.2018.6},
annote = {Keywords: communities, social networks, integer partitions, coloring games, graphs}
}
@InProceedings{bilo_et_al:LIPIcs.FUN.2018.7,
author = {Bil\`{o}, Davide and Gual\`{a}, Luciano and Leucci, Stefano and Misra, Neeldhara},
title = {{On the Complexity of Two Dots for Narrow Boards and Few Colors}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.7},
URN = {urn:nbn:de:0030-drops-87988},
doi = {10.4230/LIPIcs.FUN.2018.7},
annote = {Keywords: puzzle, NP-complete, perfect information, combinatorial game theory}
}
@InProceedings{bilo_et_al:LIPIcs.FUN.2018.8,
author = {Bil\`{o}, Davide and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Rossi, Mirko},
title = {{On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.8},
URN = {urn:nbn:de:0030-drops-87994},
doi = {10.4230/LIPIcs.FUN.2018.8},
annote = {Keywords: peg duotaire, pspace-completeness, peg solitaire, two-player games}
}
@InProceedings{bodlaender_et_al:LIPIcs.FUN.2018.9,
author = {Bodlaender, Hans L. and van der Zanden, Tom C.},
title = {{On the Exact Complexity of Polyomino Packing}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {9:1--9:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.9},
URN = {urn:nbn:de:0030-drops-88001},
doi = {10.4230/LIPIcs.FUN.2018.9},
annote = {Keywords: polyomino packing, exact complexity, exponential time hypothesis}
}
@InProceedings{boldi_et_al:LIPIcs.FUN.2018.10,
author = {Boldi, Paolo and Vigna, Sebastiano},
title = {{Kings, Name Days, Lazy Servants and Magic}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {10:1--10:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.10},
URN = {urn:nbn:de:0030-drops-88017},
doi = {10.4230/LIPIcs.FUN.2018.10},
annote = {Keywords: Suffix trees, suffix arrays, z-fast tries, prefix search}
}
@InProceedings{bosboom_et_al:LIPIcs.FUN.2018.11,
author = {Bosboom, Jeffrey and Demaine, Erik D. and Rudoy, Mikhail},
title = {{Computational Complexity of Generalized Push Fight}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {11:1--11:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.11},
URN = {urn:nbn:de:0030-drops-88029},
doi = {10.4230/LIPIcs.FUN.2018.11},
annote = {Keywords: board games, hardness, mate-in-one}
}
@InProceedings{botler_et_al:LIPIcs.FUN.2018.12,
author = {Botler, F\'{a}bio and Cristi, Andr\'{e}s and Hoeksma, Ruben and Schewior, Kevin and T\"{o}nnis, Andreas},
title = {{SUPERSET: A (Super)Natural Variant of the Card Game SET}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.12},
URN = {urn:nbn:de:0030-drops-88035},
doi = {10.4230/LIPIcs.FUN.2018.12},
annote = {Keywords: SET, SUPERSET, card game, cap set, affine geometry, computational complexity}
}
@InProceedings{bultel_et_al:LIPIcs.FUN.2018.13,
author = {Bultel, Xavier and Dreier, Jannik and Dumas, Jean-Guillaume and Lafourcade, Pascal},
title = {{A Cryptographer's Conspiracy Santa}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.13},
URN = {urn:nbn:de:0030-drops-88047},
doi = {10.4230/LIPIcs.FUN.2018.13},
annote = {Keywords: Secret Santa, Conspiracy Santa, Secure Multi-Party Computation, Cryptocurrency, Physical Cryptography}
}
@InProceedings{coulombe_et_al:LIPIcs.FUN.2018.14,
author = {Coulombe, Michael J. and Lynch, Jayson},
title = {{Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.14},
URN = {urn:nbn:de:0030-drops-88051},
doi = {10.4230/LIPIcs.FUN.2018.14},
annote = {Keywords: computational complexity, undecidable, team games, imperfect information}
}
@InProceedings{cui_et_al:LIPIcs.FUN.2018.15,
author = {Cui, Guangqi and Dickerson, John and Durvasula, Naveen and Gasarch, William and Metz, Erik and Prinz, Jacob and Raman, Naveen and Smolyak, Daniel and Yoo, Sung Hyun},
title = {{A Muffin-Theorem Generator}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.15},
URN = {urn:nbn:de:0030-drops-88062},
doi = {10.4230/LIPIcs.FUN.2018.15},
annote = {Keywords: Fair Division, Theorem Generation}
}
@InProceedings{czyzowicz_et_al:LIPIcs.FUN.2018.16,
author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil},
title = {{God Save the Queen}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.16},
URN = {urn:nbn:de:0030-drops-88074},
doi = {10.4230/LIPIcs.FUN.2018.16},
annote = {Keywords: Algorithm, Evacuation, Exit, Disk, Wireless Communication, Queen, Priority, Robots, Search, Servants, Trajectory}
}
@InProceedings{dehaan_et_al:LIPIcs.FUN.2018.17,
author = {de Haan, Ronald and Wolf, Petra},
title = {{Restricted Power - Computational Complexity Results for Strategic Defense Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.17},
URN = {urn:nbn:de:0030-drops-88082},
doi = {10.4230/LIPIcs.FUN.2018.17},
annote = {Keywords: Computational complexity, generalized games, metatheorems}
}
@InProceedings{demaine_et_al:LIPIcs.FUN.2018.18,
author = {Demaine, Erik D. and Grosof, Isaac and Lynch, Jayson and Rudoy, Mikhail},
title = {{Computational Complexity of Motion Planning of a Robot through Simple Gadgets}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {18:1--18:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.18},
URN = {urn:nbn:de:0030-drops-88098},
doi = {10.4230/LIPIcs.FUN.2018.18},
annote = {Keywords: PSPACE, hardness, motion planning, puzzles}
}
@InProceedings{demaine_et_al:LIPIcs.FUN.2018.19,
author = {Demaine, Erik D. and Lockhart, Joshua and Lynch, Jayson},
title = {{The Computational Complexity of Portal and Other 3D Video Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {19:1--19:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.19},
URN = {urn:nbn:de:0030-drops-88104},
doi = {10.4230/LIPIcs.FUN.2018.19},
annote = {Keywords: video games, hardness, motion planning, NP, PSPACE}
}
@InProceedings{eppstein:LIPIcs.FUN.2018.20,
author = {Eppstein, David},
title = {{Faster Evaluation of Subtraction Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {20:1--20:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.20},
URN = {urn:nbn:de:0030-drops-88119},
doi = {10.4230/LIPIcs.FUN.2018.20},
annote = {Keywords: subtraction games, Sprague-Grundy theory, nim-values}
}
@InProceedings{eppstein:LIPIcs.FUN.2018.21,
author = {Eppstein, David},
title = {{Making Change in 2048}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {21:1--21:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.21},
URN = {urn:nbn:de:0030-drops-88124},
doi = {10.4230/LIPIcs.FUN.2018.21},
annote = {Keywords: 2048, change-making problem, greedy algorithm, integer sequences, halting problem}
}
@InProceedings{hamann_et_al:LIPIcs.FUN.2018.22,
author = {Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
title = {{Pick, Pack, \& Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.22},
URN = {urn:nbn:de:0030-drops-88136},
doi = {10.4230/LIPIcs.FUN.2018.22},
annote = {Keywords: connected dominating set, online algorithm, competitive analysis, geometric graph, robot warehouse, recharging stations}
}
@InProceedings{holzer_et_al:LIPIcs.FUN.2018.23,
author = {Holzer, Markus and Maurer, Jan-Tobias},
title = {{Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {23:1--23:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.23},
URN = {urn:nbn:de:0030-drops-88146},
doi = {10.4230/LIPIcs.FUN.2018.23},
annote = {Keywords: selection, bogo-method, combinatorial sums and series,
inverse binomial coefficients, experimental result}
}
@InProceedings{iwamoto_et_al:LIPIcs.FUN.2018.24,
author = {Iwamoto, Chuzo and Haruishi, Masato and Ibusuki, Tatsuaki},
title = {{Herugolf and Makaro are NP-complete}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {24:1--24:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.24},
URN = {urn:nbn:de:0030-drops-88159},
doi = {10.4230/LIPIcs.FUN.2018.24},
annote = {Keywords: Herugolf, Makaro, pencil puzzle, NP-complete}
}
@InProceedings{kimura_et_al:LIPIcs.FUN.2018.25,
author = {Kimura, Kei and Kamehashi, Takuya and Fujito, Toshihiro},
title = {{The Fewest Clues Problem of Picross 3D}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.25},
URN = {urn:nbn:de:0030-drops-88168},
doi = {10.4230/LIPIcs.FUN.2018.25},
annote = {Keywords: Puzzle, computational complexity, fewest clues problem}
}
@InProceedings{kitamura_et_al:LIPIcs.FUN.2018.26,
author = {Kitamura, Naoki and Kawabata, Yuya and Izumi, Taisuke},
title = {{Uniform Distribution On Pachinko}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.26},
URN = {urn:nbn:de:0030-drops-88170},
doi = {10.4230/LIPIcs.FUN.2018.26},
annote = {Keywords: Pachinko, discrete mathematics}
}
@InProceedings{lafond:LIPIcs.FUN.2018.27,
author = {Lafond, Manuel},
title = {{The complexity of speedrunning video games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.27},
URN = {urn:nbn:de:0030-drops-88187},
doi = {10.4230/LIPIcs.FUN.2018.27},
annote = {Keywords: Approximation algorithms, parameterized complexity, video games, knapsack, feedback arc set}
}
@InProceedings{polishchuk_et_al:LIPIcs.FUN.2018.28,
author = {Polishchuk, Valentin and Sedov, Leonid},
title = {{Gender-Aware Facility Location in Multi-Gender World}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.28},
URN = {urn:nbn:de:0030-drops-88191},
doi = {10.4230/LIPIcs.FUN.2018.28},
annote = {Keywords: visibility, Strahler number, perfect tree, interval graphs, gender studies}
}
@InProceedings{sasaki_et_al:LIPIcs.FUN.2018.29,
author = {Sasaki, Tatsuya and Mizuki, Takaaki and Sone, Hideaki},
title = {{Card-Based Zero-Knowledge Proof for Sudoku}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {29:1--29:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.29},
URN = {urn:nbn:de:0030-drops-88207},
doi = {10.4230/LIPIcs.FUN.2018.29},
annote = {Keywords: Zero-knowledge proof, Card-based cryptography, Sudoku}
}
@InProceedings{schwahn_et_al:LIPIcs.FUN.2018.30,
author = {Schwahn, Florian D. and Thielen, Clemens},
title = {{The Complexity of Escaping Labyrinths and Enchanted Forests}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.30},
URN = {urn:nbn:de:0030-drops-88210},
doi = {10.4230/LIPIcs.FUN.2018.30},
annote = {Keywords: board games, combinatorial game theory, computational complexity}
}
@InProceedings{shinagawa_et_al:LIPIcs.FUN.2018.31,
author = {Shinagawa, Kazumasa and Mizuki, Takaaki},
title = {{Card-based Protocols Using Triangle Cards}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.31},
URN = {urn:nbn:de:0030-drops-88228},
doi = {10.4230/LIPIcs.FUN.2018.31},
annote = {Keywords: Cryptography without computer, Secure computation, Card-based protocols, Triangle cards, Three-valued computation, Secure matching problem}
}
@InProceedings{tamir:LIPIcs.FUN.2018.32,
author = {Tamir, Tami},
title = {{The Power of One Secret Agent}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.32},
URN = {urn:nbn:de:0030-drops-88237},
doi = {10.4230/LIPIcs.FUN.2018.32},
annote = {Keywords: Job scheduling games, Cost sharing, Equilibrium inefficiency}
}
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