CAAN05: Call for Papers

Angele Hamel ahamel at
Thu Feb 10 11:25:51 PST 2005

   2005 Workshop on Combinatorial and Algorithmic Aspects of Networking

                          CALL FOR PAPERS

                       August 13rd - 14th, 2005

                      Waterloo, Ontario, Canada

Following the success of the first Combinatorial and Algorithmic Aspects of 
Networking (CAAN04) conference that was held August 5-7, 2004 at the Banff 
International Research Station (BIRS),  CAAN05 will be held in Waterloo, 
Ontario, Canada, August 13-14, 2005 as a satellite conference of the Workshop 
on Algorithms and Data Structures (WADS 05), Waterloo, On,
Canada, August 15-17, 2005.

The Internet because of its size, decentralized nature, and loosely
controlled architecture provides a hotbed of challenges that are amenable
to mathematical analysis and algorithmic techniques. This conference
brings together mathematicians, theoretical computer scientists and
network specialists. This fast growing area is an intriguing intersection
of Computer Science/Graph Theory/Game Theory/Networks.

Original research papers are solicited. The list of topics for the
conference includes, but is not limited to: Economics, Game Theory and the
Internet, Geometric Routing, Web Caching, Combinatorics, Tomography,
Peer-to-peer systems, Graph Theory/Web Graph, Data Stream analysis,
Statistical Distributions, Optimization, and QoS, as they relate to
Networks in general and the Internet in particular. The conference will be
organized as a series of talks with time for focused discussions.  We
solicit general participation and invite presentations on all aspects of
networking challenges that can be addressed using techniques from
theoretical computer science and mathematics. The goal of of the
conference is to foster interdisciplinary collaborations among
researchers in this field.

Submissions Authors should send an extended abstract in postscript or PDF
format by May 2nd, 2005. The paper should not exceed 12 pages in length on
letter-size paper using 11 point or larger font. Submission instructions
will be made available at

Program Committee

   Dimitris Achlioptas, Microsoft Research, USA
   Claus Bauer, Dolby Labs, USA
   Anthony Bonato, Wilfrid Laurier University, Canada
   Andrei Broder, IBM Research, USA
   Erik Demaine, MIT, USA
   Thomas Erlebach, University of Leicester, UK
   Jean-Charles Gregoire, IIT and INRS-EMT, Canada
   Angele Hamel, Wilfrid Laurier University, Canada
   Jochen Konemann, University of Waterloo, Canada
   Matthieu Latapy, LIAFA - Universite Paris 7, France
   Alex Lopez-Ortiz, University of Waterloo, Canada
   Rajeev Motwani, Stanford University, USA
   Ian Munro, University of Waterloo, Canada
   Tim Roughgarden, Stanford University, USA
   Rahul Sami, MIT, USA
   Shubho Sen, AT&T, USA
   D. Sivakumar, IBM, USA
   Jan ven den Heuvel, London School of Economics, UK
   Gordon Wilfong, Bell Labs, USA

The compgeom mailing lists: see
or send mail to compgeom-request at with the line:
send readme
Now archived at

More information about the Compgeom-announce mailing list