- PhD student working with Patrick Prosser and David Manlove in the Formal Analysis, Theory and Algorithms and Parallelism groups in the School of Computing Science at the University of Glasgow.
- Email: c.mccreesh.1 at research.gla.ac.uk
- Office: G161 Lilybank Gardens

- Solving (NP) hard problems in practice, particularly combinatorial optimisation and graph theory problems.
- Symmetries in hard problems.
- Parallel search for branch and bound algorithms, and parallelism for intelligent backtracking search (such as conflict-directed backjumping).

Here's a scientific poster, and a three minute video of my thesis for a non-technical audience:

- Workshop on Teaching Constraint Programming at CP 2015.

- Ciaran McCreesh, Patrick Prosser:
**A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs.**

CP 2015: 295-312.

[DOI, author-final PDF, code, datasets, experimental scripts, VM for recomputation, conference presentation] - Craig Macdonald, Ciaran McCreesh, Alice Miller and Patrick Prosser:
**Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists.**

CP 2015: 671-686

[DOI, author-final PDF, industry poster] - Ciaran McCreesh, Patrick Prosser:
**The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound.**

ACM Transactions on Parallel Computing Volume 2 Issue 1 (2015).

[DOI, ACM Author-izer PDF, Older preprint on arXiv]. - Ciaran McCreesh, Patrick Prosser:
**A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem.**

Optimization Letters (2014)

[DOI (open access)]. - Ciaran McCreesh, Patrick Prosser:
**Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.**

CP 2014: 549-563

[DOI, author-final PDF] - Ciaran McCreesh, Patrick Prosser:
**An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem.**

CPAIOR 2014: 226-234

[DOI, author-final PDF] - Ciaran McCreesh, Patrick Prosser:
**Multi-Threading a State-of-the-Art Maximum Clique Algorithm.**

Algorithms 6(4): 618-635 (2013)

[DOI (open access)]

- Solving Hard Graph Problems in Parallel, a general overview [source]
- Three minute talk from the CP 2015 doctoral program
- Ten minute talk from the Scottish Combinatorics Meeting on finding cliques in practice

- Scheduling Match Races for Sailing, CP 2015 Industrial Day [source]
- Solving Hard Graph Problems in Parallel, SICSA PhD Conference 2015 (1st prize). [source]
- Solving Hard Graph Problems in Parallel, second place at CP 2014. [source]
- Solving Hard Problems by Counting and Colouring Things In, for an industry event with a less-technical audience. [source]

- Sylwester Arabas, Michael R. Bareford, Lakshitha R. de Silva, Ian P. Gent, Benjamin M. Gorman, Masih Hajiarabderkani, Tristan Henderson, Luke Hutton, Alexander Konovalov, Lars Kotthoff, Ciaran McCreesh, Miguel A. Nacenta, Ruma R. Paul, Karen E. J. Petrie, Abdul Razaq, DaniĆ«l Reijsbergen, Kenji Takeda: Case Studies and Challenges in Reproducibility in the Computational Sciences. CoRR abs/1408.2123 (2014) [arXiv]
- Ciaran McCreesh, Patrick Prosser: Finding Maximum k-Cliques Faster using Lazy Global Domination. CoRR abs/1408.6485 (2014) [arXiv]
- Ciaran McCreesh, Patrick Prosser: Greedy Graph Colouring is a Misleading Heuristic. CoRR abs/1310.7741 (2013) [arXiv]
- Ciaran McCreesh, Patrick Prosser: Distributing an Exact Algorithm for Maximum Clique: maximising the costup. CoRR abs/1209.4560 (2012) [arXiv]