Research output per year
Research output per year
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
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
-
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 AccessFile -
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 AccessFile -
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 AccessFile -
Brief announcement: exploring word-representable temporal graphs
Adamson, D., 2 Jun 2025, 4th symposium on algorithmic foundations of dynamic networks (SAND 2025). Meeks, K. & Scheideler, C. (eds.). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6 p. 22. (Leibniz international proceedings in informatics (LIPIcs); vol. 330).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Collision-free robot scheduling
Adamson, D., Flaherty, N., Potapov, I. & Spirakis, P. G., May 2025, In: Information and Computation. 304, p. 1-14 14 p., 105294.Research output: Contribution to journal › Article › peer-review
Open AccessFile
Prizes
-
Best Paper Award SAND 2024
Adamson, D. A. (Recipient), 5 Jun 2024
Prize: Prize (including medals and awards)