Skip to main navigation Skip to search Skip to main content
Duncan Adamson

View Scopus Profile

Duncan Adamson

Dr

 https://orcid.org/0000-0003-3343-2435

  • School of Computer Science, North Haugh, St Andrews, Fife, KY16 9SS, UK

Accepting Postgraduate Research Students

Personal profile

Research overview

My main research interests are in Temporal Graphs and Combinatorics on Words.

Temporal Graphs:

I am interested in a broad range of problems on temporal graphs, including Exploration, Multiagent Routing, Colouring, and similar problems. I am always happy to discuss any of these projects or to work on a similar topic in this area then please reach out.

Combinatorics on Words:

Here I am interested largely on studying classes of words (aka strings, sequences, etc.) based on key properties, such as subsequence universality.

External positions

Honorary Advisor, University of Liverpool

1 Apr 2024 → …

Fingerprint

Dive into the research topics where Duncan Adamson is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles
View full fingerprint

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Explore network further

  • k-universality of regular languages

    Adamson, D., Fleischmann, P., Huch, A., Koß, T., Manea, F. & Nowotka, D., Nov 2025, In: Information and Computation. 307, p. 1-17 17 p., 105357.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File

  • Harmonious colourings of temporal matchings

    Adamson, D., 29 Oct 2025, In: Theoretical Computer Science. 1053, p. 1-9 9 p., 115437.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    File

  • 2-word-π-representable graphs

    Adamson, D., Dietz, A., Fleischmann, P., Huch, A. & Sacher, S. C., 26 May 2026, arXiv, 21 p.

    Research output: Working paper › Preprint

  • Distributed weak independent sets in hypergraphs: upper and lower bounds

    Adamson, D., Rosenbaum, W. & Spirakis, P. G., 2026, Algorithmics of wireless networks: 21st international symposium, ALGOWIN 2025, Warsaw, Poland, September 18–19, 2025, proceedings. Michail, O. & Prencipe, G. (eds.). Cham: Springer, p. 1-16 16 p. (Lecture notes in computer science; vol. 16078 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    File

  • Maintaining bipartite colourings on temporal graphs on a budget

    Adamson, D., Mertzios, G. B. & Spirakis, P. G., 24 May 2026, Structural information and communication complexity: 33rd international colloquium, SIROCCO 2026, Durham, UK, June 9-11, 2026, Proceedings. Georgiou, C. (ed.). Cham: Springer, p. 21-33 13 p. (Lecture notes in computer science; vol. 16488).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    File
View all 29 research outputs