Sign in
FUN
2007
2012
2017
2022
2007
2022
Keyphrases
Publications
2022
Jean-Claude Bermond
,
Frédéric Havet
,
Michel Cosnard
Grabbing Olives on Linear Pizzas and Pissaladières.
FUN
(2022)
Suthee Ruangwises
,
Toshiya Itoh
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku.
FUN
(2022)
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.
FUN
(2022)
Ami Paz
,
Liat Peterfreund
Playing Guess Who with Your Kids.
FUN
(2022)
Hugo A. Akitaya
,
Maarten Löffler
,
Giovanni Viglietta
Pushing Blocks by Sweeping Lines.
FUN
(2022)
Kyle W. Burke
,
Matthew Ferland
,
Shang-Hua Teng
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem.
FUN
(2022)
N. R. Aravind
,
Neeldhara Misra
,
Harshil Mittal
Chess Is Hard Even for a Single Player.
FUN
(2022)
Quentin Bramas
,
Stéphane Devismes
,
Anaïs Durand
,
Pascal Lafourcade
,
Anissa Lamani
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?
FUN
(2022)
Arturo I. Merino
,
Torsten Mütze
,
Aaron Williams
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.
FUN
(2022)
Gerth Stølting Brodal
Priority Queues with Decreasing Keys.
FUN
(2022)
Roey Magen
,
Moni Naor
Mirror Games Against an Open Book Player.
FUN
(2022)
Henning Fernau
,
Carolina Haase
,
Stefan Hoffmann
The Synchronization Game on Subclasses of Automata.
FUN
(2022)
James Koppel
,
Yun William Yu
Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic Sports.
FUN
(2022)
Xavier Bultel
Zero-Knowledge Proof of Knowledge for Peg Solitaire.
FUN
(2022)
Manuel Lafond
How Brokers Can Optimally Abuse Traders.
FUN
(2022)
Justin Dallant
,
John Iacono
How Fast Can We Play Tetris Greedily with Rectangular Pieces?
FUN
(2022)
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.
FUN
(2022)
Miguel Ambrona
A Practical Algorithm for Chess Unwinnability.
FUN
(2022)
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.
FUN
(2022)
Samuel D. Hand
,
Jessica A. Enright
,
Kitty Meeks
Making Life More Confusing for Firefighters.
FUN
(2022)
Daniel Lokshtanov
,
Bernardo Subercaseaux
Wordle Is NP-Hard.
FUN
(2022)
Marcella Anselmo
,
Manuela Flores
,
Maria Madonia
Fun Slot Machines and Transformations of Words Avoiding Factors.
FUN
(2022)
Front Matter, Table of Contents, Preface, Conference Organization.
FUN
(2022)
Kyle W. Burke
,
Matthew Ferland
,
Shang-Hua Teng
Quantum-Inspired Combinatorial Games: Algorithms and Complexity.
FUN
(2022)
Fabien Mathieu
,
Sébastien Tixeuil
Fun with FUN.
FUN
(2022)
volume 226, 2022
11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy.
FUN
226 (2022)
2021
Loïc Crombez
,
Guilherme Dias da Fonseca
,
Yan Gerard
Efficient Algorithms for Battleship.
FUN
(2021)
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.
FUN
(2021)
Josh Brunner
,
Julian Wellman
An Optimal Algorithm for Online Freeze-Tag.
FUN
(2021)
Front Matter, Table of Contents, Preface, Conference Organization.
FUN
(2021)
Ross Dempsey
,
Charles Guinn
A Phase Transition in Minesweeper.
FUN
(2021)
Suthee Ruangwises
,
Toshiya Itoh
Physical Zero-Knowledge Proof for Numberlink.
FUN
(2021)
Fabian Frei
,
Peter Rossmanith
,
David Wehner
An Open Pouring Problem.
FUN
(2021)
Qian M. Zhou
,
Aiden Calvert
,
Maxwell Young
Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds.
FUN
(2021)
David Eppstein
,
Daniel Frishberg
,
William Maxwell
On the Treewidth of Hanoi Graphs.
FUN
(2021)
Juan José Besa Vial
,
Timothy Johnson
,
Nil Mamano
,
Martha C. Osegueda
Taming the Knight's Tour: Minimizing Turns and Crossings.
FUN
(2021)
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.
FUN
(2021)
Trevor Clokie
,
Thomas F. Lidbetter
,
Antonio Molina Lovett
,
Jeffrey O. Shallit
,
Leon Witzman
Computational Fun with Sturdy and Flimsy Numbers.
FUN
(2021)
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.
FUN
(2021)
Quentin Bramas
,
Pascal Lafourcade
,
Stéphane Devismes
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots.
FUN
(2021)
Jérémy Barbay
,
Bernardo Subercaseaux
The Computational Complexity of Evil Hangman.
FUN
(2021)
Tomasz Idziaszek
Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation.
FUN
(2021)
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.
FUN
(2021)
Davide Bilò
,
Luciano Gualà
,
Stefano Leucci
,
Guido Proietti
,
Giacomo Scornavacca
Cutting Bamboo down to Size.
FUN
(2021)
Eryk Kopczynski
Hyperbolic Minesweeper Is in P.
FUN
(2021)
William Kuszmaul
Train Tracks with Gaps.
FUN
(2021)
Alexander Koch
,
Stefan Walzer
Foundations for Actively Secure Card-Based Cryptography.
FUN
(2021)
Alex Churchill
,
Stella Biderman
,
Austin Herrick
Magic: The Gathering Is Turing Complete.
FUN
(2021)
Aris Anagnostopoulos
,
Aristides Gionis
,
Nikos Parotsidis
Collaborative Procrastination.
FUN
(2021)
Aviv Adler
,
Jeffrey Bosboom
,
Erik D. Demaine
,
Martin L. Demaine
,
Quanquan C. Liu
,
Jayson Lynch
Tatamibari Is NP-Complete.
FUN
(2021)