Conference on Fun with Algorithms

FUN

National

CORE rank

CORE rank (raw)

National: Italy

Fields of research

Theory of Computation · Data Management and Data Science

Papers indexed

311

2007–2026

Best Data Science and Information Retrieval conferences Best Theory of Computation conferences

Papers per year

200741 peak2026

Most published authors

FUN papers

311 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2018	Kings, Name Days, Lazy Servants and Magic.	Paolo Boldi, Sebastiano Vigna
2018	On the Exact Complexity of Polyomino Packing.	Hans L. Bodlaender, Tom C. van der Zanden
2018	On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games.	Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi
2018	On the Complexity of Two Dots for Narrow Boards and Few Colors.	Davide Bil, Luciano Gual, Stefano Leucci, Neeldhara Misra
2018	How long does it take for all users in a social network to choose their communities?.	Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
2018	How Bad is the Freedom to Flood-It?.	Rmy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018	Tracks from hell - when finding a proof may be easier than checking it.	Matteo Almanza, Stefano Leucci, Alessandro Panconesi
2018	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.	Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2018	Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms.	Markus Holzer, Jan-Tobias Maurer
2016	Front Matter, Table of Contents, Preface, Conference Organization.
2016	This House Proves That Debating is Harder Than Soccer.	Stefan Neumann, Andreas Wiese
2016	Two Dots is NP-complete.	Neeldhara Misra
2016	A Rupestrian Algorithm.	Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
2016	An Arithmetic for Rooted Trees.	Fabrizio Luccio
2016	Threes!, Fives, 1024!, and 2048 are Hard.	Stefan Langerman, Yushi Uno
2016	How to Solve the Cake-Cutting Problem in Sublinear Time.	Hiro Ito, Takahiro Ueda
2016	Convex Configurations on Nana-kin-san Puzzle.	Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya
2016	Loopless Gray Code Enumeration and the Tower of Bucharest.	Felix Herter, Gnter Rote
2016	Large Peg-Army Maneuvers.	Luciano Gual, Stefano Leucci, Emanuele Natale, Roberto Tauraso
2016	Counting Circles Without Computing Them.	Rudolf Fleischer
2016	Recognizing a DOG is Hard, But Not When It is Thin and Unit.	William S. Evans, Mereke van Garderen, Maarten Lffler, Valentin Polishchuk
2016	Building a Better Mouse Maze.	Jessica A. Enright, John D. Faben
2016	Super Mario Bros. is Harder/Easier Than We Thought.	Erik D. Demaine, Giovanni Viglietta, Aaron Williams
2016	The Fewest Clues Problem.	Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson
2016	Spy-Game on Graphs.	Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stphane Prennes

151–175 of 311← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.