- Solving (NP) hard problems in practice, particularly combinatorial optimisation and graph theory
- Symmetries in hard problems.
- Parallel branch and bound.
- McCreesh, Ciaran; Prosser, Patrick. 2013. "Multi-Threading a State-of-the-Art Maximum Clique Algorithm."
Algorithms 6, no. 4: 618-635. (DOI, PDF)
Tech Reports and Short Notes
- Ciaran McCreesh, Patrick Prosser: The Shape of the Search Tree for the Maximum Clique Problem, and the
Implications for Parallel Branch and Bound. (2014) (arXiv)
- Ciaran McCreesh, Patrick Prosser: Greedy Graph Colouring is a Misleading Heuristic. CoRR abs/1310.7741
- Ciaran McCreesh, Patrick Prosser: Distributing an Exact Algorithm for Maximum Clique: maximising the costup.
CoRR abs/1209.4560 (2012) (arXiv)