default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th FUN 2026: Porquerolles, France
- John Iacono
:
13th International Conference on Fun with Algorithms, FUN 2026, Porquerolles, France, May 18-22, 2026. LIPIcs 366, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-417-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Abdelrahman Abdelmonsef, Xingyu Dong, Daniel Prusa, Michael Wehar, Chen Xu:
Finding Maximum and Minimum Size Matrices: The Algorithmic Complexity of Coding Challenges. 1:1-1:10 - Alessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini, Daniele Muscillo, Alessandro Panconesi, Erasmo Tani:
Man, These New York Times Games Are Hard! A Computational Perspective. 2:1-2:23 - Daniël I. Andel, Benjamin G. Rin:
Hive Is PSPACE-Hard. 3:1-3:20 - Samuel N. Araújo, Fabrício Benevides, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio:
The Closed Hull Game and the Closed Interval Game. 4:1-4:12 - Guillaume Bagan, Quentin Deschamps, Florian Galliot, Mirjana Mikalacki, Nacim Oijid:
Token Positional Games. 5:1-5:22 - Niranjan Balachandran, Ankita Dargad, Urban Larsson, Neeldhara Misra, Umesh Shankar:
Ferry Cover with Connectivity Constraints. 6:1-6:19 - Pierre Bergé, Antoine Dailly, Yan Gerard:
Nemesis, an Escape Game in Graphs. 7:1-7:22 - Jean-Claude Bermond, Michel Cosnard, Frédéric Havet, Takako Kodate, Stéphane Pérennes:
Directed Grabbing Games or How to Politely Grab the Maximum Number of Olives in a Reception. 8:1-8:19 - Charles Bouillaguet, Orel Cosseron:
MIDTERM Is a Deterministic Technique to Exit Recursive Mazes. 9:1-9:21 - Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
77 Shades of Grey. 10:1-10:19 - Matteo Caporrella, Stefano Leucci:
An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle. 11:1-11:21 - Brynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della H. Hendrickson, Tonan Kamata, Ryuhei Uehara:
A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles. 12:1-12:15 - Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
The Berlin Safe House Puzzle: Spycraft via Interval Graphs. 13:1-13:18 - Emilio Cruciani, Aditi Dudeja:
The Careless Coupon Collector's Problem. 14:1-14:21 - Simone Faro, Francesco Pio Marino, Gabriele Messina:
Spells for Quantum Programmers: Expressive High-Level Commands in Qutes. 15:1-15:20 - Jean-Marie Favreau, Yan Gerard, Pascal Lafourcade, Léo Robert:
Lozenge Tiling by Computing Distances. 16:1-16:21 - Gabriele Fici, Manal Mohamed, Jakub Radoszewski:
Sorting Magazines and Boxes. 17:1-17:13 - Noel Friedrich:
1038 A10s Fit into One A0. 18:1-18:13 - Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang:
Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level. 19:1-19:16 - Kshitij Gajjar, Neeldhara Misra:
Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity. 20:1-20:16 - Matthias Gehnen, Julius Stannat:
Endgames in Fog of War Chess. 21:1-21:20 - Madeleine Goertz, Aaron Williams:
The Quaternary Gray Code and Ziggu Puzzles. 22:1-22:22 - Elizabeth J. Hartung, Brett Stevens, Aaron Williams:
Pyramid Schemes for Eating M&Ms: Enumeration, Generation, and Gray Codes. 23:1-23:24 - Mathieu Hilaire, Perig Montfort, Nacim Oijid:
On the Complexity of the Maker-Breaker Happy Vertex Game. 24:1-24:20 - Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi:
Computational Complexity of Swish Is Solved. 25:1-25:12 - Linus Klocker, Simon Dominik Fink:
Hexasort - the Complexity of Stacking Colors on Graphs. 26:1-26:12 - Kolja Kühn, Wendy Yi:
Completing the Complexity Classification of 2-Solo Chess: Knights and Kings Are Hard. 27:1-27:21 - Tobias Lauer:
Weak Binary Search Trees. 28:1-28:12 - Mickaël Laurent, Maher Mallem:
Finding Shortest Walks in Kuru Kuru Kururin. 29:1-29:20 - Fengyi Liu, Avery Miller:
Replacing Cops with Zombies. 30:1-30:12 - Arturo Merino, Bernardo Subercaseaux:
A Demigod's Number for the Rubik's Cube. 31:1-31:20 - MIT Hardness Group, Josh Brunner, Erik D. Demaine, Della H. Hendrickson, Jeffery Li:
Tetris Is Hard with Just One Piece Type. 32:1-32:22 - Daiki Miyahara, Léo Robert, Pascal Lafourcade, Shohei Kaneko:
When Locality Implies Globality: Card-Based ZKP Protocol for Shakashaka Puzzle. 33:1-33:16 - Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki, Kazumasa Shinagawa:
Playing President with Virtual Players: How to Play Multiple Cards of a Kind. 34:1-34:15 - Daiki Miyahara, Pascal Lafourcade, Maxime Puys:
Card-Based ZKP Protocols for Connectivity-Based Puzzles: Extending to Tree Structures with Application to Nurimeizu. 35:1-35:13 - Keigo Oka:
Turing Completeness of GNU find: From mkdir-Assisted Loops to Standalone Computation. 36:1-36:16 - Keigo Oka, Naoki Inaba, Akira Iino:
Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers. 37:1-37:21 - Jenny Quan, Noah Kim, Bernardo Subercaseaux, John Mackey:
Solving Small Rubik's Cubes as Slowly as Possible. 38:1-38:20 - Bernardo Subercaseaux:
Price of Locality in Permutation Mastermind: Are TikTok Influencers Chaotic Enough? 39:1-39:21 - Kosuke Susukita:
An ASP-Completeness Framework for Dynasty Puzzles. 40:1-40:20
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 2026-07-28 00:13 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
