Stanislav Zivny

Standa Zivny is a full professor of Computer Science at the University of Oxford. His research interests are in the broad areas of theoretical computer science and discrete mathematics. He is particularly interested in algorithms, computational complexity, and homomorphism problems. Most of his work lies at the intersection of the above, namely it is on (the mathematics of) constraint satisfaction problems (CSPs) in its many forms (approximation, counting, decision, optimisation, promise). His work has been supported by a Royal Society University Research Fellowship, an ERC Starting Grant, and an ERC Consolidator Grant.