|
Doctoral Students Bundit Laekhanukit Nithum Thain Ethan Kim* Zhentao Li* Neil Olver* Nicholas Sonnerat* Masters Students Peter Sloan Nithum Thain Greg Costain Matt Drescher Daniel Simeone* Neil Olver Christina Boucher Nadia Hardy Chris Wu |
Dates Current Current Current Current 2006-10 2005-10 Dates Current 2006-08 2006-08 2005-07 2005-07 2005-06 2004-05 2004-05 2003-04 |
Thesis Title Algorithms Algorithmic game theory Bioinformatics Graph Theory "Robust network design" "Galaxy cutsets and graph connectivity: variations on a theme" Thesis Title - "On the transversal matroid secretary problem" "On the additive graph generated by a subset of the numbers" "An approximation algorithm for the maximum leaf arborescence problem" "Network connectivity: a tree decomposition approach" "The price of anarchy and a priority-based model of routing" "A study into the inefficiency of traffic flows induced by selfish agents" "Odd cycles in planar graphs" "Combinatorial auctions: allocation and communication" |
(*= co-supervised)