James Trimble

James Trimble

University of Glasgow

H-index: 11

Europe-United Kingdom

About James Trimble

James Trimble, With an exceptional h-index of 11 and a recent h-index of 10 (since 2020), a distinguished researcher at University of Glasgow, specializes in the field of graph algorithms, constraint programming, discrete optimisation.

His recent articles reflect a diverse array of research interests and contributions to the field:

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

Partitioning algorithms for induced subgraph problems

Improved instance generation for kidney exchange programmes

Induced universal graphs for families of small graphs

A new matheuristic and improved instance generation

PACE solver description: Tweed-plus: A subtree-improving heuristic solver for treedepth

Certifying solvers for clique and maximum common (connected) subgraph problems

The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants

James Trimble Information

University

Position

PhD Student

Citations(all)

425

Citations(since 2020)

371

Cited By

183

hIndex(all)

11

hIndex(since 2020)

10

i10Index(all)

11

i10Index(since 2020)

10

Email

University Profile Page

University of Glasgow

Google Scholar

View Google Scholar Profile

James Trimble Skills & Research Interests

graph algorithms

constraint programming

discrete optimisation

Top articles of James Trimble

Title

Journal

Author(s)

Publication Date

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

arXiv preprint arXiv:2311.00405

Gergely Csáji

David Manlove

Iain McBride

James Trimble

2023/11/1

Partitioning algorithms for induced subgraph problems

James Trimble

2023

Improved instance generation for kidney exchange programmes

Computers & Operations Research

Maxence Delorme

Sergio García

Jacek Gondzio

Jörg Kalcsics

David Manlove

...

2022/5/1

Induced universal graphs for families of small graphs

arXiv preprint arXiv:2109.00075

James Trimble

2021/8/31

A new matheuristic and improved instance generation

Maxence Delorme

Sergio Garcıa

Jacek Gondzio

Joerg Kalcsics

David Manlove

...

2021/6/2

PACE solver description: Tweed-plus: A subtree-improving heuristic solver for treedepth

James Trimble

2020

Certifying solvers for clique and maximum common (connected) subgraph problems

Stephan Gocht

Ross McBride

Ciaran McCreesh

Jakob Nordström

Patrick Prosser

...

2020/9/2

The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants

Ciaran McCreesh

Patrick Prosser

James Trimble

2020/6/23

PACE solver description: Bute-plus: A bottom-up exact solver for treedepth

arXiv preprint arXiv:2006.09912

James Trimble

2020/6/17

An algorithm for the exact treedepth problem

arXiv preprint arXiv:2004.08959

James Trimble

2020/4/19

See List of Professors in James Trimble University(University of Glasgow)

Co-Authors

H-index: 95
Tuomas Sandholm

Tuomas Sandholm

Carnegie Mellon University

H-index: 43
David Manlove

David Manlove

University of Glasgow

H-index: 39
Patrick Prosser

Patrick Prosser

University of Glasgow

H-index: 33
John P. Dickerson

John P. Dickerson

University of Maryland, Baltimore

H-index: 26
Jakob Nordström

Jakob Nordström

Københavns Universitet

academic-engine