The problem of finding k uniformly spaced points (centres) within a metric space is well known as the k-centre selection problem. In this paper, we introduce the challenge of k …
D Adamson, N Flaherty, I Potapov… - Latin American Symposium …, 2024 - Springer
In this paper, we study the graph induced by the 2-swap permutation on words with a fixed Parikh vector. A 2-swap is defined as a pair of positions s=(i, j) where the word w induced by …
The focus of this thesis is to explore the geometric optimisation of crystal structures through an algorithmic lens. As a high-level description, this optimisation problem constitutes the …
I Potapov - SOFSEM 2023: Theory and Practice of Computer … - Springer
The problem of finding k uniformly spaced points (centres) within a metric space is well known as the k-centre selection problem. In this paper, we introduce the challenge of k …