FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.
Fun is a notion that can be judged from different perspectives, and be defined in many different manners. The conference defines fun in a broad sense, including aspects such as elegance, simplicity, amusement, surprise, originality, etc.
The topics of interest include all aspects of algorithm design and analysis, and of computational complexity, under all types of models.
Conference website:
https://fun2026.limos.fr/
Important dates:
Submission deadline: January 6, 2026 (End of Day, Anywhere on Earth (AoE))
Notification date: February 17, 2026
Final version due: March 3, 2026
Conference date: May 18 - May 22, 2026
Submission instructions
Submissions should be made via the FUN2026 Easychair submission server. (TBA)
Submissions can have unlimited length, and authors are encouraged to submit complete papers, in A4 or letter format, 11pt, single column, with reasonable margins. The first ten pages of the submitted papers must include a self-contained description of the results, of their motivations and impact. Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the conference, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal.
At least one author of each accepted paper is expected to physically attend the conference and present the paper.
Conference proceedings will be published by LIPIcs, Schloss Dagstuhl – Leibniz Center for Informatics, Volume TBA. Authors of accepted papers will be asked to submit the final, camera-ready version of their paper in LIPIcs style not later than March 3, 2026. The page limit is 20 pages maximum, in total, i.e., including title, authors, affiliation, figures, bibliography, etc.
PROGRAM COMMITTEE
* Aaron Williams, Williams College, USA.
* Bernardo Subercaseaux, Carnegie Mellon University, USA.
* Danny Krizanc, Wesleyan University, USA.
* Della H. Hendrickson, Massachusetts Institute of Technology, USA.
* Emily Fox, University of Illinois Urbana-Champaign, USA.
* Flaminia L. Luccio, Università Ca' Foscari Venezia, Italy.
* Florian Galliot, Université d'Aix-Marseille, France.
* Greg Aloupis, Northestern University, USA.
* John Iacono (chair), Université libre de Bruxelles, Belgium.
* Kévin Perrot, Université d'Aix-Marseille, France.
* Luciano Gualà, Università degli Studi di Roma Tor Vergata, Italy.
* Luisa Gargano, Università degli Studi di Salerno, Italy.
* Maarten Löffler, Utrecht University, Netherlands.
* Markus Holzer, Justus-Liebig-Universität Gießen, Germany.
* Martin Seybold, Université libre de Bruxelles, Belgium.
* Mirela Damian, Villanova University, USA.
* Shantanu Das, Université d'Aix-Marseille, France.
* Shikha Singh, Williams College, USA.
* Valentin Polishchuk, Linköpings universitet, Sweden.
* Yuichi Sudo, Hosei University, Japan.
STEERING COMMITTEE
* Flavio Chierichetti, Università di Roma, Italy.
* Irene Finocchi, Luiss Guido Carli, Italy.
* Pierre Fraigniaud, Institut de Recherche en Informatique Fondamentale, France.
* Linda Pagli, Università di Pisa, Italy.
* Giuseppe Prencipe, Università di Pisa, Italy.
* Paolo Boldi, Università di Milano, Italy.
* Nicola Santoro, Carleton University, Canada.
* Tami Tamir, Reichman University, Israel.
* Yushi Uno, Osaka Metropolitan University, Japan.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************