Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 10.


Adamson, Duncan
(2021) Algorithmic and Combinatorial Problems in Crystal Structure Prediction. PhD thesis, University of Liverpool.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) Combinatorial Algorithms for Multidimensional Necklaces. [Preprint]


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2020) The K-Centre Problem for Necklaces. [Internet Publication]


Adamson, Duncan ORCID: 0000-0003-3343-2435, Kosche, Maria, Koß, Tore, Manea, Florin and Siemer, Stefan
(2023) Longest Common Subsequence with Gap Constraints. In: Words.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2020) On the Hardness of Energy Minimisation for Crystal Structure Prediction. [Internet Publication]


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) On the Hardness of Energy Minimisation for Crystal Structure Prediction. FUNDAMENTA INFORMATICAE, 184 (3). pp. 181-203.


Adamson, Duncan ORCID: 0000-0003-3343-2435, Gusev, Vladimir V, Deligkas, Argyrios, Antypov, Dmytro ORCID: 0000-0003-1893-7785, Collins, Chritopher M ORCID: 0000-0002-0101-4426, Krysta, Piotr, Potapov, Igor, Darling, George R ORCID: 0000-0001-9329-9993, Dyer, Matthew S ORCID: 0000-0002-4923-3003, Spirakis, Paul ORCID: 0000-0001-5396-3749
et al (show 1 more authors) (2023) Optimality Guarantees for Crystal Structure Prediction. Nature, 619 (7968). 68-+.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) Ranking Bracelets in Polynomial Time. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021).


Adamson, Duncan ORCID: 0000-0003-3343-2435
(2023) Ranking and Unranking k-Subsequence Universal Words. In: WORDS.


Adamson, Duncan ORCID: 0000-0003-3343-2435, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2023) The k-Centre Problem for Classes of Cyclic Words. .

This list was generated on Sat Oct 14 13:53:30 2023 BST.