The scalability challenge of geometric routing is to construct succinct coordinates for all
nodes in the network. This paper presents SPrefix-B, a practical greedy embedding scheme …

I always wanted to be a scientist. What could be more interesting than nding out new things
about the world? Not only that, but nding out before anyone else? After graduating with my …

The class of Euclidean unit disk graphs is one of the most fundamental and well-studied
graph classes with underlying geometry. In this paper, we identify this class as a special …