Research outputs
2026
Crystal Structure Prediction, A Challenging and Fundamental Problem
Adamson, D. (2026). Crystal Structure Prediction, A Challenging and Fundamental Problem. In Communications in Computer and Information Science (pp. 90-96). Springer Nature Switzerland. doi:10.1007/978-3-032-04731-1_12
2025
k-Universality of Regular Languages
Adamson, D., Fleischmann, P., Huch, A., Koß, T., Manea, F., & Nowotka, D. (2025). k-Universality of Regular Languages. Information and Computation, 307, 105357. doi:10.1016/j.ic.2025.105357
Harmonious colourings of temporal matchings
Adamson, D. (2025). Harmonious colourings of temporal matchings. Theoretical Computer Science, 1053, 115437. doi:10.1016/j.tcs.2025.115437
Brief Announcement: Exploring Word-Representable Temporal Graphs
Adamson, D. (2025). Brief Announcement: Exploring Word-Representable Temporal Graphs. In Leibniz International Proceedings in Informatics Lipics Vol. 330. doi:10.4230/LIPIcs.SAND.2025.22
Collision-Free Robot Scheduling
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2025). Collision-Free Robot Scheduling. In Unknown Conference (pp. 1-15). Springer Nature Switzerland. doi:10.1007/978-3-031-74580-5_1
k-Universality of Regular Languages Revisited
Adamson, D., Fleischmann, P., Huch, A., Koß, T., & Manea, F. (2025). k-Universality of Regular Languages Revisited. In Lecture Notes in Computer Science (pp. 16-32). Springer Nature Singapore. doi:10.1007/978-981-96-8312-3_2
2024
Brief Announcement: Collision-Free Robot Scheduling
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2024). Brief Announcement: Collision-Free Robot Scheduling. In Leibniz International Proceedings in Informatics Lipics Vol. 292. doi:10.4230/LIPIcs.SAND.2024.22
Harmonious Colourings of Temporal Matchings
Adamson, D. (2024). Harmonious Colourings of Temporal Matchings. In Leibniz International Proceedings in Informatics Lipics Vol. 292. doi:10.4230/LIPIcs.SAND.2024.4
Enumerating m-Length Walks in Directed Graphs with Constant Delay
Adamson, D., Gawrychowski, P., & Manea, F. (2024). Enumerating m-Length Walks in Directed Graphs with Constant Delay. In Lecture Notes in Computer Science (pp. 35-50). Springer Nature Switzerland. doi:10.1007/978-3-031-55598-5_3
Rollercoasters with Plateaus
Adamson, D., Fleischmann, P., & Huch, A. (2024). Rollercoasters with Plateaus. In Lecture Notes in Computer Science (pp. 73-87). Springer Nature Switzerland. doi:10.1007/978-3-031-72621-7_6
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs
Adamson, D., Flaherty, N., Potapov, I., & Spirakis, P. G. (2024). Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. Unknown Journal, 61-76. doi:10.1007/978-3-031-55601-2_5
2023
k-Universality of Regular Languages
Adamson, D., Fleischmann, P., Huch, A., Koß, T., Manea, F., & Nowotka, D. (2023). k-Universality of Regular Languages. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 283. doi:10.4230/LIPIcs.ISAAC.2023.4
Optimality Guarantees for Crystal Structure Prediction
Adamson, D., Gusev, V. V., Deligkas, A., Antypov, D., Collins, C. M., Krysta, P., . . . Rosseinsky, M. J. (2023). Optimality Guarantees for Crystal Structure Prediction. Nature. doi:10.1038/s41586-023-06071-y
Ranking and Unranking k-subsequence universal words
Distributed Coloring of Hypergraphs
Adamson, D., Halldórsson, M. M., & Nolin, A. (2023). Distributed Coloring of Hypergraphs. In Unknown Conference (pp. 89-111). Springer Nature Switzerland. doi:10.1007/978-3-031-32733-9_5
Longest Common Subsequence with Gap Constraints
Adamson, D., Kosche, M., Koß, T., Manea, F., & Siemer, S. (2023). Longest Common Subsequence with Gap Constraints. In Unknown Conference (pp. 60-76). Springer Nature Switzerland. doi:10.1007/978-3-031-33180-0_5
Ranking and Unranking k-Subsequence Universal Words
Adamson, D. (2023). Ranking and Unranking k-Subsequence Universal Words. In Unknown Conference (pp. 47-59). Springer Nature Switzerland. doi:10.1007/978-3-031-33180-0_4
The k-Centre Problem for Classes of Cyclic Words
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2023). The k-Centre Problem for Classes of Cyclic Words. In SOFSEM 2023: THEORY AND PRACTICE OF COMPUTER SCIENCE Vol. 13878 (pp. 385-400). doi:10.1007/978-3-031-23101-8_26
2022
The Complexity of Periodic Energy Minimisation
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2022). The Complexity of Periodic Energy Minimisation. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 241. doi:10.4230/LIPIcs.MFCS.2022.8
Faster Exploration of Some Temporal Graphs
Adamson, D., Gusev, V. V., Malyshev, D., & Zamaraev, V. (2022). Faster Exploration of Some Temporal Graphs. In Leibniz International Proceedings in Informatics Lipics Vol. 221. doi:10.4230/LIPIcs.SAND.2022.5
On the Hardness of Energy Minimisation for Crystal Structure Prediction
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2021). On the Hardness of Energy Minimisation for Crystal Structure Prediction. FUNDAMENTA INFORMATICAE, 184(3), 181-203. doi:10.3233/FI-2021-2096
Ranking Binary Unlabelled Necklaces in Polynomial Time
Adamson, D. (2022). Ranking Binary Unlabelled Necklaces in Polynomial Time. In DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022 Vol. 13439 (pp. 15-29). doi:10.1007/978-3-031-13257-5_2
2021
Algorithmic and Combinatorial Problems in Crystal Structure Prediction
Adamson, D. (2021, November 8). Algorithmic and Combinatorial Problems in Crystal Structure Prediction.
Ranking Bracelets in Polynomial Time
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2021). Ranking Bracelets in Polynomial Time. Retrieved from http://arxiv.org/abs/2104.04324v1
2020
The K-Centre Problem for Necklaces
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2020). The K-Centre Problem for Necklaces. Retrieved from http://arxiv.org/abs/2005.10095v1
2019
On the Hardness of Energy Minimisation for Crystal Structure Prediction
Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2020). On the Hardness of Energy Minimisation for Crystal Structure Prediction. doi:10.1007/978-3-030-38919-2_48