1 citations · 1 across the 9 of their papers we have counts for
10 papers
Distributed Triangle and Simplex Enumeration in Hypergraphs
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In the last decade, subgraph detection and enumeration have emerged as central problems in distributed graph algorithms. This is largely due to the problems' theoretical challenges…
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…
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
Duncan Adamson, Nathan Flaherty, Igor Potapov +1
In this paper, we study the graph induced by the permutation on words with a fixed Parikh vector. A -swap is defined as a pair of positions where…
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…
Ranking and Unranking k-subsequence universal words
Duncan Adamson
A subsequence of a word is a word such that , for some set of indices . A word is -sub…
Ranking Binary Unlabelled Necklaces in Polynomial Time
Duncan Adamson
Unlabelled Necklaces are an equivalence class of cyclic words under both the rotation (cyclic shift) and the relabelling operations. The relabelling of a word is a bijective mappin…
Combinatorial Algorithms for Multidimensional Necklaces
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1
A necklace is an equivalence class of words of length over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic resu…
Ranking Bracelets in Polynomial Time
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet a…
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 vertices for which the largest distance of any vertex to its closest vertex in the -set is minimis…
On the Hardness of Energy Minimisation for Crystal Structure Prediction
Duncan Adamson, Argyrios Deligkas, Vladimir Gusev +1
Crystal Structure Prediction (csp) is one of the central and most challenging problems in materials science and computational chemistry. In csp, the goal is to find a configuration…