Browse by Research Project Code

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0

McCreesh, C. , Pettersson, W. and Prosser, P. (2019) Understanding the empirical hardness of random optimisation problems. Lecture Notes in Computer Science, (Accepted for Publication)

Gent, I. P., Miguel, I., Nightingale, P., McCreesh, C. , Prosser, P. , Moore, N. C.A. and Unsworth, C. (2018) A review of literature on parallel constraint solving. Theory and Practice of Logic Programming, 18(5-6), pp. 725-758. (doi:10.1017/S1471068418000340)

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. , 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)

This list was generated on Thu Oct 17 08:29:55 2019 BST.