Dr Ciaran McCreesh

  • Research Associate (School of Computing Science)

Biography

I am a postdoctoral research associate, working with Dr Patrick Prosser in the Formal Analysis, Theory and Algorithms (FATA) section, on the EPSRC grant "Modelling and Optimisation with Graphs". Previously, I obtained my PhD titled "Solving Hard Subgraph Problems in Parallel" from the University of Glasgow.

Further information is available from my personal website.

Research interests

My research looks at the development and evaluation of exact, practical algorithms for hard combinatorial problems.  I am interested in understanding what makes theoretically hard problems easy or hard in practice, and how we exploit this knowledge to design better algorithms. My publications cover graph algorithms, constraint programming, symbolic artificial intelligence, parallel programming, constraint programming, and empirical algorithmics.

Publications

List by: Type | Date

Jump to: 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012
Number of items: 19.

2018

Archibald, B., Maier, P., McCreesh, C., Stewart, R. and Trinder, P. (2018) Replicable parallel branch and bound search. Journal of Parallel and Distributed Computing, 113, pp. 92-114. (doi:10.1016/j.jpdc.2017.10.010)

Mccreesh, C., Prosser, P. and Trimble, J. (2018) When subgraph isomorphism is really hard, and why this matters for graph databases. Journal of Artificial Intelligence Research, 61, pp. 723-759. (doi:10.1613/jair.5768)

Hoffmann, R., Mccreesh, C., Ndiaye, S. N., Prosser, P., Reilly, C., Solnon, C. and Trimble, J. (2018) Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. In: 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, The Netherlands, 26-29 Jun 2018, (Accepted for Publication)

2017

Hoffmann, R., Mccreesh, C. and Reilly, C. (2017) Between Subgraph Isomorphism and Maximum Common Subgraph. In: Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, CA, USA, 4-10 Feb 2017, pp. 3907-3914.

McCreesh, C., Prosser, P., Simpson, K. and Trimble, J. (2017) On Maximum Weight Clique Algorithms, and How They Are Evaluated. In: CP2017: The 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, Australia, 28 Aug - 1 Sept 2017, pp. 206-225. ISBN 9783319661575 (doi:10.1007/978-3-319-66158-2_14)

McCreesh, C., Prosser, P. and Trimble, J. (2017) A Partitioning Algorithm for Maximum Common Subgraph Problems. In: 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 Aug 2017, pp. 712-719. (doi:10.24963/ijcai.2017/99)

2016

Kotthoff, L., McCreesh, C. and Solnon, C. (2016) Portfolios of Subgraph Isomorphism Algorithms. In: Learning and Intelligent OptimizatioN Conference (LION 10), Napoli, Italy, 29 May - 1 June 2016, pp. 107-122. ISBN 9783319503486 (doi:10.1007/978-3-319-50349-3_8)

McCreesh, C., Ndiaye, S. N., Prosser, P. and Solnon, C. (2016) Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In: CP2016: The 22nd International Conference on Principles and Practice of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 350-368. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_23)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Morphing Between Stable Matching Problems. In: CP 2016: 22nd International Conference on Principles and Practices of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 832-840. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_52)

Cano, J., White, D. R., Bordallo, A., McCreesh, C., Prosser, P., Singer, J. and Nagarajan, V. (2016) Task Variant Allocation in Distributed Robotics. In: Robotics Science and Systems 2016, Ann Arbor, MI, USA, 18-22 June 2016, (doi:10.15607/RSS.2016.XII.045)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9-15 July 2016, pp. 631-638. ISBN 9781577357704

2015

Macdonald, C., McCreesh, C., Miller, A. and Prosser, P. (2015) Constructing sailing match race schedules: round-robin pairing lists. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 671-686. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_46)

McCreesh, C. and Prosser, P. (2015) A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 295-312. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_21)

McCreesh, C. and Prosser, P. (2015) A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5), pp. 949-960. (doi:10.1007/s11590-014-0837-4)

McCreesh, C. and Prosser, P. (2015) The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Transactions on Parallel Computing, 2(1), 8. (doi:10.1145/2742359)

2014

McCreesh, C. and Prosser, P. (2014) Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 226-234. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_16)

McCreesh, C. and Prosser, P. (2014) Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, pp. 549-563. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_40)

2013

McCreesh, C. and Prosser, P. (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi:10.3390/a6040618)

