The K-Centre Problem for Necklaces. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (CoRR, 2020)

Ranking Bracelets in Polynomial Time. - Duncan Adamson; Vladimir V. Gusev; Igor Potapov; Argyrios Deligkas (CPM, 2021)

The k-Centre Selection Problem for Multidimensional Necklaces. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (CoRR, 2021)

On the Hardness of Energy Minimisation for Crystal Structure Prediction. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (Fundam. Informaticae, 2021)

Ranking Binary Unlabelled Necklaces in Polynomial Time. - Duncan Adamson (DCFS, 2022)

The Complexity of Periodic Energy Minimisation. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (MFCS, 2022)

Faster Exploration of Some Temporal Graphs. - Duncan Adamson; Vladimir V. Gusev; Dmitriy S. Malyshev; Viktor Zamaraev (SAND, 2022)

Ranking and Unranking k-Subsequence Universal Words. - Duncan Adamson (WORDS, 2023)

Longest Common Subsequence with Gap Constraints. - Duncan Adamson; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (WORDS, 2023)

k-Universality of Regular Languages. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea; Dirk Nowotka (ISAAC, 2023)

Distributed Coloring of Hypergraphs. - Duncan Adamson; Magnús M. Halldórsson; Alexandre Nolin (SIROCCO, 2023)

The k-Centre Problem for Classes of Cyclic Words. - Duncan Adamson; Argyrios Deligkas; Vladimir V. Gusev; Igor Potapov (SOFSEM, 2023)

Optimality guarantees for crystal structure prediction. - Vladimir V. Gusev; Duncan Adamson; Argyrios Deligkas; Dmytro Antypov; Christopher M. Collins 003; Piotr Krysta; Igor Potapov; George R. Darling; Matthew S. Dyer; Paul G. Spirakis; Matthew J. Rosseinsky (Nat., 2023)

Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (LATIN (2), 2024)

Enumerating m-Length Walks in Directed Graphs with Constant Delay. - Duncan Adamson; Pawel Gawrychowski; Florin Manea (LATIN (1), 2024)

Rollercoasters with Plateaus. - Duncan Adamson; Pamela Fleischmann; Annika Huch (RP, 2024)

Brief Announcement: Collision-Free Robot Scheduling. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (SAND, 2024)

Tight Bounds for the Number of Absent Scattered Factors. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Max Wiedenhöft (CoRR, 2024)

Distributed weak independent sets in hypergraphs: Upper and lower bounds. - Duncan Adamson; Will Rosenbaum; Paul G. Spirakis (CoRR, 2024)

k-Universality of Regular Languages Revisited. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea (IJTCS-FAW, 2025)

Brief Announcement: Exploring Word-Representable Temporal Graphs. - Duncan Adamson (SAND, 2025)

Collision-free Robot Scheduling. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (Inf. Comput., 2025)

Harmonious colourings of temporal matchings. - Duncan Adamson (Theor. Comput. Sci., 2025)

Exploring Word-Representable Temporal Graphs. - Duncan Adamson (CoRR, 2025)

Fast and Safe Scheduling of Robots. - Duncan Adamson; Nathan Flaherty; Igor Potapov; Paul G. Spirakis (CoRR, 2025)

k-Universality of Regular Languages Revisited. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea (CoRR, 2025)

Exploring Temporal Graphs with Frequent and Regular Edges. - Duncan Adamson (CoRR, 2025)

Longest Common Subsequence with Gap Constraints. - Duncan Adamson; Paul Sarnighausen-Cahn; Marius Dumitran; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (Theory Comput. Syst., 2025)