2005 Workshop on Combinatorial 

and 

Algorithmic Aspects of Networking

CALL FOR PAPERS


August 13th - 14th, 2005

Waterloo, Ontario, Canada

 

Following the success of the first Combinatorial and Algorithms 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.
 

Registration

For more information about registration click here.

Travel information, accommodations and attractions

See the WADS 2005 home page.

Program schedule. 

Reception: August 13th, 6:00pm DC1301. Davis Centre Building.

 

Talks: August 14th, DC1304. Davis Centre Building.

 

9:00-10:00 

Keshav: Efficient discovery of approximate global state (Invited Talk)

10:00-10:30

Zich: JumpNet: Improving connectivity and robustness  in unstructured P2P networks by randomness

10:30-11:00

Coffee Break

11:00-11:30 

Calinescu: Minimizing tunable ports in optical networks

11:30-12:00 

Harutyunyan: An efficient vertex addition method for  broadcast networks

12:00-1:30 

Lunch

1:30-2:00 

Avin: Fast and efficient restricted Delaunay triangulation in random geometric graphs

2:00-2:30 

Khennoufa: Linear and cyclic radio k-labelings of graphs

2:30-3:00 

Wang: Growth deletion models for the web graph and  other massive networks

3:00-3:30 

Coffee Break

3:30-4:00 

Ahmed: Ordered interval routing scheme

4:00-4:30 

Richards: The structure of PEC networks

Book of abstracts here.

Accepted Papers and Invited Talks here.

Paper submissions (closed)

Authors should send an extended abstract in postscript or PDF format by May 6th, 2005 (EXTENDED DEADLINE). The paper should not exceed 16 pages in length on letter-size paper using 11 point or larger font. Submissions are open using the SIGACT electronics submission server.
 

Program Committee

 
 Dimitris Achlioptas, Microsoft Research, USA
 Claus Bauer, Dolby Labs, USA
 Anthony Bonato, Wilfrid Laurier University, Canada
 Andrei Broder, IBM Research, USA
 Hervé Brönniman, Polytechnic University, 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 (Program Chair)
 Jochen Konemann, University of Waterloo, Canada
 Matthieu Latapy, LIAFA-CNRS - Universite Paris 7, France
 Alejandro Lopez-Ortiz, University of Waterloo, Canada (Organizing Comm. Chair)
 Rajeev Motwani, Stanford University, USA
 Ian Munro, University of Waterloo, Canada
 Tim Roughgarden, Stanford University, USA
 Rahul Sami, MIT, USA
 Shubho Sen, ATT, USA
 D. Sivakumar, IBM, USA
 Jan ven den Heuvel, London School of Economics, UK
 Gordon Wilfong, Bell Labs, USA