2012

McCreesh, C. and Prosser, P. (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

This list was generated on Sat Apr 21 12:15:22 2018 BST.
Number of items: 19.

Articles

Archibald, B., Maier, P., McCreesh, C., Stewart, R. and Trinder, P. (2018) Replicable parallel branch and bound search. Journal of Parallel and Distributed Computing, 113, pp. 92-114. (doi:10.1016/j.jpdc.2017.10.010)

Mccreesh, C., Prosser, P. and Trimble, J. (2018) When subgraph isomorphism is really hard, and why this matters for graph databases. Journal of Artificial Intelligence Research, 61, pp. 723-759. (doi:10.1613/jair.5768)

McCreesh, C. and Prosser, P. (2015) A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5), pp. 949-960. (doi:10.1007/s11590-014-0837-4)

McCreesh, C. and Prosser, P. (2015) The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound. ACM Transactions on Parallel Computing, 2(1), 8. (doi:10.1145/2742359)

McCreesh, C. and Prosser, P. (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi:10.3390/a6040618)

Research Reports or Papers

McCreesh, C. and Prosser, P. (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

Conference Proceedings

Hoffmann, R., Mccreesh, C., Ndiaye, S. N., Prosser, P., Reilly, C., Solnon, C. and Trimble, J. (2018) Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. In: 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, The Netherlands, 26-29 Jun 2018, (Accepted for Publication)

Hoffmann, R., Mccreesh, C. and Reilly, C. (2017) Between Subgraph Isomorphism and Maximum Common Subgraph. In: Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, CA, USA, 4-10 Feb 2017, pp. 3907-3914.

McCreesh, C., Prosser, P., Simpson, K. and Trimble, J. (2017) On Maximum Weight Clique Algorithms, and How They Are Evaluated. In: CP2017: The 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, Australia, 28 Aug - 1 Sept 2017, pp. 206-225. ISBN 9783319661575 (doi:10.1007/978-3-319-66158-2_14)

McCreesh, C., Prosser, P. and Trimble, J. (2017) A Partitioning Algorithm for Maximum Common Subgraph Problems. In: 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 19-25 Aug 2017, pp. 712-719. (doi:10.24963/ijcai.2017/99)

Kotthoff, L., McCreesh, C. and Solnon, C. (2016) Portfolios of Subgraph Isomorphism Algorithms. In: Learning and Intelligent OptimizatioN Conference (LION 10), Napoli, Italy, 29 May - 1 June 2016, pp. 107-122. ISBN 9783319503486 (doi:10.1007/978-3-319-50349-3_8)

McCreesh, C., Ndiaye, S. N., Prosser, P. and Solnon, C. (2016) Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. In: CP2016: The 22nd International Conference on Principles and Practice of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 350-368. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_23)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Morphing Between Stable Matching Problems. In: CP 2016: 22nd International Conference on Principles and Practices of Constraint Programming, Toulouse, France, 5-9 Sept 2016, pp. 832-840. ISBN 9783319449524 (doi:10.1007/978-3-319-44953-1_52)

Cano, J., White, D. R., Bordallo, A., McCreesh, C., Prosser, P., Singer, J. and Nagarajan, V. (2016) Task Variant Allocation in Distributed Robotics. In: Robotics Science and Systems 2016, Ann Arbor, MI, USA, 18-22 June 2016, (doi:10.15607/RSS.2016.XII.045)

McCreesh, C., Prosser, P. and Trimble, J. (2016) Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9-15 July 2016, pp. 631-638. ISBN 9781577357704

Macdonald, C., McCreesh, C., Miller, A. and Prosser, P. (2015) Constructing sailing match race schedules: round-robin pairing lists. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 671-686. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_46)

McCreesh, C. and Prosser, P. (2015) A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs. In: 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Cork, Ireland, 31 Aug -04 Sep 2015, pp. 295-312. ISBN 9783319232188 (doi:10.1007/978-3-319-23219-5_21)

McCreesh, C. and Prosser, P. (2014) Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 226-234. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_16)

McCreesh, C. and Prosser, P. (2014) Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: 20th International Conference, CP 2014, Lyon, France, 8-12 Sep 2014, pp. 549-563. ISBN 9783319104270 (doi:10.1007/978-3-319-10428-7_40)

This list was generated on Sat Apr 21 12:15:22 2018 BST.