| Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023 | 19 | 2023 |
| Ranking bracelets in polynomial time D Adamson, A Deligkas, VV Gusev, I Potapov arXiv preprint arXiv:2104.04324, 2021 | 15 | 2021 |
| 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 | 13 | 2020 |
| 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 | 7 | 2022 |
| Ranking and Unranking k-Subsequence Universal Words D Adamson International Conference on Combinatorics on Words, 47-59, 2023 | 5 | 2023 |
| On the hardness of energy minimisation for crystal structure prediction D Adamson, A Deligkas, V Gusev, I Potapov Fundamenta Informaticae 184, 2022 | 4 | 2022 |
| The complexity of periodic energy minimisation D Adamson, A Deligkas, VV Gusev, I Potapov 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | 4 | 2022 |
| 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 | 4 | 2022 |
| 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 |
| Collision-free robot scheduling D Adamson, N Flaherty, I Potapov, P Spirakis arXiv preprint arXiv:2402.12019, 2024 | 1 | 2024 |
| 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 |
| Combinatorial algorithms 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 |
| Tight Bounds for the Number of Absent Scattered Factors D Adamson, P Fleischmann, A Huch, M Wiedenhöft arXiv preprint arXiv:2407.18599, 2024 | | 2024 |
| Rollercoasters with Plateaus D Adamson, P Fleischmann, A Huch arXiv preprint arXiv:2407.18620, 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 |
Igor PotapovProfessor, Department of Computer Science, University of Liverpool在 liverpool.ac.uk 的电子邮件经过验证
