Seguir
Duncan Adamson
Duncan Adamson
Dirección de correo verificada de liverpool.ac.uk - Página principal
Título
Citado por
Citado por
Año
Optimality guarantees for crystal structure prediction
VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ...
Nature 619 (7968), 68-72, 2023
172023
Ranking bracelets in polynomial time
D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2104.04324, 2021
152021
On the hardness of energy minimisation for crystal structure prediction
D Adamson, A Deligkas, VV Gusev, I Potapov
SOFSEM 2020: Theory and Practice of Computer Science: 46th International …, 2020
132020
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
82023
Ranking binary unlabelled necklaces in polynomial time
D Adamson
International Conference on Descriptional Complexity of Formal Systems, 15-29, 2022
72022
Ranking and Unranking k-Subsequence Universal Words
D Adamson
International Conference on Combinatorics on Words, 47-59, 2023
52023
On the hardness of energy minimisation for crystal structure prediction
D Adamson, A Deligkas, V Gusev, I Potapov
Fundamenta Informaticae 184, 2022
42022
The complexity of periodic energy minimisation
D Adamson, A Deligkas, VV Gusev, I Potapov
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
42022
Faster exploration of some temporal graphs
D Adamson, VV Gusev, D Malyshev, V Zamaraev
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022
42022
Collision-free robot scheduling
D Adamson, N Flaherty, I Potapov, P Spirakis
arXiv preprint arXiv:2402.12019, 2024
12024
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
12023
The k-centre selection problem for multidimensional necklaces
D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2108.01990, 2021
12021
Combinatorial algorithms for multidimensional necklaces
D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2108.01990, 2021
12021
The K-Centre Problem for Necklaces
D Adamson, A Deligkas, VV Gusev, I Potapov
arXiv preprint arXiv:2005.10095, 2020
12020
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
2024
Structural and combinatorial properties of 2-swap word permutation graphs
D Adamson, N Flaherty, I Potapov, PG Spirakis
Latin American Symposium on Theoretical Informatics, 61-76, 2024
2024
Harmonious Colourings of Temporal Matchings
D Adamson
3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), 2024
2024
Brief Announcement: Collision-Free Robot Scheduling
D Adamson, N Flaherty, I Potapov, PG Spirakis
3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), 2024
2024
-Universality of Regular Languages
D Adamson, P Fleischmann, A Huch, T Koß, F Manea, D Nowotka
arXiv preprint arXiv:2311.10658, 2023
2023
Distributed coloring of hypergraphs
D Adamson, MM Halldórsson, A Nolin
International Colloquium on Structural Information and Communication …, 2023
2023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20