Interactions between geometry, graphs and algorithms
I will describe some of the interactions between graphs and geometry, many of them with an algorithmic slant. In particular, we will discuss the crossing number of graphs, properties and relations between different classes of graphs defined using the intersection of geometric objects in the plane, and some classical optimization problems for graphs defined geometrically.