Duncan Adamson

According to our database, Duncan Adamson authored at least 16 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Collision-Free Robot Scheduling.

Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis

CoRR, 2024

Enumerating m-Length Walks in Directed Graphs with Constant Delay.

Duncan Adamson, Pawel Gawrychowski, Florin Manea

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs.

Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Optimality guarantees for crystal structure prediction.

Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky

Nat., 2023

The k-Centre Problem for Classes of Cyclic Words.

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Distributed Coloring of Hypergraphs.

Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the Structural Information and Communication Complexity, 2023

k-Universality of Regular Languages.

Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Longest Common Subsequence with Gap Constraints.

Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Ranking and Unranking k-Subsequence Universal Words.

Duncan Adamson

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Faster Exploration of Some Temporal Graphs.

Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

The Complexity of Periodic Energy Minimisation.

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Ranking Binary Unlabelled Necklaces in Polynomial Time.

Duncan Adamson

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

On the Hardness of Energy Minimisation for Crystal Structure Prediction.

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

Fundam. Informaticae, 2021

The k-Centre Selection Problem for Multidimensional Necklaces.

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

CoRR, 2021

Ranking Bracelets in Polynomial Time.

Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

The K-Centre Problem for Necklaces.

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

CoRR, 2020