Gefördert von der
DFG-Logo
seit dem 1. April 1998
 

Graduiertenkolleg 357

Effiziente Algorithmen und Mehrskalenmethoden

an der Christian-Albrechts-Universität zu Kiel und der Universität zu Lübeck
   
 
  Christinchen  
 
  GEAM-Archiv

Vorträge im SS 1999

Datum   Vortragende/Vortragender, Titel
05.06.99   Prof. Dr. Tomasz Luczak
Poznan
Szemeredi's Regularity Lemma for Random and Pseudo-Random Graphs
07.06.99   Prof. Dr. Tomasz Luczak
Poznan
Games and Random Graphs.
05.06.99   Prof. Dr. Hans Jürgen Prömel
Berlin
Approximation Algorithms for the Steiner Problem in Graphs
05.06.99   Dr. Susanne Albers
Saarbrücken
Average-Case Analysis of First Fit and Random Fit Bin Packing
07.06.99   Dr. Susanne Albers
Saarbrücken
On the Power of Randomization in online Algorithms
05.06.99   Prof. Dr. Martin Dyer
Leeds
Counting H-colorings
06.06.99   Prof. Dr. Martin Dyer
Leeds
Coupling Methods for BoundingConvergence of Markov-Chains
05.06.99   Prof. Dr. Bruce Reed
Paris
Colouring Graphs Whose Chromatic Number is Almost Their Maximum Degree
06.06.99   Prof. Dr. Bruce Reed
Paris
Algorithmic Aspects of the Lovasz-Local-Lemma
27.08.99   Prof. Dr. Weimin Han
Iowa City, USA
Numerical analysis of variational inequalities arising in contact problems
29.08.99   Prof. Dr. Daya Reddy
Kapstadt, Südafrik
Aspects of the well-posedness and numerical analysis of problems in plasticity
31.08.99   Prof. Dr. Michael Chipot
Zürich
In introduction to problems with no minimizers
01.09.99   Prof. Dr. Michael Chipot
Zürich
Approximation of problems with no minimizers
02.09.99   Prof. Dr. Vsevolod Lev
Jerusalem
Restricted set addition in groups: A generalization of the Erdos-Heilbronn conjecture Discrepancy of shifted nets