Topics in Algorithms, Complexity, and Combinatorial Optimisation
Prof Zivny is willing to supervise in the area of algorithms, complexity, and combinatorial optimisation. In particular, on
problems related to convex relaxations (linear and semidefinite programming relaxations), submodular functions, and algorithms
for and complexity of homomorphisms problems and Constraint Satisfaction Problems.