Duncan Adamson

Orcid: 0000-0003-3343-2435

According to our database1, Duncan Adamson authored at least 20 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tight Bounds for the Number of Absent Scattered Factors.
CoRR, 2024

Collision-Free Robot Scheduling.
CoRR, 2024

Brief Announcement: Collision-Free Robot Scheduling.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Harmonious Colourings of Temporal Matchings.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Rollercoasters with Plateaus.
Proceedings of the Reachability Problems - 18th International Conference, 2024

Enumerating m-Length Walks in Directed Graphs with Constant Delay.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Optimality guarantees for crystal structure prediction.
Nat., 2023

The k-Centre Problem for Classes of Cyclic Words.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Distributed Coloring of Hypergraphs.
Proceedings of the Structural Information and Communication Complexity, 2023

k-Universality of Regular Languages.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Longest Common Subsequence with Gap Constraints.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Ranking and Unranking k-Subsequence Universal Words.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
Faster Exploration of Some Temporal Graphs.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

The Complexity of Periodic Energy Minimisation.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Ranking Binary Unlabelled Necklaces in Polynomial Time.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
On the Hardness of Energy Minimisation for Crystal Structure Prediction.
Fundam. Informaticae, 2021

The k-Centre Selection Problem for Multidimensional Necklaces.
CoRR, 2021

Ranking Bracelets in Polynomial Time.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
The K-Centre Problem for Necklaces.
CoRR, 2020


  Loading...