CALL FOR PAPERS

                 	         Fun with algorithms 2012
                                    June 4-6, 2012
                                  San Servolo Island
                                     Venice, Italy

                              http://www.dsi.unive.it/~fun2012/


The Sixth International conference on Fun with Algorithms (FUN 2012) 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, 
in Castiglioncello, Tuscany, Italy, and in Ischia Island, Italy, and special 
issues of Theoretical Computer Science (FUN'98), Discrete Applied Mathematics 
(FUN'01), and Theory of Computing Systems (FUN'04, FUN'07, and FUN'10) 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 string algorithms
	FUN with opimization algorithms
	FUN with robotics 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



Important Dates

    * Paper Submission: January 23, 2012
    * Acceptance Notification: February 20, 2012
    * Hotel reservation: March 11, 2012
    * Final version due: March 15, 2012
    * Conference: June 4-6, 2012 

Program Committee

    * Tetsuo Asano, JAIST, Japan
    * Jean-Claude Bermond, CNRS-UNS, France
    * Alan Borodin, University of Toronto, Canada
    * Erik Demaine, MIT, U.S.A.
    * Luc Devroye, McGill University, Canada
    * Shlomi Dolev, Ben-Gurion University of the Negev, Beer-Sheva, Israel
    * David Eppstein, University of California, Irvine, U.S.A.
    * Costis Georgiou, University of Waterloo, Canada
    * Nicolas Hanusse, CNRS and LaBRI, France
    * Elias Koutsoupias, University of Athens, Greece
    * Christos Kaklamanis, University of Patras, Greece
    * Evangelos Kranakis, Carleton University, Canada (Program Co-chair)
    * Mukkai Krishnamoorthy, Rensselaer Polytechnic Institute, U.S.A
    * Danny Krizanc, Wesleyan University, U.S.A (Program Co-chair)
    * Stefan Langerman, Université Libre de Bruxelles, Belgium
    * Flaminia Luccio, University Ca' Foscari, Italy, (Program Co-chair)
    * Mohammad Mahdian, Yahoo! Research, U.S.A.
    * Lata Narayanan, Concordia University, Canada
    * Linda Pagli, University of Pisa, Italy
    * David Peleg, Weizmann Institute, Israel
    * Mike Paterson, University of Warwick, United Kingdom
    * Rajeev Raman, University of Leicester, United Kingdom
    * Nicola Santoro, Carleton University, Canada
    * Eduardo Sany-Laber, PontifÍcia Universidade Católica do Rio de Janeiro, Brasil
    * Andrea Sgarro, University of Trieste, Italy
    * Ryuhei Uehara, JAIST, Japan
    * Ugo Vaccaro, University of Salerno, Italy
    * Peter Widmayer, ETH Zürich, Switzerland 

Plenary Speakers

    * Paola Flocchini, University of Ottawa
    * Giuseppe Persiano, Università di Salerno
    * Jorge Urrutia, UNAM, Mexico City


Organizing Committee

    * Riccardo Focardi University Ca' Foscari, Venice, Italy
    * Flaminia Luccio University Ca' Foscari, Venice, Italy (Organizing Committee Chair)
    * Marco Squarcina University Ca' Foscari, Venice, Italy 

Conference Location

The Fun with algorithms 2012 will be held in the facilities of Venice International 
University, located on the island of San Servolo, about 10 minutes by water ferry 
from the Piazza San Marco.



Publications

Conference proceedings will be published by Springer in the LNCS series. A special 
issue of Theory of Computing Systems will be dedicated to a selected set of papers.


Submission Instructions

Submitted papers must not substantially overlap with papers that have been published 
or that are simultaneously submitted to a journal or a conference with published 
proceedings. A full paper should be submitted by January 15, 2012 following the 
submission link given at the FUN 2012 web site. Manuscripts should not exceed 12
pages. Authors of accepted papers are expected to present their work at the conference.


Additional details can be found in FUN with algorithms 2012 Web page.


Contacts

    * FUN 2012 Program Committee: pc_fun2012@dsi.unive.it
   
    * FUN 2012 Organizing Committee: oc_fun2012@dsi.unive.it