Given an interval graph G, the interval count problem is that of computing the minimum number IC(G) of interval lengths needed to represent G. Although the problem of deciding whether IC(G) = 1 isâ€¦ (More)

In this paper we challenge the widely accepted premise that, in order to carry out a distributed computation, say on the cloud, users have to inform, along with all the inputs that the algorithm inâ€¦ (More)

The aim of this study was to apply a molecular protocol to detect leptospiral DNA in environmental water samples. The study was carried out in a peri-urban settlement in PetrÃ³polis, state of Rio deâ€¦ (More)

We study those unit interval graphs having a model with intervals of prescribed integer length. We present a structural result for this subclass which leads to a quadraticâ€“time recognition algorithmâ€¦ (More)

We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibitingâ€¦ (More)

The interval count problem determines the smallest number of interval lengths needed in order to represent an interval model of a given interval graph or interval order. Despite the large number ofâ€¦ (More)