Speaker: Daniel Stefankovic, University of Rochester
Title: Algorithmic problems for curves and surfaces

Abstract:

The talk will focus on (mainly algorithmic) questions motivated by
graph drawing (e.g.,
crossing numbers, string graphs) and low-dimensional topology (e.g.,
unknotting).
I will describe the basic tools (word equations, straight-line
programs), the current
state of the area, and interesting open problems.
--------------------