Kanellakis Graduate Fellowship, Spring 2006

January 5, 2006

Awarded by the Brown Computer Science department in memory of Paris Kanellakis.

Comments Off
Filed under:
Awards by Glencora

An O(n log n) algorithm for maximum st-flow in a directed planar graph

January 4, 2006

Glencora Borradaile and Philip Klein
Proceedings of the Symposium of Discrete Algorithms (SODA), Miami, Florida, 2006.

Comments Off
Filed under:
Conference, Publications by Glencora