This is a joint seminar (in English) with Prof. M. Karonski from the Adam Mickiewicz University in Poznan Poland covering selected topics in algorithmic discrete mathematics and random graph theory. The seminar alternates between Berlin and Poznan. The exact locations and times for the talks will be announced.
Berlin-Poznan Seminar, 20 May 2006
Location: Adam Mickiewicz University, Poznan
| 10:00 | coffee - opening |
|---|---|
| 11:00 | Michal Hanckowiak: Distributed approximation algorithm for minimum dominating set problem in planar graphs |
| 12:00 | Anusch Taraz: Embedding spanning subgraphs of bounded bandwidth into dense graphs |
| 13:00 | lunch / coffee |
| 14:30 | Mathias Schacht: Generalizations of the removal lemma |
| 15:30 | Taral Seierstad: Phase transition in random digraphs |
| 16:30 | coffee / dinner |
Berlin-Poznan Seminar, 4 June 2005
Location: Johann von Neumann-Haus (Room 3.101), Adlershof campus of HU Berlin
| 09:00 | Opening and Tomasz Luczak: Ramsey numbers for cycles |
|---|---|
| 10:00 | Coffee Break |
| 10:30 | Amin Coja-Oghlan: Counting connected (hyper)graphs via the probabilistic method |
| 11:15 | Edyta Szymanska: Distributed approximation algorithms in planar graphs |
| 12:00 | Lunch |
| 13:30 | Jaroslaw Grytczuk: The game of arboricity |
| 14:15 | Taral Seierstad: The giant component in the minimum degree graph process |
| 15:00 | Closing |
Berlin-Poznan Seminar, 5 June 2004
Location: Adam Mickiewicz University, Poznan
| 11:00 | Mihyun Kang: Connectedness in random graph processes with degree constraints |
|---|---|
| 12:00 | Tomasz Schoen: Difference cover |
| 13:00 | lunch plus walk |
| 14:30 | Tomasz Luczak: Some old and new results on the phase transition |
| 15:30 | coffee break |
| 16:00 | Stefan Kirchner: A PTAS for computing the similarity of three-dimensional sets |
| 16:30 | Michael Behrisch: Component evolution in random intersection graphs |
| 17:00 | Closing |
Berlin-Poznan Seminar, 30 May 2003
Location: Johann von Neumann-Haus (Room 3.101), Adlershof campus of HU Berlin
| 10:00 | Coffee |
|---|---|
| 11:00 | Andrzej Rucinski: Hamiltonian cycles in 3-uniform hypergraphs |
| 12:00 | Jaroslaw Grytczuk: Thue type problems for graphs, points and numbers |
| 13:00 | Lunch |
| 15:00 | Till Nierhoff: Moving stacker cranes optimally over trees a.a.s. |
| 16:00 | Dirk Schlatter: Maximal planar subgraph of random graphs |
| 17:00 | Closing |
Berlin-Poznan Seminar, 29 June 2002
Location: Adam Mickiewicz University, Poznan
| 10:30 | Coffee |
|---|---|
| 11:15 | Mihyun Kang and Manuel Bodirsky: Generating random outerplanar graphs |
| 13:15 | Lunch |
| 15:00 | Andrzej Rucinski: Sharp thresholds for Ramsey properties and Ramsey games against random graphs |
| 16:00 | Coffee |
| 16:30 | Michal Karonski: Random proposal graphs with a second chance for ugly ducklings |
| 17:15 | Closing |
Deutsch