The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Today, companies are required to be in control of their IT assets, and to provide proof of this in the form of independent IT audit reports. However, many companies have outsourced...
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...