Glencora’s research interests are, most broadly, algorithms for discrete optimization problems. Her main research focus has been optimization problems in planar graphs, including approximation schemes for Steiner tree and survivable network design and fast, exact algorithms for maximum flow and, very recently, a min-cut oracle. She has forayed into geometric algorithms, embedding problems and generalizations of planar graphs and more recently into graph constrained knapsack problems that generalize and unify several problems including prize-collecting and budgeted maximum-coverage problems.
Glencora has been lucky to collaborate with grad students, postdocs, researchers and faculty from across North America and Europe. Since at OSU, she has begun working with in-house researchers in machine learning, programming languages and electrical engineering.
For a complete account of Glencora’s research, please see her publications. Recent talks are available and will slowly be back-posted.
