Ciaran McCreesh


Research interests

I'm interested in solving hard combinatorial problems in practice, particularly in the areas of graph theory and subgraph finding. Theoretically, these problems should take exponential time to solve, but in practice algorithms based upon symbolic artificial intelligence techniques like constraint programming and boolean satisfiability can often exactly solve large instances very quickly. My main research questions are:

Proof logging tutorial

Source code

Publications and Conference Papers