Sciweavers

CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 2 months ago
On the Minimal Uncompletable Word Problem
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
Gabriele Fici, Elena V. Pribavkina, Jacques Sakaro...
CCCG
2008
13 years 6 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...