Jakub Opršal is an Assistant Professor in Computer Science. He is a member of the Theory of Computation research group.
He studies the complexity of computational problems using mathematical tools. More precisely, the focus of his research is on approaching complexity of constraint satisfaction problems (e.g., graph colouring) and its approximation by the means of universal algebra, homotopy theory, combinatorics, and logic.
Dr Jakub Opršal’s personal webpage