@Proceedings{farachcolton_et_al:LIPIcs.FUN.2021,
title = {{LIPIcs, Volume 157, FUN 2021, Complete Volume}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {1--416},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021},
URN = {urn:nbn:de:0030-drops-127602},
doi = {10.4230/LIPIcs.FUN.2021},
annote = {Keywords: LIPIcs, Volume 157, FUN 2021, Complete Volume}
}
@InProceedings{farachcolton_et_al:LIPIcs.FUN.2021.0,
author = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.0},
URN = {urn:nbn:de:0030-drops-127613},
doi = {10.4230/LIPIcs.FUN.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{adler_et_al:LIPIcs.FUN.2021.1,
author = {Adler, Aviv and Bosboom, Jeffrey and Demaine, Erik D. and Demaine, Martin L. and Liu, Quanquan C. and Lynch, Jayson},
title = {{Tatamibari Is NP-Complete}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {1:1--1:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.1},
URN = {urn:nbn:de:0030-drops-127624},
doi = {10.4230/LIPIcs.FUN.2021.1},
annote = {Keywords: Nikoli puzzles, NP-hardness, rectangle covering}
}
@InProceedings{anagnostopoulos_et_al:LIPIcs.FUN.2021.2,
author = {Anagnostopoulos, Aris and Gionis, Aristides and Parotsidis, Nikos},
title = {{Collaborative Procrastination}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {2:1--2:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.2},
URN = {urn:nbn:de:0030-drops-127634},
doi = {10.4230/LIPIcs.FUN.2021.2},
annote = {Keywords: time-inconsistent planning, computational behavioral science, collaborative work, collaborative environments}
}
@InProceedings{ani_et_al:LIPIcs.FUN.2021.3,
author = {Ani, Joshua and Bosboom, Jeffrey and Demaine, Erik D. and Diomidov, Yenhenii and Hendrickson, Dylan and Lynch, Jayson},
title = {{Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {3:1--3:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.3},
URN = {urn:nbn:de:0030-drops-127642},
doi = {10.4230/LIPIcs.FUN.2021.3},
annote = {Keywords: gadgets, motion planning, hardness of games}
}
@InProceedings{besa_et_al:LIPIcs.FUN.2021.4,
author = {Besa, Juan Jose and Johnson, Timothy and Mamano, Nil and Osegueda, Martha C.},
title = {{Taming the Knight’s Tour: Minimizing Turns and Crossings}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.4},
URN = {urn:nbn:de:0030-drops-127654},
doi = {10.4230/LIPIcs.FUN.2021.4},
annote = {Keywords: Graph Drawing, Chess, Hamiltonian Cycle, Approximation Algorithms}
}
@InProceedings{bilo_et_al:LIPIcs.FUN.2021.5,
author = {Bil\`{o}, Davide and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Scornavacca, Giacomo},
title = {{Cutting Bamboo down to Size}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.5},
URN = {urn:nbn:de:0030-drops-127663},
doi = {10.4230/LIPIcs.FUN.2021.5},
annote = {Keywords: bamboo garden trimming, trimming oracles, approximation algorithms, pinwheel scheduling}
}
@InProceedings{bramas_et_al:LIPIcs.FUN.2021.6,
author = {Bramas, Quentin and Lafourcade, Pascal and Devismes, St\'{e}phane},
title = {{Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.6},
URN = {urn:nbn:de:0030-drops-127674},
doi = {10.4230/LIPIcs.FUN.2021.6},
annote = {Keywords: Luminous Robots, Grid, Infinite Exploration, Treasure Search Problem}
}
@InProceedings{brunner_et_al:LIPIcs.FUN.2021.7,
author = {Brunner, Josh and Chung, Lily and Demaine, Erik D. and Hendrickson, Dylan and Hesterberg, Adam and Suhl, Adam and Zeff, Avi},
title = {{1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.7},
URN = {urn:nbn:de:0030-drops-127681},
doi = {10.4230/LIPIcs.FUN.2021.7},
annote = {Keywords: puzzles, sliding blocks, PSPACE-hardness}
}
@InProceedings{brunner_et_al:LIPIcs.FUN.2021.8,
author = {Brunner, Josh and Wellman, Julian},
title = {{An Optimal Algorithm for Online Freeze-Tag}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {8:1--8:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.8},
URN = {urn:nbn:de:0030-drops-127693},
doi = {10.4230/LIPIcs.FUN.2021.8},
annote = {Keywords: Online algorithm, competitive ratio, freeze-tag}
}
@InProceedings{churchill_et_al:LIPIcs.FUN.2021.9,
author = {Churchill, Alex and Biderman, Stella and Herrick, Austin},
title = {{Magic: The Gathering Is Turing Complete}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.9},
URN = {urn:nbn:de:0030-drops-127706},
doi = {10.4230/LIPIcs.FUN.2021.9},
annote = {Keywords: Turing machines, computability theory, Magic: the Gathering, two-player games}
}
@InProceedings{clokie_et_al:LIPIcs.FUN.2021.10,
author = {Clokie, Trevor and Lidbetter, Thomas F. and Molina Lovett, Antonio J. and Shallit, Jeffrey and Witzman, Leon},
title = {{Computational Fun with Sturdy and Flimsy Numbers}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.10},
URN = {urn:nbn:de:0030-drops-127715},
doi = {10.4230/LIPIcs.FUN.2021.10},
annote = {Keywords: sturdy number, flimsy number, context-free grammar, finite automaton, enumeration}
}
@InProceedings{crombez_et_al:LIPIcs.FUN.2021.11,
author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan},
title = {{Efficient Algorithms for Battleship}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.11},
URN = {urn:nbn:de:0030-drops-127728},
doi = {10.4230/LIPIcs.FUN.2021.11},
annote = {Keywords: Polyomino, digital geometry, decision tree, lattice, HV-convexity, convexity}
}
@InProceedings{dempsey_et_al:LIPIcs.FUN.2021.12,
author = {Dempsey, Ross and Guinn, Charles},
title = {{A Phase Transition in Minesweeper}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {12:1--12:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.12},
URN = {urn:nbn:de:0030-drops-127735},
doi = {10.4230/LIPIcs.FUN.2021.12},
annote = {Keywords: Complexity of Games, Minesweeper}
}
@InProceedings{eppstein_et_al:LIPIcs.FUN.2021.13,
author = {Eppstein, David and Frishberg, Daniel and Maxwell, William},
title = {{On the Treewidth of Hanoi Graphs}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {13:1--13:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.13},
URN = {urn:nbn:de:0030-drops-127741},
doi = {10.4230/LIPIcs.FUN.2021.13},
annote = {Keywords: Hanoi graph, Treewidth, Graph separators, Kneser graph, Vertex expansion, Haven, Tensor product}
}
@InProceedings{frei_et_al:LIPIcs.FUN.2021.14,
author = {Frei, Fabian and Rossmanith, Peter and Wehner, David},
title = {{An Open Pouring Problem}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {14:1--14:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.14},
URN = {urn:nbn:de:0030-drops-127751},
doi = {10.4230/LIPIcs.FUN.2021.14},
annote = {Keywords: Pitcher Pouring Problem, Water Jug Riddle, Water Bucket Problem, Vessel Puzzle, Complexity, Die Hard}
}
@InProceedings{brocken_et_al:LIPIcs.FUN.2021.15,
author = {Brocken, Thomas and van der Heijden, G. Wessel and Kostitsyna, Irina and Lo-Wong, Lloyd E. and Surtel, Remco J. A.},
title = {{Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.15},
URN = {urn:nbn:de:0030-drops-127769},
doi = {10.4230/LIPIcs.FUN.2021.15},
annote = {Keywords: Disc-robot motion planning, algorithmic complexity, PSPACE-hard}
}
@InProceedings{idziaszek:LIPIcs.FUN.2021.16,
author = {Idziaszek, Tomasz},
title = {{Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {16:1--16:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.16},
URN = {urn:nbn:de:0030-drops-127770},
doi = {10.4230/LIPIcs.FUN.2021.16},
annote = {Keywords: Fibonacci numbers, Zeckendorf representation, multiplication algorithm, Fast Fourier Transform, golden ratio numeral system, Lucas numbers}
}
@InProceedings{koch_et_al:LIPIcs.FUN.2021.17,
author = {Koch, Alexander and Walzer, Stefan},
title = {{Foundations for Actively Secure Card-Based Cryptography}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {17:1--17:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.17},
URN = {urn:nbn:de:0030-drops-127786},
doi = {10.4230/LIPIcs.FUN.2021.17},
annote = {Keywords: Card-Based Protocols, Card Shuffling, Secure Multiparty Computation, Active Security, Cryptography without Computers}
}
@InProceedings{kopczynski:LIPIcs.FUN.2021.18,
author = {Kopczy\'{n}ski, Eryk},
title = {{Hyperbolic Minesweeper Is in P}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {18:1--18:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.18},
URN = {urn:nbn:de:0030-drops-127797},
doi = {10.4230/LIPIcs.FUN.2021.18},
annote = {Keywords: Minesweeper}
}
@InProceedings{kuszmaul:LIPIcs.FUN.2021.19,
author = {Kuszmaul, William},
title = {{Train Tracks with Gaps}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {19:1--19:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.19},
URN = {urn:nbn:de:0030-drops-127800},
doi = {10.4230/LIPIcs.FUN.2021.19},
annote = {Keywords: probabilistic method, algorithms, trains, Lov\'{a}sz Local Lemma, McDiarmid’s Inequality}
}
@InProceedings{miyahara_et_al:LIPIcs.FUN.2021.20,
author = {Miyahara, Daiki and Robert, L\'{e}o and Lafourcade, Pascal and Takeshige, So and Mizuki, Takaaki and Shinagawa, Kazumasa and Nagao, Atsuki and Sone, Hideaki},
title = {{Card-Based ZKP Protocols for Takuzu and Juosan}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {20:1--20:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.20},
URN = {urn:nbn:de:0030-drops-127817},
doi = {10.4230/LIPIcs.FUN.2021.20},
annote = {Keywords: Zero-knowledge proof, Card-based cryptography, Takuzu, Juosan}
}
@InProceedings{cordasco_et_al:LIPIcs.FUN.2021.21,
author = {Cordasco, Gennaro and Gargano, Luisa and Rescigno, Adele A.},
title = {{Speeding up Networks Mining via Neighborhood Diversity}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.21},
URN = {urn:nbn:de:0030-drops-127823},
doi = {10.4230/LIPIcs.FUN.2021.21},
annote = {Keywords: Parameterized Complexity, Neighborhood Diversity, Maximum Matching, Triangle Counting, Girth, Global minimum vertex cut}
}
@InProceedings{ruangwises_et_al:LIPIcs.FUN.2021.22,
author = {Ruangwises, Suthee and Itoh, Toshiya},
title = {{Physical Zero-Knowledge Proof for Numberlink}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {22:1--22:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.22},
URN = {urn:nbn:de:0030-drops-127836},
doi = {10.4230/LIPIcs.FUN.2021.22},
annote = {Keywords: Zero-knowledge proof, Card-based cryptography, Numberlink, Puzzles, Games}
}
@InProceedings{barbay_et_al:LIPIcs.FUN.2021.23,
author = {Barbay, J\'{e}r\'{e}my and Subercaseaux, Bernardo},
title = {{The Computational Complexity of Evil Hangman}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {23:1--23:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.23},
URN = {urn:nbn:de:0030-drops-127840},
doi = {10.4230/LIPIcs.FUN.2021.23},
annote = {Keywords: combinatorial game theory, computational complexity, decidability, hangman}
}
@InProceedings{zhou_et_al:LIPIcs.FUN.2021.24,
author = {Zhou, Qian M. and Calvert, Aiden and Young, Maxwell},
title = {{Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {24:1--24:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.24},
URN = {urn:nbn:de:0030-drops-127859},
doi = {10.4230/LIPIcs.FUN.2021.24},
annote = {Keywords: Chernoff bounds, backoff, contention resolution, algorithms}
}
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