Ciaran McCreesh is a Research Scientist in the School of Computing Science at the University of Glasgow. His research covers solvers for hard combinatorial graph problems, based upon constraint programming and satisfiability techniques but redesigned and re-engineered for subgraph problems. He is particularly interested in using empirical algorithmics to understand the behaviour of these solvers in practice, and recently he has also started working on using pseudo-Boolean / cutting planes proof logging as a practical way of making these solvers trustworthy and auditable.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Visiting Scientist.