Tentative Program.

Dec 13th. 

9.15  -- 9.30:   Open Remarks. Pankaj Agarwal and S. Muthukrishnan

9.30  -- 10.30:  Camil Demetrescu.
			Dynamic Graph Algorithms
10.30 -- 11.00:  Coffee Break
11.00 -- 11.30:  Ramesh Hariharan
			Maintaining Steiner Edge Connectivity
11.30 -- 12.00:  Sandeep Sen
			Dynamic Algorthms for Shortest Paths and Transitive Closures

12.00 --  2.00:  LUNCH

2.00  --  3.00:  Lars Arge
			Results and challenges in I/O-efficient Algorithms
3.00  --  3.30:  Coffee Break
3.30  --  4.00:  Roberto grossi
			Implicitness in Dynamic Data [Structures]
4.00  --  4.30:  Irene Finocchi
			Sorting and Searching in the Presence of Memory Faults


Dec 14th.

09.30 --  10.30: Mark de Berg
			Kinetic Data Structures -- Overview and Recent Developments
10.30 --  11.00: Coffee Break
11.00 --  11.30: Tamal Dey
			Dynamic Meshing of Deformable Surfaces
11.30 --  12.00: Sariel Har-Peled
			Dynamic Approximate Nearest Neighbor in Low and High Dimension

12.00 --   2.00:  LUNCH

2.00  --   3.00: Sudipto Guha 
			Dynamic Data and Stream Algorithms
3.00  --   3.30: Coffee Break
3.30  --   4.00: Piotr Indyk 
			Dynamic Streaming Algorithms
4.00  --   4.30: Kasturi Varadarajan
			Core-Sets for Streaming and Kinetic Settings

4.30  --   5.00: Open Mike, Open Problems, Closing. 


==============================================================