Patrick Prosser

University of Glasgow — United Kingdom

Computer Science · Physical Sciences

29h-index3.0kcitations105works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Constraint Satisfaction and Optimization(56), Data Management and Algorithms(20), Complexity and Algorithms in Graphs(18), Advanced Graph Theory Research(13), Scheduling and Optimization Algorithms(13)

Publications105 total

Finding Maximum k-Cliques Faster Using Lazy Global Domination
Proceedings of the International Symposium on Combinatorial Search·2021· 2 citedOpen Access
Finding Subgraphs with Side Constraints
Lecture notes in computer science·2021Open Access
A General Framework for Stable Roommates Problems using Answer Set Programming
Theory and Practice of Logic Programming·2020· 1 citedOpen Access
A General Framework for Stable Roommates Problems using Answer Set\n Programming
arXiv (Cornell University)·2020Open Access
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
Lecture notes in computer science·2020· 46 citedOpen Access
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
Lecture notes in computer science·2020· 17 citedOpen Access
A Constraint Model for the Tree Decomposition of a Graph
arXiv (Cornell University)·2019Open Access
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms
Lecture notes in computer science·2019· 29 citedOpen Access
Understanding the Empirical Hardness of Random Optimisation Problems
Lecture notes in computer science·2019· 1 citedOpen Access
Constraints for symmetry breaking in graph representation
Constraints·2018· 21 citedOpen Access
A review of literature on parallel constraint solving
Theory and Practice of Logic Programming·2018· 1 citedOpen Access
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
Journal of Artificial Intelligence Research·2018· 42 citedOpen Access
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms
Lecture notes in computer science·2018· 3 citedOpen Access
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms
HAL (Le Centre pour la Communication Scientifique Directe)·2018Open Access
A Partitioning Algorithm for Maximum Common Subgraph Problems
2017· 23 citedOpen Access
On Maximum Weight Clique Algorithms, and How They Are Evaluated
Lecture notes in computer science·2017· 15 cited
Heuristics and really hard instances for subgraph isomorphism problems
ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)·2016· 11 cited
Task Variant Allocation in Distributed Robotics
2016· 5 citedOpen Access
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
Lecture notes in computer science·2016· 24 cited
Morphing Between Stable Matching Problems
Lecture notes in computer science·2016· 1 cited
page 1 of 6Next →

Frequent Co-authors

Ciaran McCreesh(12), Ian P. Gent(11), Toby Walsh(8), Ewan MacIntyre(6), James Trimble(6), Paul Shaw(4), Barbara M. Smith(4), J. Christopher Beck(4), Chris Unsworth(4), Philip Kilby(3), Evgeny Selensky(2), David F. Manlove(2), Christine Solnon(2), Richard J. Wallace(2), Claude Müller(2), Michael Codish(2), Alice Miller(2), Peter J. Stuckey(2), Bruno De Backer(1), Vincent Furnon(1)