Guests
-
Stefan Felsner, TU Berlin, Germany (Jun 4–8).
Host: E. Welzl
-
Radoslav Fulek, IST Austria (Jun 4–8)
The Z2-Genus of Kuratowski Minors
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Andrey Kupavskii, University of Birmingham, UK (Jun 4–8). Host: E. Welzl
-
Yoshio Okamoto, UEC Tokyo, Japan (Jun 4–8)
Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Alexander Pilz, TU Graz, Austria (Jun 4–8)
Planar 3-SAT with a Clause/Variable Cycle
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Shakhar Smorodinsky, Ben Gurion University, Israel (Jun 4–8)
From a (p,2)-Theorem to a Tight (p,q)-Theorem
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
József Solymosi, University of British Columbia, Canada (Jun 4–8). Host: E. Welzl
-
Bettina Speckmann, TU Eindhoven, Netherlands (Jun 4–8)
A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Miloš Stojaković, University of Novi Sad, Serbia (Jun 4–8)
Semi-Random Graph Process
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Tibor Szabó, FU Berlin, Germany (Jun 4–8)
On the Optimality of the Uniform Random Strategy
(Combinatorial Algorithms Day, Jun 4).
Host: E. Welzl
-
Uli Wagner, IST Austria (Jun 4–7). Host: E. Welzl
-
Zuzana Masárová, IST Austria (Klosterneuburg, Austria), Mar 12–21 and Apr 3–13. Host: E. Welzl
-
Antoine Deza, McMaster University (Hamilton, ON, Canada), Feb 19 – Feb 23. Host: B. Gärtner
-
Pavel Valtr, Charles University (Prague, Czech Republic), Feb 1 – Jun 30. Host: E. Welzl.
On the maximum crossing number (Mittagsseminar, Apr 10).
The Happy ending theorem and some related questions and results (Apr 27 and May 4).
On Open Problems Related to the Erdős-Szekeres Theorem
(Combinatorial Algorithms Day, Jun 4).
