- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from

**publisher and metadata sources**).Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem is to find a spanning tree where the length of the longest edge in tree is minimum. It is a well-known fact that… Continue Reading

We propose a new heuristic for deter- ministic deployment of wireless sensor networks when 1-connectivity and minimum cost are the two com- peting objectives. Given a set of data sources and a base… Continue Reading

Let h>=1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignment of nonnegative integers (labels) to its vertices such that adjacent vertices receive labels with… Continue Reading

AbstractThe geometric $$\delta $$δ-minimum spanning tree problem ($$\delta $$δ-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex… Continue Reading

The geometric bottleneck Steiner network problem on a set of vertices X embedded in a normed plane requires one to construct a graph G spanning X and a variable set of k>=0 additional points, such… Continue Reading

The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Papadimitriou using… Continue Reading

Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the… Continue Reading

The authors propose a novel relay augmentation strategy for extending the lifetime of a certain class of wireless sensor networks. In this class sensors are located at fixed and pre-determined… Continue Reading

Given a set of points in the Euclidean plane, the Euclidean \textit{$\delta$-minimum spanning tree} ($\delta$-MST) problem is the problem of finding a spanning tree with maximum degree no more than… Continue Reading

For a given set of nodes in the plane the min-power centre is a point such that the cost of the star centred at this point and spanning all nodes is minimised. The cost of the star is defined as the… Continue Reading