Duncan Adamson

activity

20202026

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2024

Collision-Free Robot Scheduling

Duncan Adamson, Nathan Flaherty, Igor Potapov +1

Robots are becoming an increasingly common part of scientific work within laboratory environments. In this paper, we investigate the problem of designing \emph{schedules} for compl…

cs.DS2023★ 1 cited

Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß +2

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the d…

cs.DS2023

Ranking and Unranking k-subsequence universal words

Duncan Adamson

A subsequence of a word $w$ is a word $u$ such that $u = w [i_{1}] w [i_{2}], \dots w [i_{∣ u ∣}]$ , for some set of indices $1 \leq i_{1} < i_{2} < \dots < i_{k} \leq ∣ w ∣$ . A word $w$ is $k$ -sub…

cs.DS2020

The K-Centre Problem for Necklaces

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1

In graph theory, the objective of the k-centre problem is to find a set of $k$ vertices for which the largest distance of any vertex to its closest vertex in the $k$ -set is minimis…