We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
In this paper we define the notion of causal chains. Causal chains are a particular kind of sequential patterns that reflect causality relations according to background knowledge....
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...