Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ...
Nature 619 (7968), 68-72, 2023
33 2023 On the hardness of energy minimisation for crystal structure prediction D Adamson, A Deligkas, V Gusev, I Potapov
Fundamenta Informaticae 184, 2022
17 2022 Ranking bracelets in polynomial time D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2104.04324, 2021
13 2021 Faster exploration of some temporal graphs D Adamson, VV Gusev, D Malyshev, V Zamaraev
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 5 …, 2022
10 2022 Longest common subsequence with gap constraints D Adamson, M Kosche, T Koß, F Manea, S Siemer
International Conference on Combinatorics on Words, 60-76, 2023
8 2023 Ranking binary unlabelled necklaces in polynomial time D Adamson
International Conference on Descriptional Complexity of Formal Systems, 15-29, 2022
6 2022 Ranking and Unranking k -Subsequence Universal Words D Adamson
International Conference on Combinatorics on Words, 47-59, 2023
5 2023 The complexity of periodic energy minimisation D Adamson, A Deligkas, VV Gusev, I Potapov
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
5 2022 Collision-free robot scheduling D Adamson, N Flaherty, I Potapov, PG Spirakis
International Symposium on Algorithmics of Wireless Networks, 1-15, 2024
2 2024 Combinatorial algorithms for multidimensional necklaces D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2108.01990, 2021
2 2021 Brief announcement: Collision-free robot scheduling D Adamson, N Flaherty, I Potapov, PG Spirakis
Leibniz International Proceedings in Informatics, LIPIcs 292, 22, 2024
1 2024 Enumerating m -Length Walks in Directed Graphs with Constant Delay D Adamson, P Gawrychowski, F Manea
Latin American Symposium on Theoretical Informatics, 35-50, 2024
1 2024 D Adamson, P Fleischmann, A Huch, T Koß, F Manea, D Nowotka
arXiv preprint arXiv:2311.10658, 2023
1 2023 Distributed coloring of hypergraphs D Adamson, MM Halldórsson, A Nolin
International Colloquium on Structural Information and Communication …, 2023
1 2023 The k-centre problem for classes of cyclic words D Adamson, A Deligkas, VV Gusev, I Potapov
International Conference on Current Trends in Theory and Practice of …, 2023
1 2023 The k-centre selection problem for multidimensional necklaces D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2108.01990, 2021
1 2021 The K-Centre Problem for Necklaces D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2005.10095, 2020
1 2020 Fast and Safe Scheduling of Robots D Adamson, N Flaherty, I Potapov, PG Spirakis
arXiv preprint arXiv:2502.07851, 2025
2025 Exploring Word-Representable Temporal Graphs D Adamson
arXiv preprint arXiv:2502.07496, 2025
2025 Distributed weak independent sets in hypergraphs: Upper and lower bounds D Adamson, W Rosenbaum, PG Spirakis
arXiv preprint arXiv:2411.13377, 2024
2024 
Igor PotapovProfessor, Department of Computer Science, University of LiverpoolVahvistettu sähköpostiosoite verkkotunnuksessa liverpool.ac.uk