We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery
and are k-local, ie, each intermediate node v's routing decision only depends on knowledge …

We consider online routing algorithms for finding paths between the vertices of plane
graphs. Although it has been shown in Bose et al.(Internat. J. Comput. Geom. 12 (4)(2002) …

Social networks consist of a set of individuals and some form of social relationship that ties
the individuals together. In this thesis, we use algorithmic techniques to study three aspects …

Almost all geographic routing protocols have been designed for 2-D. We present a novel
geographic routing protocol, named Multihop Delaunay Triangulation (MDT), for 2-D, 3-D …

We present a deterministic local routing algorithm that is guaranteed to find a path between
any pair of vertices in a half-\theta_6-graph (the half-\theta_6-graph is equivalent to the …

We study the problem of routing in three-dimensional ad hoc networks. We are interested in
routing algorithms that guarantee delivery and are k-local, ie, each intermediate node v's …

We present a deterministic local routing scheme that is guaranteed to find a path between
any pair of vertices in a half-θ6-graph whose length is at most 5/√ 3= 2.886… times the …

We examine bounds on the locality of routing. A local routing algorithm makes a sequence
of distributed forwarding decisions, each of which is made using only local information …

We present two algorithms that compute constant factor approximations of a minimum
convex partition of a set P of n points in the plane. The first algorithm is very simple and …

The sequence of adjacent nodes (graph walk) visited by a routing algorithm on a graph G
between given source and target nodes s and t is a c-competitive route if its length in G is at …