A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
In a multi-service network such as ATM, adaptive data services ( such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources ...
I present analysis examining some of the causes of poor connectivity in developing countries. Based on a technoeconomic analysis and design, I show that technical limitations per ...