I will describe some of the interactions between graphs and geometry, many of them with an algorithmic slant. In particular, we will discuss the properties of different classes of graphs defined using the
intersection of geometric objects in the plane, and discuss classical optimization problems for such graphs. Finally, we will see how tools from computational geometry become useful for some algorithmic problems on graphs.
Sergio Cabello is a full professor at the Faculty of Mathematics and Physics, University of Ljubljana, Slovenia. His research is focused on Computational Geometry, Computational Topology, and Graph Algorithms, where he has made over 50 works. He has been in the program committee of SODA, SoCG, ICALP and ESA, and is in the editorial board of Journal of Computational Geometry and SIAM Journal on Discrete Mathematics. He did his undergraduate studies at the Universitat Politecnica de Catalunya in Spain and his PhD studies at Utrecht University, in the Netherlands. He was Marie Curie fellow at the Institute for Mathematics, Physics and Mechanincs in Ljubljana, Slovenia. He has been Visiting Professor at Universite Libre de Bruxelles, IST Austria, and Ecole Normale Superieure in Paris.