Abstract. In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a poly...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
We consider a distributed source coding system in which several observations must be encoded separately and communicated to the decoder by using limited transmission rate. We intro...
An analysis framework is presented that can be used to assess important issues of mobile workforce solutions, based on recent literature on mobile business. Within this framework ...
Yan Wang, Elisabeth van de Kar, Geleyn R. Meijer, ...
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...