Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Centro Stefano Franscini of the Swiss Federal Institute of Technology (ETH) Zürich
Organizers: Jacob E. Goodman, City College, CUNY., New York, Richard Pollack, Courant Institute, NYU, New York, and Emo Welzl, ETH Zurich
Support provided by Swiss Federal Institute of Technology (ETH), National Science Foundations of USA and Switzerland (NSF and SNF), Swiss Academy of Science, and Springer-Verlag
Monday
| 8:30 | - | 9:30 | Annamaria Amenta - Computational geometry and computer graphics |
9:30 |
- | 10:00 | Jesús De Loera - Minimal triangulations and dissections of convex |
| polytopes | |||
| Break | |||
10:30 |
- | 11:00 | Rom Pinchasi - Applications of allowable sequences to plane geometry |
| 11:00 | - | 12:00 | János Pach - Ramsey-type problems in geometry |
12:15 |
Lunch | ||
15:00 |
- | 16:00 | Raimund Seidel - Lower bounds for geometric computations |
| 16:00 | - | 16:30 | Andras Bezdek - Incidence problems for points and unit circles |
| Short break | |||
16:45 |
- | 17:15 | Jochen Giesen - Curve reconstruction and TSP |
| 17:15 | - | 18:15 | Robert Connelly - Mathematical bellows and volume formulas |
18:30 |
Dinner |
Tuesday
| 8:30 | - | 9:30 | Herbert Edelsbrunner - Meshing with moving boundaries |
| 9:30 | - | 10:00 | Idjad Sabitov - Volume formulas and their applications |
| Break | |||
10:30 |
- | 11:00 | Günter Ziegler - Coloring of Hamming graphs, and the 0/1-Borsuk |
| problem | |||
11:00 |
- | 12:00 | Thomas C. Hales - The Kepler conjecture |
12:15 |
Lunch | ||
15:00 |
- | 16:00 | Saugata Basu - On The connectivity and topology of semi-algebraic |
| sets: complexity and algorithms | |||
16:00 |
- | 16:30 | Erik Demaine - Straightening chains and convexifying polygons |
| Short break | |||
16:45 |
- | 17:15 | Francisco Santos - A triangulation without flips |
| 17:15 | - | 18:15 | PROBLEM SESSION |
18:30 |
Dinner | ||
20:00 |
Ulli Kortenkamp - Cinderella Demo |
Wednesday
| 8:30 | - | 9:30 | Jürgen Richter-Gebert - The complex behavior of geometric objects |
| 9:30 | - | 10:00 | Vladimir Dol'nikov - Transversals and their applications |
| Break | |||
10:30 |
- | 11:00 | Géza Toth - Point sets with many k-sets |
| 11:00 | - | 12:00 | Jirí Matousek - Simultaneous partitions of measures by k-fans |
12:15 |
Lunch | ||
| Excursion |
Thursday
| 8:30 | - | 9:30 | Jeff Lagarias - Discrete geometric models for quasicrystals |
| 9:30 | - | 10:00 | Chuanming Zong - Blocking light rays |
| Break | |||
10:30 |
- | 11:00 | Meir Katchalski - Common transversals for intersecting planar |
| families of translates of a convex set | |||
| 11:00 | - | 12:00 | Micha Sharir - The union of objects and Voronoi diagrams |
12:15 |
Lunch | ||
15:00 |
- | 16:00 | Louis J. Billera - Enumeration of faces of polytopes: the current |
| state of affairs | |||
| 16:00 | - | 16:30 | Gabor Fejes Tóth - Stability of the moment theorem |
| Short break | |||
16:45 |
- | 17:15 | Pavel Valtr - Turán-type problems for geometric graphs |
| 17:15 | - | 17:45 | Zoltán Füredi - The smallest convex region containing all triangles |
| of perimeter 2 | |||
| 17:45 | - | 18:15 | Gyula Károlyi - Ramsey remainder for convex sets and the |
| Erdos-Szekeres Theorem | |||
| 18:30 | Dinner | ||
Friday
| 8:30 | - | 9:30 | Gil Kalai - Variations on the upper bound theorem |
| 9:30 | - | 10:00 | Jörg M. Wills - Kepler and the sausage |
| Break | |||
10:30 |
- | 11:00 | Bern Marshall - Regression depth and center points |
| 11:00 | - | 12:00 | Bernard Chazelle - The discrepancy method: geometry, randomness, |
| and complexity | |||
12:15 |
Lunch, and end of conference. |
Back
