Ciaran McCreesh

Orcid: 0000-0002-6106-4871

Affiliations:
  • University of Glasgow


According to our database1, Ciaran McCreesh authored at least 41 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
End-to-End Verification for Subgraph Solving.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation.
J. Artif. Intell. Res., 2023

Report on BCTCS 2023.
Bull. EATCS, 2023

Proof Logging for Smart Extensional Constraints.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
An Auditable Constraint Programming Solver.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Finding Subgraphs with Side Constraints.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Complications for Computational Experiments from Modern Processors.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Practical Bigraphs via Subgraph Isomorphism.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants.
Proceedings of the Graph Transformation - 13th International Conference, 2020

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Justifying All Differences Using Pseudo-Boolean Reasoning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Understanding the Empirical Hardness of Random Optimisation Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
A review of literature on parallel constraint solving.
Theory Pract. Log. Program., 2018

Replicable parallel branch and bound search.
J. Parallel Distributed Comput., 2018

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases.
J. Artif. Intell. Res., 2018

Solving the task variant allocation problem in distributed robotics.
Auton. Robots, 2018

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
A Partitioning Algorithm for Maximum Common Subgraph Problems.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Maximum Weight Clique Algorithms, and How They Are Evaluated.
Proceedings of the Principles and Practice of Constraint Programming, 2017

Between Subgraph Isomorphism and Maximum Common Subgraph.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Finding Maximum k-Cliques Faster Using Lazy Global Domination.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Task Variant Allocation in Distributed Robotics.
Proceedings of the Robotics: Science and Systems XII, University of Michigan, Ann Arbor, Michigan, USA, June 18, 2016

Portfolios of Subgraph Isomorphism Algorithms.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Solving Hard Subgraph Problems in Parallel.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Morphing Between Stable Matching Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2016

Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound.
ACM Trans. Parallel Comput., 2015

A parallel branch and bound algorithm for the maximum labelled clique problem.
Optim. Lett., 2015

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science.
CoRR, 2014

An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Greedy Graph Colouring is a Misleading Heuristic.
CoRR, 2013

Multi-Threading a State-of-the-Art Maximum Clique Algorithm.
Algorithms, 2013

2012
Distributing an Exact Algorithm for Maximum Clique: maximising the costup
CoRR, 2012


  Loading...