In this paper, we establish a novel balanced separator theorem for Unit Disk Graphs (UDGs), which mimics the well-known Lipton and Tarjan’s planar balanced shortest paths separator theorem. We prove t......

In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a system of µ collective a......

Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span ” an interval graph G. Inparticular, for any pair of vertices u, v we require a tree T ∈T su......

In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded clique-w......

In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V,E) admits a system of µ collective ad......

Abstract We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an input graph G is constructed by adding edges between pairs ......

This paper concerns construction of additive stretched spanners with few edges for n-vertex graphs having a tree-decomposition into bags of diameter at most δ, i.e., the tree-length δ graphs. For such......

A graph G =(V, E) is said to admit a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that for any two vertices u, v of G a spanning tre......

In this paper we show how to use the notion of layering-tree introduced in [5], in order to construct efficient routing schemes. We obtain a routing scheme polynomial time constructible for tree-lengt......

Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex ......