Program:
12:30 Welcome & Introduction
12:40 Andreas Holmsen (KAIST): An allowable feast
13:15 Micha Sharir (Tel Aviv University):
Polynomial partitioning: The hammer and some (recent algorithmic) nails
13:50 Esther Ezra (Bar Ilan University): Recent
developments on intersection searching
14:25 Xavier Goaoc (Loria, Nancy): Some
questions on order types
15:00 Andrew Suk (UC San Diego): Unavoidable
patterns in simple topological graphs
15:35 Sylvain Cappell (Courant Institute): Mesh matrices of graphs, of simplicial complexes and of matroids and the significance of their eigenvalues