| Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. | 0 | 0.34 | 2022 |
| An Auditable Constraint Programming Solver | 0 | 0.34 | 2022 |
| Practical Bigraphs via Subgraph Isomorphism. | 0 | 0.34 | 2021 |
| Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. | 0 | 0.34 | 2020 |
| Justifying All Differences Using Pseudo-Boolean Reasoning | 0 | 0.34 | 2020 |
| Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions | 0 | 0.34 | 2020 |
| The Glasgow Subgraph Solver - Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. | 1 | 0.35 | 2020 |
| Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. | 1 | 0.35 | 2019 |
| Solving the task variant allocation problem in distributed robotics | 1 | 0.35 | 2018 |
| A Review of Literature on Parallel Constraint Solving. | 0 | 0.34 | 2018 |
| Replicable Parallel Branch and Bound Search. | 3 | 0.41 | 2018 |
| When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. | 2 | 0.35 | 2018 |
| A Partitioning Algorithm for Maximum Common Subgraph Problems. | 1 | 0.40 | 2017 |
| On Maximum Weight Clique Algorithms, And How They Are Evaluated | 3 | 0.38 | 2017 |
| Between Subgraph Isomorphism and Maximum Common Subgraph. | 1 | 0.36 | 2017 |
| Clique And Constraint Models For Maximum Common (Connected) Subgraph Problems | 5 | 0.43 | 2016 |
| Portfolios of Subgraph Isomorphism Algorithms. | 1 | 0.36 | 2016 |
| Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. | 4 | 0.42 | 2016 |
| Solving Hard Subgraph Problems in Parallel. | 2 | 0.37 | 2016 |
| Morphing Between Stable Matching Problems | 0 | 0.34 | 2016 |
| Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists | 0 | 0.34 | 2015 |
| A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs | 6 | 0.47 | 2015 |
| An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. | 5 | 0.44 | 2014 |
| An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science. | 1 | 0.36 | 2014 |
| The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound. | 5 | 0.45 | 2014 |
| A parallel branch and bound algorithm for the maximum labelled clique problem. | 2 | 0.39 | 2014 |
| Multi-Threading A State-Of-The-Art Maximum Clique Algorithm | 18 | 0.72 | 2013 |
| Greedy Graph Colouring is a Misleading Heuristic. | 1 | 0.35 | 2013 |
| Exact Algorithms For Maximum Clique: A Computational Study | 5 | 0.45 | 2012 |
