Congratulations to Darren Strash, who passed his thesis defense today! Darren was co-advised by Mike Goodrich and me; his thesis combines research results from four papers on fast algorithms for geometric graphs with a sublinear number of crossings (such as road networks), greedy embedding (a technique for giving coordinates to sensor networks to allow simple routing algorithms to work), and clique-finding algorithms and their implementation.