default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th FUN 2022: Favignana Island, Sicily, Italy
- Pierre Fraigniaud
, Yushi Uno:
11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy. LIPIcs 226, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-232-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. 1:1-1:21 - Miguel Ambrona:
A Practical Algorithm for Chess Unwinnability. 2:1-2:20 - Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch:
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. 3:1-3:30 - Marcella Anselmo, Manuela Flores, Maria Madonia:
Fun Slot Machines and Transformations of Words Avoiding Factors. 4:1-4:15 - N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess Is Hard Even for a Single Player. 5:1-5:20 - Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Rolling Polyhedra on Tessellations. 6:1-6:16 - Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? 7:1-7:21 - Gerth Stølting Brodal:
Priority Queues with Decreasing Keys. 8:1-8:19 - Xavier Bultel:
Zero-Knowledge Proof of Knowledge for Peg Solitaire. 9:1-9:17 - Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. 10:1-10:17 - Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Quantum-Inspired Combinatorial Games: Algorithms and Complexity. 11:1-11:20 - Jean-Claude Bermond, Frédéric Havet, Michel Cosnard:
Grabbing Olives on Linear Pizzas and Pissaladières. 12:1-12:20 - Justin Dallant, John Iacono:
How Fast Can We Play Tetris Greedily with Rectangular Pieces? 13:1-13:19 - Henning Fernau, Carolina Haase, Stefan Hoffmann:
The Synchronization Game on Subclasses of Automata. 14:1-14:17 - Samuel D. Hand, Jessica A. Enright, Kitty Meeks:
Making Life More Confusing for Firefighters. 15:1-15:15 - Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting Balls and Water: Equivalence and Computational Complexity. 16:1-16:17 - James Koppel, Yun William Yu:
Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic Sports. 17:1-17:20 - Manuel Lafond:
How Brokers Can Optimally Abuse Traders. 18:1-18:19 - Daniel Lokshtanov, Bernardo Subercaseaux:
Wordle Is NP-Hard. 19:1-19:8 - Roey Magen, Moni Naor:
Mirror Games Against an Open Book Player. 20:1-20:12 - Fabien Mathieu, Sébastien Tixeuil:
Fun with FUN. 21:1-21:13 - Arturo Merino, Torsten Mütze, Aaron Williams:
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. 22:1-22:28 - Ami Paz, Liat Peterfreund:
Playing Guess Who with Your Kids. 23:1-23:10 - Suthee Ruangwises, Toshiya Itoh:
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. 24:1-24:12
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 2024-10-31 20:22 CET 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:
