Craig Reilly

c.reilly.2 at


I'm a PhD student in the School Computing Science at the University of Glasgow. I work with Alice Miller and Patrick Prosser as part of the Formal Analysis, Theory and Algorithms research group.

A picture of me stting thinking very hard in the office.

Research Interests

My research focusses on introducing decision diagram branch and bound search into a constraint optimisation solver. I'm also interested in solving graph search problems computationally and in group theoretic symmetry breaking techniques, both for graph problems and for combinatorial search in general.


Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon and James Trimble: Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.
CPAIOR 2018: 298-315.
[author-final PDF]

Ruth Hoffmann, Ciaran McCreesh and Craig Reilly: Between Subgraph Isomorphism and Maximum Common Subgraph.
AAAI 2017: 3907-3914.
[abstract and PDF,author-final PDF]

Talks and Presentations

I presented a poster on Between Subgraph Isomorphism and Maximum Common Subgraph at AAAI 2017.

I gave a talk at the Scottish Theorem Proving 2016 meeting on Decision diagram branch and bound for graph problems.

I gave a 20 minute talk on Enumerating knot diagrams using constraint programming at BCTCS 2016.


I was part of a postgraduate student committee that organised FICS, a three day event of talks and workshops held as part of the School of Computing's 60th anniversary.

I attended the Association for Constraint Programming Summer School in June 2016.


My work address is:

Craig Reilly
Department of Computing Science
Sir Alwyn Williams Building
University of Glasgow
G12 8QQ

You'll find me in office number G162 where I work quite near to William Kavanah. I've previously had the joy of working near Benjamin Merlin Bumpus, Frances Cooper, Ciaran McCreesh, Sofiat Olaoebikan, and James Trimble.

Otherwise, email c.reilly.2 at