Office: G161 Lilybank Gardens (enter through the Sir Alwyn Williams building, through the glass double
doors, up half a flight of stairs, and along the twisty corridor; if you reach a few steps going downwards
you've gone too far).
Solving (NP) hard problems in practice, particularly combinatorial optimisation and graph theory
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:
Ruth Hoffmann, Ciaran McCreesh and Craig Reilly: Between Subgraph Isomorphism and Maximum Common Subgraph To appear at AAAI 17
Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser and Christine Solnon: Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems CP 2016: 350-368.
Ciaran McCreesh, Patrick Prosser and James Trimble: Morphing between Stable Matching Problems CP 2016: 832-840
Jose Cano Reyes, David White, Alejandro Bordallo, Ciaran McCreesh, Patrick Prosser, Jeremy Singer and
Vijay Nagarajan: Task Variant Allocation in Distributed Robotics.
Robotics Science and Systems 2016.
[PDF, author-final PDF]
Lars Kotthoff, Ciaran McCreesh and Christine Solnon: Portfolios of Subgraph Isomorphism
Algorithms. To appear at LION 2016.
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).
ACM Author-izer PDF (if this link doesn't get you the paper for free, try prepending www. to this page's URL, or email me), Older preprint on arXiv].
Ciaran McCreesh, Patrick Prosser: A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique
Problem. Optimization Letters (2014)
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)]