default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th FUN 2021: Favignana Island, Sicily, Italy
- Martin Farach-Colton
, Giuseppe Prencipe, Ryuhei Uehara:
10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy. LIPIcs 157, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-145-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari Is NP-Complete. 1:1-1:24 - Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis:
Collaborative Procrastination. 2:1-2:20 - Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. 3:1-3:23 - Juan José Besa Vial, Timothy Johnson, Nil Mamano, Martha C. Osegueda:
Taming the Knight's Tour: Minimizing Turns and Crossings. 4:1-4:20 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo down to Size. 5:1-5:18 - Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. 6:1-6:19 - Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff:
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. 7:1-7:14 - Josh Brunner, Julian Wellman:
An Optimal Algorithm for Online Freeze-Tag. 8:1-8:11 - Alex Churchill, Stella Biderman, Austin Herrick:
Magic: The Gathering Is Turing Complete. 9:1-9:19 - Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman:
Computational Fun with Sturdy and Flimsy Numbers. 10:1-10:21 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. 11:1-11:15 - Ross Dempsey, Charles Guinn:
A Phase Transition in Minesweeper. 12:1-12:10 - David Eppstein, Daniel Frishberg, William Maxwell:
On the Treewidth of Hanoi Graphs. 13:1-13:21 - Fabian Frei, Peter Rossmanith, David Wehner:
An Open Pouring Problem. 14:1-14:9 - Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, Remco J. A. Surtel:
Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard. 15:1-15:16 - Tomasz Idziaszek:
Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation. 16:1-16:9 - Alexander Koch, Stefan Walzer:
Foundations for Actively Secure Card-Based Cryptography. 17:1-17:23 - Eryk Kopczynski:
Hyperbolic Minesweeper Is in P. 18:1-18:7 - William Kuszmaul:
Train Tracks with Gaps. 19:1-19:11 - Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone:
Card-Based ZKP Protocols for Takuzu and Juosan. 20:1-20:21 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Speeding up Networks Mining via Neighborhood Diversity. 21:1-21:12 - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Numberlink. 22:1-22:11 - Jérémy Barbay, Bernardo Subercaseaux:
The Computational Complexity of Evil Hangman. 23:1-23:12 - Qian M. Zhou, Aiden Calvert, Maxwell Young:
Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds. 24:1-24:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-06 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
