Doctoral students
Lesley Wiglesworth (Ph.D. May, 2008) topic: unit-bar visibility graphs
Tim Brauch (Ph.D. May, 2009), topic: applications of the Combinatorial Nullstellensatz on bipartite graphs
Adam Jobson (Ph.D. Dec., 2011), topic: avoiding, pretending, and querying: three combinatorial problems
Chris Caragianis (Ph.D. Dec. 2012), topic: connected matchings in special families of graphs
Charlie Suer (Ph.D. Aug. 2015), topic: the PC-tree
algorithm, Kuratowski subdivisions, and the torus