Heather Newman

Heather Newman is an Assistant Professor of Computer Science, working at the intersection of discrete math, theoretical computer science, and operations research. Heather’s research concerns algorithms for combinatorial optimization problems, such as clustering and resource allocation, with an emphasis on providing provable guarantees on solution quality, runtime, and robustness to uncertainty. Her specific areas of interest include approximation algorithms, algorithms under uncertainty, and new models for beyond-worst-case analysis. Heather holds an A.B. in Mathematics from Princeton University, an M.Sc. in Mathematical Sciences from the University of Oxford, and a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University.