Constraint Satisfaction Problems with Infinite Domains
by Manuel Bodirsky 

My talk has two parts: in the first, I give a short introduction
to constraint satisfaction problems (CSPs) with finite or infinite
domains, and about tools to study their computational complexity.

In the second part I present a recent classification result on
temporal CSPs, which is a class of CSPs that might be of particular
interest to the AlgOpt group.