Brown CS News

Archives Oct. 4, 2006

Last update on .

Philip Klein has been awarded a $300,000 grant from the National Science Foundation. The funding will support Klein's research on algorithms for solving optimization problems on planar graphs - graphs that can be drawn on the plane with no crossings. Such graphs are necessary in image processing and road map logistics.

Possible uses for ...

Previous day

Sept. 29, 2006

Next day

Oct. 13, 2006