Our People
Dr Lorenzo Ciardo
Fellow, Junior Research Fellow
Senior Research Associate
Department of Computer Science
I am a researcher in algorithms and complexity theory. Currently, I am focussed on constraint satisfaction problems – a natural generalisation of the famous graph-colouring problem that can be studied through a surprisingly powerful algebraic approach based on polymorphisms. I am also interested in spectral graph theory, algebraic graph theory, and the combinatorial side of machine learning algorithms.