We study the Identity Problem, the problem of determining if a finitely
...
In this paper, we study the graph induced by the 2-swap
permutation on w...
In this paper, we present a geometric framework for the passive localisa...
We study a model of programmable matter systems consisting of n devices
...
We consider a discrete system of n simple indistinguishable devices, cal...
A necklace is an equivalence class of words of length n over an alphabet...
The main result of the paper is the first polynomial-time algorithm for
...
In graph theory, the objective of the k-centre problem is to find a set ...
We consider a discrete system of n devices lying on a 2-dimensional squa...
A temporal graph is a dynamic graph where every edge is assigned a set o...
Crystal Structure Prediction (csp) is one of the central and most challe...
In this paper, we study a discrete system of entities residing on a
two-...
We consider the following variant of the Mortality Problem: given k× k
m...
We consider the following variant of the Mortality Problem: given k× k
m...
The problem of uniformly placing N points onto a sphere finds applicatio...
In this paper we investigate the decidability and complexity of problems...