Call For Papers

The Fifth International conference on Fun with Algorithms (FUN 2010) is 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. The previous FUNs were held in Elba Island and in Castiglioncello, Tuscany, Italy, and special issues of Theoretical Computer Science (FUN'98), Discrete Applied Mathematics (FUN'01), and Theory of Computing Systems (FUN'04 and FUN'07) were dedicated to them.

The topics of interest include (but are not limited to):

  • FUN with biological algorithms
  • FUN with cryptographic algorithms
  • FUN with game-theoretic algorithms
  • FUN with internet algorithms
  • FUN with opimization algorithms
  • FUN with robotics algorithms
  • FUN with string algorithms
  • FUN with combinatorial algorithms
  • FUN with distributed algorithms
  • FUN with geometrical algorithms
  • FUN with mobile algorithms
  • FUN with parallel algorithms
  • FUN with space-conscious algorithms
  • FUN with algorithm visualization

A full paper should be submitted by January 15th January 24th, 2010 following the submission link given at the FUN 2010 web site. Manuscripts should not exceed 12 pages. Authors of accepted papers are expected to present their work at the conference. The program committee will determine appropriate time allocations for presentations (between 20 and 45 minutes).

Conference proceedings will be published by Springer in the LNCS series

Important dates

  • Paper Submission: January 15 January 24, 2010
  • Acceptance Notification: February 20, 2010
  • Final version due: March 15, 2010
  • Conference: June 2-4, 2010


FUN 2010 Program Committee:

FUN 2010 Organizing Committee: