James Trimble

Orcid: 0000-0001-7282-8745

Affiliations:
  • University of Glasgow, UK


According to our database1, James Trimble authored at least 20 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Partitioning algorithms for induced subgraph problems.
PhD thesis, 2023

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples.
CoRR, 2023

2022
Improved instance generation for kidney exchange programmes.
Comput. Oper. Res., 2022

2021
Induced universal graphs for families of small graphs.
CoRR, 2021

2020
Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty).
CoRR, 2020

An Algorithm for the Exact Treedepth Problem.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 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

2019
A Constraint Model for the Tree Decomposition of a Graph.
CoRR, 2019

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

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

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

2017
"Almost-stable" matchings in the Hospitals / Residents problem with Couples.
Constraints An Int. J., 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

2016
Position-Indexed Formulations for Kidney Exchange.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
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


  Loading...