OPTIMAL DISCRETE STRUCTURES AND ALGORITHMS

ODSA 2000

Preliminary Programme

The conference will start on Monday morning and end on Wednesday afternoon. In the morning sessions we will have the talks of the invited speakers, while the afternoons are for the contributed talks (25 min each) in parallel sections. All talks will take place in the main building of the university.

Monday, September 11, 2000  
9:00-9:10 Opening of the conference
9:10-10:00 I. Wegener BDD's - design, analysis, complexity, and algorithms
Coffee break
10:30-11:20 J.R. Griggs Database security and concentrating sums of vectors
11:30-12:20 C.J. Colbourn Erasure codes and configurations in designs
Lunch break
14:00-15:30 Contributed talks
Coffee break
16:00-17:00 Contributed talks
Boat excursion and Conference dinner
End of the day
Tuesday, September 12, 2000  
9:00-9:50 G.M. Ziegler 4-polytopes and 3-spheres with fat face lattices
10:00-10:50 D.L. Kreher A hole-size bound for incomplete t-wise balanced designs
Coffee break
11:30-12:20 C.T. Hoang On the divisibility of graphs
Lunch break
14:00-15:30 Contributed talks
Coffee break
16:00-17:30 Contributed talks
Conference concert
End of the day
Wednesday, September 13, 2000  
9:00-9:50 A. Pott Power mappings in finite fields
10:00-10:50 J. Spinrad Solving problems in restricted domains
Coffee break
11:30-12:20 L.H. Khachatrian Set-theoretical problems under dimension constraint
Lunch break
14:00-15:30 Contributed talks
Coffee break
16:00-17:30 Contributed talks
End of the conference


Visit the Homepage of our Department of Mathematics


Sven Hartmann, 31.07.2000, sven.hartmann@mathematik.uni-rostock.de

Last update: 03.08.2000