Scholar
Duncan Adamson
Google Scholar ID: FWri_10AAAAJ
University of Liverpool
Citations & Impact
Citations
155
H-index
7
i10-index
5
Publications
20
Co-authors
4
list available
Publications
Resume (English only)
Academic Achievements
- Published 'Word Chain Generators for Prefix Normal Words' with Moritz Dudey, Pamela Fleischmann, and Annika Huch at RP 2025; full version on arXiv
- Published 'Tight Bounds for the Number of Absent Subsequences' with Pamela Fleischmann
- Master’s dissertation established new bounds on blocking pairs in stable matchings with incomplete lists and ties
- Demonstrated computational hardness results in crystal structure prediction and explored solution methods for related problems
- Full publication list available on DBLP profile
Research Experience
- Lecturer, School of Computer Science, University of St Andrews
- Former Research Fellow and Theme Lead, Leverhulme Research Centre for Functional Materials Design
- Postdoctoral researcher in Combinatorics on Words, Theoretische Informatik group, University of Göttingen
- Postdoctoral researcher at the Icelandic Centre of Excellence in Theoretical Computer Science, Reykjavik University, working on distributed colouring problems
- Postgraduate researcher at the Department of Computer Science, University of Liverpool
Education
- PhD from the Department of Computer Science, University of Liverpool, in the Algorithms and Complexity Research Group
- PhD thesis: 'Algorithmic and Combinatorial Problems in Crystal Structure Prediction'
- Primary supervisor: Prof. Igor Potapov; secondary supervisors: Matthew Dyer and Vladimir Gusev
- PhD funded by the Leverhulme Research Centre for Functional Materials Design
- Undergraduate studies at the University of Glasgow; Master’s project supervised by David Manlove
Background
- Currently a Lecturer in the School of Computer Science at the University of St Andrews
- Main research interests: combinatorics on words, algorithms for combinatorial objects, and applying computational techniques to problems originating in Chemistry
- Interested in exploration and colouring problems on temporal graphs
- Focuses on symmetries in words (e.g., reflective and translational symmetries in multidimensional settings)
- Aims to extend one-dimensional combinatorial results to multidimensional contexts
- Studies the k-centre problem for implicitly defined objects such as graphs and words
- During PhD, focused on crystal structure prediction from first principles, analyzing its computational hardness and developing solution approaches
- Master’s work addressed stable matching with incomplete lists and ties, establishing new bounds on blocking pairs for maximum matchings
