Algorithms, Structure, Randomness - Main page Algorithms, Structure, Randomness

Conference on Combinatorics

in honour of Walter Deuber's 60th birthday

Humboldt-Universität zu Berlin, October 7th-8th 2002

The meeting consisted of the following talks:
Martin Aigner (Freie Universität Berlin): Two colors and more,
Peter Gritzmann (Technische Universität München): On the approximation of convex bodies by polytopes and its application in optimization,
Hanno Lefmann (Technische Universität Chemnitz): Partition regular systems of equations,
Jaroslav Nesetril (Karls-Universität, Prag): Ramsey Classes and Categories,
Vojtech Rödl (Emory University, Atlanta): Ramsey type problems,
Vera Sós (Ungarische Akademie der Wissenschaften, Budapest): Amenability and paradoxicality in groups, graphs, and algebras,
Ernst Specker (ETH Zürich): Modular counting and substitution of structures,
Joel Spencer (New York University): Some combinatorial games,
William T. Trotter (Arizona State University, Tempe): Graphs and posets - recent results und
Ingo Wegener (Universität Dortmund): Combinatorics, probability, and the analysis of evolutionary algorithms

Programme Coordination: Hans Jürgen Prömel und Bernd Voigt

To mark the occasion, there will be a special issue of the journal Combinatorics, Probability and Computing devoted to the memory of Walter Deuber (Guest editor: Hans Jürgen Prömel). Contributions are welcome and should be sent to Hans Jürgen Prömel. They will be refereed subject to the usual high standards of the journal. The deadline for submissions is the 31st of December 2002.

The conference was preceded by the Symposium Diskrete Mathematik 2002, which took place at the TU Dresden from the 3rd to the 5th of October.


Schedule:

Monday, October 7th 2002

9:30 H.J. Prömel
Opening speech by H.J. PrömelOpening speech by H.J. Prömel
Complete disorder is impossible - the mathematical work of Walter Deuber
10:15 E. Specker
E. SpeckerE. Specker
Modular counting and substitution of structures
11:00
KaffeepauseKaffeepause
Coffee Break
11:30 J. Nesetril
J. NesetrilJ. Nesetril
Ramsey Classes and Categories
12:15
V. Rödl, D. S. GundersonV. Rödl, D. S. Gunderson
Lunch Break
14:30 J. Spencer
J. SpencerJ. Spencer
Some combinatorial games
15:15 Coffee Break
15:45 H. Lefmann
H. LefmannH. Lefmann
Partition regular systems of equations
16:30 V. Sós
V. SósV. Sós
Amenability and paradoxicality in groups, graphs, and algebras
19:00
B. Voigt giving a speech during the dinnerB. Voigt giving a speech during the dinner
Buffet

Tuesday, October 8th 2002

9:30 M. Aigner
M. AignerM. Aigner
Two colors and more
10:15 I. Wegener
I. WegenerI. Wegener
Combinatorics, probability, and the analysis of evolutionary algorithms
11:00 Coffee Break
11:20 V. Rödl
V. RödlV. Rödl
Ramsey type problems
12:05 Lunch Break
13:40
H.J. Prömel, V. StrehlH.J. Prömel, V. Strehl
Coffee Break
14:00 P. Gritzmann
P. GritzmannP. Gritzmann
On the approximation of convex bodies by polytopes and its application in optimization
14:45 T. Trotter
T. TrotterT. Trotter
Graphs and posets - recent results

Contact:

Hans Jürgen Prömel
Postadresse:
Johann von Neumann-Haus
Humboldt-Universität zu Berlin
Institut für Informatik
Rudower Chaussee 25
12489 Berlin

Tel. : (+49 30) 2093 3190 Fax : (+49 30) 2093 3191 e-mail : proemel@informatik.hu-berlin.de

last modified 09/12/05 (alkox-www)