| Position-indexed formulations for kidney exchange JP Dickerson, DF Manlove, B Plaut, T Sandholm, J Trimble Proceedings of the 2016 ACM Conference on Economics and Computation, 25-42, 2016 | 112 | 2016 |
| A partitioning algorithm for maximum common subgraph problems C McCreesh, P Prosser, J Trimble | 55 | 2017 |
| When subgraph isomorphism is really hard, and why this matters for graph databases C McCreesh, P Prosser, C Solnon, J Trimble Journal of Artificial Intelligence Research 61, 723-759, 2018 | 48 | 2018 |
| The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants C McCreesh, P Prosser, J Trimble International Conference on Graph Transformation, 316-324, 2020 | 47 | 2020 |
| Sequential and parallel solution-biased search for subgraph algorithms B Archibald, F Dunlop, R Hoffmann, C McCreesh, P Prosser, J Trimble International Conference on Integration of Constraint Programming …, 2019 | 42 | 2019 |
| “Almost-stable” matchings in the Hospitals/Residents problem with Couples DF Manlove, I McBride, J Trimble Constraints 22, 50-72, 2017 | 41 | 2017 |
| Certifying solvers for clique and maximum common (connected) subgraph problems S Gocht, R McBride, C McCreesh, J Nordström, P Prosser, J Trimble International Conference on Principles and Practice of Constraint …, 2020 | 33 | 2020 |
| On maximum weight clique algorithms, and how they are evaluated C McCreesh, P Prosser, K Simpson, J Trimble International Conference on Principles and Practice of Constraint …, 2017 | 21 | 2017 |
| Improved instance generation for kidney exchange programmes M Delorme, S García, J Gondzio, J Kalcsics, D Manlove, W Pettersson, ... Computers & Operations Research 141, 105707, 2022 | 19 | 2022 |
| Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. C McCreesh, P Prosser, J Trimble IJCAI, 631-638, 2016 | 15 | 2016 |
| An algorithm for the exact treedepth problem J Trimble arXiv preprint arXiv:2004.08959, 2020 | 10 | 2020 |
| Observations from parallelising three maximum common (connected) subgraph algorithms R Hoffmann, C McCreesh, SN Ndiaye, P Prosser, C Reilly, C Solnon, ... Integration of Constraint Programming, Artificial Intelligence, and …, 2018 | 10 | 2018 |
| PACE solver description: Bute-plus: A bottom-up exact solver for treedepth J Trimble arXiv preprint arXiv:2006.09912, 2020 | 4 | 2020 |
| Partitioning algorithms for induced subgraph problems J Trimble University of Glasgow, 2023 | 3 | 2023 |
| PACE solver description: Tweed-plus: A subtree-improving heuristic solver for treedepth J Trimble 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020 | 2 | 2020 |
| Morphing between stable matching problems C McCreesh, P Prosser, J Trimble International Conference on Principles and Practice of Constraint …, 2016 | 2 | 2016 |
| Induced universal graphs for families of small graphs J Trimble arXiv preprint arXiv:2109.00075, 2021 | 1 | 2021 |
| Three New Approaches for the Maximum Common Edge Subgraph Problem J Trimble, C McCreesh, P Prosser Doctoral Program Proceedings, 2018 | 1 | 2018 |
| Couples can be tractable: new algorithms and hardness results for the Hospitals/Residents problem with Couples D Manlove, I McBride, J Trimble | | 2024 |
| Couples can be tractable: New algorithms and hardness results for the Hospitals/Residents problem with Couples G Csáji, D Manlove, I McBride, J Trimble arXiv preprint arXiv:2311.00405, 2023 | | 2023 |
Patrick ProsserComputing Science, Glasgow在 dcs.gla.ac.uk 的电子邮件经过验证
