Ph.D. student Glencora Borradaile has been awarded a National Sciences and Engineering Research Council (NSERC) Postdoctoral Fellowship. (NSERC is the Canadian equivalent of NSF.) The fellowship is tenurable at any Canadian institution for two years.
Glencora's thesis research concerns designing theoretically efficient algorithms for optimization problems in planar graphs. She has worked with Philip Klein in giving a simple algorithm for finding the maximum st-flow in a directed planar graph. She has given invited talks on this result at The University of Waterloo, NYU, IBM Watson, CMU and Dartmouth. In collaboration with Philip Klein and Claire Mathieu, she has been working on designing polynomial-time approximation schemes for the Steiner tree problem in planar graphs. Both results appeared at the Symposium for Discrete Algorithms (SODA) in 2006 and 2007, respectively. Glencora will complete her Ph.D. in late 2007.
For more information about this award, please see http://www.nserc.gc.ca/sf_e.asp?nav=sfnav&;lbi=3a
